/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_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:15:48,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:15:48,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:15:48,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:15:48,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:15:48,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:15:48,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:15:48,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:15:48,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:15:48,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:15:48,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:15:48,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:15:48,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:15:48,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:15:48,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:15:48,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:15:48,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:15:48,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:15:48,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:15:48,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:15:48,811 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:15:48,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:15:48,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:15:48,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:15:48,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:15:48,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:15:48,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:15:48,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:15:48,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:15:48,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:15:48,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:15:48,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:15:48,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:15:48,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:15:48,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:15:48,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:15:48,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:15:48,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:15:48,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:15:48,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:15:48,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:15:48,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:15:48,825 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:15:48,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:15:48,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:15:48,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:15:48,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:15:48,860 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:15:48,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:15:48,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:15:48,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:15:48,861 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:15:48,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:15:48,862 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:15:48,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:15:48,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:15:48,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:15:48,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:15:48,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:15:48,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:15:48,863 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:15:48,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:15:48,864 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:15:48,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:15:48,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:15:48,864 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:15:48,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:15:48,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:15:48,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:15:48,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:15:48,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:15:48,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:15:48,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:15:48,865 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:15:48,865 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:15:48,865 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:15:48,865 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:15:49,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:15:49,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:15:49,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:15:49,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:15:49,092 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:15:49,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-27 13:15:49,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e2a6d48/528998282f6b42f48926f718f9fe0027/FLAG17b88e231 [2022-04-27 13:15:49,545 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:15:49,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-27 13:15:49,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e2a6d48/528998282f6b42f48926f718f9fe0027/FLAG17b88e231 [2022-04-27 13:15:49,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45e2a6d48/528998282f6b42f48926f718f9fe0027 [2022-04-27 13:15:49,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:15:49,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:15:49,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:15:49,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:15:49,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:15:49,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90b3c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49, skipping insertion in model container [2022-04-27 13:15:49,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:15:49,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:15:49,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2022-04-27 13:15:49,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:15:49,796 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:15:49,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c[535,548] [2022-04-27 13:15:49,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:15:49,834 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:15:49,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49 WrapperNode [2022-04-27 13:15:49,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:15:49,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:15:49,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:15:49,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:15:49,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:15:49,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:15:49,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:15:49,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:15:49,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49" (1/1) ... [2022-04-27 13:15:49,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:15:49,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:49,910 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:15:49,916 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:15:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:15:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:15:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:15:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:15:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:15:49,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:15:49,941 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:15:49,941 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:15:49,941 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:15:49,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:15:49,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:15:49,941 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:15:49,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:15:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:15:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:15:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:15:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:15:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:15:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:15:49,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:15:49,992 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:15:49,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:15:50,131 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:15:50,137 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:15:50,137 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 13:15:50,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:15:50 BoogieIcfgContainer [2022-04-27 13:15:50,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:15:50,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:15:50,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:15:50,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:15:50,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:15:49" (1/3) ... [2022-04-27 13:15:50,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6203596c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:15:50, skipping insertion in model container [2022-04-27 13:15:50,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:15:49" (2/3) ... [2022-04-27 13:15:50,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6203596c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:15:50, skipping insertion in model container [2022-04-27 13:15:50,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:15:50" (3/3) ... [2022-04-27 13:15:50,146 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound100.c [2022-04-27 13:15:50,161 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:15:50,161 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:15:50,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:15:50,202 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@761e571b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@723b953f [2022-04-27 13:15:50,202 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:15:50,209 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:15:50,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:15:50,215 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:50,215 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:15:50,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-27 13:15:50,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:50,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353370142] [2022-04-27 13:15:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:50,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:50,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:50,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [43815918] [2022-04-27 13:15:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:50,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:50,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:50,331 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:15:50,343 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:15:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:50,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:15:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:50,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:50,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-27 13:15:50,494 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:15:50,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:15:50,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-27 13:15:50,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-27 13:15:50,494 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:15:50,495 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:15:50,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:15:50,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:15:50,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:15:50,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-27 13:15:50,496 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:15:50,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:15:50,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:15:50,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:15:50,497 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-27 13:15:50,497 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:15:50,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:15:50,498 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:15:50,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:15:50,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:15:50,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:15:50,500 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:15:50,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:15:50,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:50,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353370142] [2022-04-27 13:15:50,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43815918] [2022-04-27 13:15:50,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43815918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:15:50,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:15:50,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:15:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28456877] [2022-04-27 13:15:50,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:50,511 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:15:50,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:50,515 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:15:50,547 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:15:50,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:15:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:50,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:15:50,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:15:50,578 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:15:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:50,665 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-27 13:15:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:15:50,666 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:15:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:50,667 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:15:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:15:50,679 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:15:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-27 13:15:50,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-27 13:15:50,795 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:15:50,804 INFO L225 Difference]: With dead ends: 67 [2022-04-27 13:15:50,804 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 13:15:50,807 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:15:50,811 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:15:50,813 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:15:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 13:15:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 13:15:50,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:50,837 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:15:50,838 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:15:50,838 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:15:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:50,842 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:15:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:15:50,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:50,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:50,844 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:15:50,844 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:15:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:50,847 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 13:15:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:15:50,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:50,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:50,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:50,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:50,849 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:15:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 13:15:50,852 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-27 13:15:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:50,852 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 13:15:50,852 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:15:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 13:15:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:15:50,853 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:50,854 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:15:50,879 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:15:51,067 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:15:51,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-27 13:15:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:51,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121876144] [2022-04-27 13:15:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:51,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:51,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884861402] [2022-04-27 13:15:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:51,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:51,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:51,106 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:15:51,107 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:15:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:51,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:15:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:51,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:15:51,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-27 13:15:51,415 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:15:51,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,418 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:15:51,419 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:15:51,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,421 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:15:51,421 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:15:51,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-27 13:15:51,423 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:15:51,424 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:15:51,424 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:15:51,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {308#false} is VALID [2022-04-27 13:15:51,425 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:15:51,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-27 13:15:51,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-27 13:15:51,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-27 13:15:51,425 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:15:51,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:15:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:15:51,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121876144] [2022-04-27 13:15:51,427 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:15:51,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884861402] [2022-04-27 13:15:51,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884861402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:15:51,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:15:51,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:15:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908877426] [2022-04-27 13:15:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:15:51,430 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:15:51,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:15:51,431 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:15:51,448 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:15:51,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:15:51,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:15:51,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:15:51,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:15:51,450 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:15:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:51,537 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-27 13:15:51,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:15:51,537 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:15:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:15:51,538 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:15:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:15:51,545 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:15:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-27 13:15:51,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-27 13:15:51,590 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:15:51,592 INFO L225 Difference]: With dead ends: 41 [2022-04-27 13:15:51,592 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 13:15:51,592 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:15:51,593 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:15:51,594 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:15:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 13:15:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 13:15:51,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:15:51,602 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:15:51,602 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:15:51,602 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:15:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:51,605 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:15:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:15:51,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:51,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:51,606 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:15:51,606 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:15:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:15:51,608 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 13:15:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:15:51,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:15:51,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:15:51,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:15:51,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:15:51,609 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:15:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-27 13:15:51,611 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-27 13:15:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:15:51,611 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-27 13:15:51,611 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:15:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 13:15:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:15:51,612 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:15:51,612 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:15:51,637 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:15:51,827 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:15:51,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:15:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:15:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-27 13:15:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:15:51,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636875462] [2022-04-27 13:15:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:15:51,843 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:15:51,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1748326362] [2022-04-27 13:15:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:15:51,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:15:51,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:15:51,845 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:15:51,847 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:15:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:15:51,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:16:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-27 13:16:00,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:01,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-27 13:16:01,106 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:01,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:01,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-27 13:16:01,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-27 13:16:01,107 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:01,107 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:01,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:01,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:01,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:01,107 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-27 13:16:01,107 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:01,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-27 13:16:01,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-27 13:16:01,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-27 13:16:01,108 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-27 13:16:02,972 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:02,973 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:02,973 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 < 100);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:03,269 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:03,269 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:03,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-27 13:16:03,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-27 13:16:03,270 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:03,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:03,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636875462] [2022-04-27 13:16:03,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:03,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748326362] [2022-04-27 13:16:03,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748326362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:03,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:03,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:16:03,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905719904] [2022-04-27 13:16:03,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:03,272 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:03,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:03,272 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:05,690 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:05,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:16:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:16:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:05,691 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:15,734 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:16:18,525 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:16:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:18,614 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 13:16:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:16:18,615 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:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:16:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:16:18,618 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:16:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-27 13:16:18,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-27 13:16:22,085 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:16:22,087 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:16:22,087 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 13:16:22,091 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:16:22,092 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:22,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-04-27 13:16:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 13:16:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 13:16:22,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:22,115 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:16:22,115 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:16:22,116 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:16:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:22,119 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:16:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:16:22,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:22,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:22,120 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:16:22,120 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:16:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:22,123 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-27 13:16:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-27 13:16:22,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:22,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:22,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:22,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:22,124 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:16:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-27 13:16:22,127 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-27 13:16:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:22,132 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-27 13:16:22,133 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:16:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-27 13:16:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:16:22,136 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:22,136 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:16:22,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 13:16:22,347 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:16:22,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-27 13:16:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:22,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108131114] [2022-04-27 13:16:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:22,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:22,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664856392] [2022-04-27 13:16:22,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:22,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:22,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:22,382 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:16:22,387 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:16:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:22,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:16:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:22,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:22,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:16:22,649 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:16:22,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:22,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:16:22,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:16:22,650 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:16:22,650 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:16:22,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:16:22,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:16:22,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:22,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:16:22,651 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:16:22,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:16:22,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:16:22,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:22,651 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:16:22,651 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:16:22,651 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:16:22,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 100);havoc #t~post6; {877#true} is VALID [2022-04-27 13:16:22,651 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:16:22,653 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:16:22,654 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:16:22,654 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:16:22,655 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:16:22,656 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:16:22,656 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:16:22,657 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:16:22,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:16:22,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:16:22,657 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:16:22,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:23,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-27 13:16:23,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-27 13:16:23,137 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:16:23,138 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:16:23,138 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:16:23,139 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:16:23,141 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:16:23,142 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:16:23,147 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:16:23,147 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:16:23,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 100);havoc #t~post6; {877#true} is VALID [2022-04-27 13:16:23,148 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:16:23,148 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:16:23,148 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-27 13:16:23,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:23,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:16:23,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:16:23,150 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:16:23,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-27 13:16:23,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:23,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-27 13:16:23,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-27 13:16:23,153 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:16:23,153 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:16:23,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-27 13:16:23,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-27 13:16:23,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-27 13:16:23,154 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:16:23,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-27 13:16:23,154 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:16:23,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:23,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108131114] [2022-04-27 13:16:23,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:23,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664856392] [2022-04-27 13:16:23,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664856392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:23,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:23,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:16:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331180111] [2022-04-27 13:16:23,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:23,156 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:16:23,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:23,156 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:16:23,191 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:16:23,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:16:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:16:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:16:23,192 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:16:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:23,655 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-27 13:16:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:16:23,655 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:16:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:23,656 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:16:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:16:23,657 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:16:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 13:16:23,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 13:16:23,711 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:16:23,713 INFO L225 Difference]: With dead ends: 57 [2022-04-27 13:16:23,713 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 13:16:23,714 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:16:23,714 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:23,715 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.2s Time] [2022-04-27 13:16:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 13:16:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-27 13:16:23,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:23,729 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:16:23,730 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:16:23,730 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:16:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:23,734 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:16:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:16:23,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:23,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:23,735 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:16:23,735 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:16:23,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:23,738 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:16:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-27 13:16:23,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:23,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:23,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:23,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:23,739 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:16:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-27 13:16:23,740 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-27 13:16:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:23,740 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-27 13:16:23,740 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:16:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 13:16:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 13:16:23,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:23,741 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:16:23,772 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:16:23,965 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:16:23,965 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:23,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-27 13:16:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:23,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065300751] [2022-04-27 13:16:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:23,979 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:23,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778871059] [2022-04-27 13:16:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:23,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:23,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:23,980 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:16:24,023 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:16:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:24,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:16:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:24,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:24,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {1302#true} call ULTIMATE.init(); {1302#true} is VALID [2022-04-27 13:16:24,216 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:16:24,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:24,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1310#(<= ~counter~0 0)} {1302#true} #102#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:24,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {1310#(<= ~counter~0 0)} call #t~ret9 := main(); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:24,218 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:16:24,218 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:16:24,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:24,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:24,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:24,220 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:16:24,220 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:16:24,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:24,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:24,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:24,221 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:16:24,222 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:16:24,222 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:16:24,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {1359#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:24,223 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:16:24,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {1359#(<= ~counter~0 1)} ~cond := #in~cond; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:24,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {1359#(<= ~counter~0 1)} assume !(0 == ~cond); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:24,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {1359#(<= ~counter~0 1)} assume true; {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:24,225 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:16:24,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {1359#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1359#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:24,225 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:16:24,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {1384#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1303#false} is VALID [2022-04-27 13:16:24,226 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:16:24,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {1303#false} assume !(#t~post8 < 100);havoc #t~post8; {1303#false} is VALID [2022-04-27 13:16:24,226 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:16:24,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {1303#false} assume !(#t~post6 < 100);havoc #t~post6; {1303#false} is VALID [2022-04-27 13:16:24,226 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:16:24,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {1303#false} ~cond := #in~cond; {1303#false} is VALID [2022-04-27 13:16:24,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {1303#false} assume 0 == ~cond; {1303#false} is VALID [2022-04-27 13:16:24,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {1303#false} assume !false; {1303#false} is VALID [2022-04-27 13:16:24,227 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:16:24,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:24,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:24,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065300751] [2022-04-27 13:16:24,227 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:24,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778871059] [2022-04-27 13:16:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778871059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:24,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:24,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:16:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383867718] [2022-04-27 13:16:24,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:24,229 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:16:24,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:24,229 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:16:24,255 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:16:24,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:16:24,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:16:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:24,256 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:16:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:24,378 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-27 13:16:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:16:24,378 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:16:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:24,378 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:16:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:16:24,380 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:16:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 13:16:24,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-27 13:16:24,442 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:16:24,443 INFO L225 Difference]: With dead ends: 65 [2022-04-27 13:16:24,443 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 13:16:24,444 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:16:24,445 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:16:24,445 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:16:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 13:16:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 13:16:24,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:24,470 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:16:24,470 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:16:24,470 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:16:24,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:24,472 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 13:16:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:16:24,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:24,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:24,473 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:16:24,473 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:16:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:24,475 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 13:16:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:16:24,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:24,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:24,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:24,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:24,478 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:16:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-27 13:16:24,480 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-27 13:16:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:24,480 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-27 13:16:24,480 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:16:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 13:16:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 13:16:24,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:24,481 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:16:24,506 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:16:24,703 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:16:24,704 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-27 13:16:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:24,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002046335] [2022-04-27 13:16:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:24,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:24,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818429501] [2022-04-27 13:16:24,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:24,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:24,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:24,723 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:16:24,725 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:16:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:24,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:16:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:24,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:25,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-27 13:16:25,007 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:16:25,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:25,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1662#(<= ~counter~0 0)} {1654#true} #102#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:25,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {1662#(<= ~counter~0 0)} call #t~ret9 := main(); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:25,009 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:16:25,010 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:16:25,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:25,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:25,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:25,011 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:16:25,012 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:16:25,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:25,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:25,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:25,013 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:16:25,014 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:16:25,014 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:16:25,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {1711#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:25,015 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:16:25,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {1711#(<= ~counter~0 1)} ~cond := #in~cond; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:25,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {1711#(<= ~counter~0 1)} assume !(0 == ~cond); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:25,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {1711#(<= ~counter~0 1)} assume true; {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:25,017 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:16:25,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {1711#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1711#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:25,020 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:16:25,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {1736#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:25,021 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:16:25,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {1736#(<= ~counter~0 2)} ~cond := #in~cond; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:25,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {1736#(<= ~counter~0 2)} assume !(0 == ~cond); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:25,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {1736#(<= ~counter~0 2)} assume true; {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:25,023 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:16:25,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {1736#(<= ~counter~0 2)} assume !(~r~0 > 0); {1736#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:25,024 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:16:25,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(<= |main_#t~post8| 2)} assume !(#t~post8 < 100);havoc #t~post8; {1655#false} is VALID [2022-04-27 13:16:25,024 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:16:25,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 100);havoc #t~post6; {1655#false} is VALID [2022-04-27 13:16:25,024 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:16:25,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-27 13:16:25,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-27 13:16:25,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-27 13:16:25,025 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:16:25,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:25,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-27 13:16:25,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-27 13:16:25,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-27 13:16:25,262 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:16:25,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 100);havoc #t~post6; {1655#false} is VALID [2022-04-27 13:16:25,262 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:16:25,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {1801#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {1655#false} is VALID [2022-04-27 13:16:25,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {1805#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1801#(< |main_#t~post8| 100)} is VALID [2022-04-27 13:16:25,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {1805#(< ~counter~0 100)} assume !(~r~0 > 0); {1805#(< ~counter~0 100)} is VALID [2022-04-27 13:16:25,269 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1805#(< ~counter~0 100)} #96#return; {1805#(< ~counter~0 100)} is VALID [2022-04-27 13:16:25,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:16:25,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:16:25,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:16:25,269 INFO L272 TraceCheckUtils]: 27: Hoare triple {1805#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1654#true} is VALID [2022-04-27 13:16:25,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {1805#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {1805#(< ~counter~0 100)} is VALID [2022-04-27 13:16:25,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {1830#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1805#(< ~counter~0 100)} is VALID [2022-04-27 13:16:25,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#(< ~counter~0 99)} assume !!(0 != ~r~0); {1830#(< ~counter~0 99)} is VALID [2022-04-27 13:16:25,272 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1654#true} {1830#(< ~counter~0 99)} #94#return; {1830#(< ~counter~0 99)} is VALID [2022-04-27 13:16:25,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:16:25,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:16:25,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:16:25,272 INFO L272 TraceCheckUtils]: 19: Hoare triple {1830#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1654#true} is VALID [2022-04-27 13:16:25,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {1830#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {1830#(< ~counter~0 99)} is VALID [2022-04-27 13:16:25,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {1855#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1830#(< ~counter~0 99)} is VALID [2022-04-27 13:16:25,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {1855#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1855#(< ~counter~0 98)} is VALID [2022-04-27 13:16:25,274 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1654#true} {1855#(< ~counter~0 98)} #92#return; {1855#(< ~counter~0 98)} is VALID [2022-04-27 13:16:25,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:16:25,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:16:25,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:16:25,275 INFO L272 TraceCheckUtils]: 11: Hoare triple {1855#(< ~counter~0 98)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1654#true} is VALID [2022-04-27 13:16:25,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1654#true} {1855#(< ~counter~0 98)} #90#return; {1855#(< ~counter~0 98)} is VALID [2022-04-27 13:16:25,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-27 13:16:25,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-27 13:16:25,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-27 13:16:25,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {1855#(< ~counter~0 98)} 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:16:25,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1855#(< ~counter~0 98)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1855#(< ~counter~0 98)} is VALID [2022-04-27 13:16:25,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#(< ~counter~0 98)} call #t~ret9 := main(); {1855#(< ~counter~0 98)} is VALID [2022-04-27 13:16:25,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#(< ~counter~0 98)} {1654#true} #102#return; {1855#(< ~counter~0 98)} is VALID [2022-04-27 13:16:25,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#(< ~counter~0 98)} assume true; {1855#(< ~counter~0 98)} is VALID [2022-04-27 13:16:25,278 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 98)} is VALID [2022-04-27 13:16:25,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-27 13:16:25,285 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:16:25,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:25,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002046335] [2022-04-27 13:16:25,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:25,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818429501] [2022-04-27 13:16:25,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818429501] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:16:25,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:16:25,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-27 13:16:25,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457040330] [2022-04-27 13:16:25,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:25,286 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:16:25,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:25,288 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:16:25,322 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:16:25,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:16:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:25,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:16:25,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:16:25,325 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:16:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:25,478 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-27 13:16:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:16:25,478 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:16:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:25,479 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:16:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:16:25,481 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:16:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-27 13:16:25,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-27 13:16:25,550 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:16:25,551 INFO L225 Difference]: With dead ends: 74 [2022-04-27 13:16:25,551 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 13:16:25,551 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:16:25,552 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:16:25,552 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:16:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 13:16:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-27 13:16:25,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:25,571 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:16:25,571 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:16:25,571 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:16:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:25,573 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 13:16:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 13:16:25,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:25,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:25,574 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:16:25,574 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:16:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:25,576 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-27 13:16:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-27 13:16:25,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:25,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:25,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:25,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:25,577 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:16:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-27 13:16:25,578 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-27 13:16:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:25,579 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-27 13:16:25,579 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:16:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-27 13:16:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 13:16:25,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:25,580 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:16:25,606 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:16:25,803 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:16:25,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:25,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-27 13:16:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:25,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179586755] [2022-04-27 13:16:25,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:25,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:25,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:25,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740326386] [2022-04-27 13:16:25,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:25,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:25,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:25,817 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:16:25,819 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:16:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:25,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:16:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:25,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:26,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2022-04-27 13:16:26,132 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:16:26,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:26,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2200#(<= ~counter~0 0)} {2192#true} #102#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:26,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {2200#(<= ~counter~0 0)} call #t~ret9 := main(); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:26,134 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:16:26,134 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:16:26,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {2200#(<= ~counter~0 0)} ~cond := #in~cond; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:26,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {2200#(<= ~counter~0 0)} assume !(0 == ~cond); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:26,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:26,136 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:16:26,136 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:16:26,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {2200#(<= ~counter~0 0)} ~cond := #in~cond; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:26,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {2200#(<= ~counter~0 0)} assume !(0 == ~cond); {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:26,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:26,138 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:16:26,138 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:16:26,139 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:16:26,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {2249#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:26,140 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:16:26,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {2249#(<= ~counter~0 1)} ~cond := #in~cond; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:26,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {2249#(<= ~counter~0 1)} assume !(0 == ~cond); {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:26,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {2249#(<= ~counter~0 1)} assume true; {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:26,141 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:16:26,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {2249#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2249#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:26,142 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:16:26,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {2274#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:26,143 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:16:26,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {2274#(<= ~counter~0 2)} ~cond := #in~cond; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:26,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {2274#(<= ~counter~0 2)} assume !(0 == ~cond); {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:26,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {2274#(<= ~counter~0 2)} assume true; {2274#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:26,144 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:16:26,145 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:16:26,145 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:16:26,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {2299#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {2193#false} is VALID [2022-04-27 13:16:26,145 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:16:26,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#false} assume !(#t~post8 < 100);havoc #t~post8; {2193#false} is VALID [2022-04-27 13:16:26,146 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:16:26,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#false} assume !(#t~post6 < 100);havoc #t~post6; {2193#false} is VALID [2022-04-27 13:16:26,146 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:16:26,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#false} ~cond := #in~cond; {2193#false} is VALID [2022-04-27 13:16:26,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#false} assume 0 == ~cond; {2193#false} is VALID [2022-04-27 13:16:26,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2022-04-27 13:16:26,146 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:16:26,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:26,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2022-04-27 13:16:26,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#false} assume 0 == ~cond; {2193#false} is VALID [2022-04-27 13:16:26,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#false} ~cond := #in~cond; {2193#false} is VALID [2022-04-27 13:16:26,399 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:16:26,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#false} assume !(#t~post6 < 100);havoc #t~post6; {2193#false} is VALID [2022-04-27 13:16:26,399 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:16:26,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#false} assume !(#t~post8 < 100);havoc #t~post8; {2193#false} is VALID [2022-04-27 13:16:26,399 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:16:26,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {2351#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {2193#false} is VALID [2022-04-27 13:16:26,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {2355#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2351#(< |main_#t~post7| 100)} is VALID [2022-04-27 13:16:26,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {2355#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2355#(< ~counter~0 100)} is VALID [2022-04-27 13:16:26,401 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2192#true} {2355#(< ~counter~0 100)} #96#return; {2355#(< ~counter~0 100)} is VALID [2022-04-27 13:16:26,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:16:26,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:16:26,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:16:26,402 INFO L272 TraceCheckUtils]: 27: Hoare triple {2355#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2192#true} is VALID [2022-04-27 13:16:26,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {2355#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {2355#(< ~counter~0 100)} is VALID [2022-04-27 13:16:26,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2355#(< ~counter~0 100)} is VALID [2022-04-27 13:16:26,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {2380#(< ~counter~0 99)} assume !!(0 != ~r~0); {2380#(< ~counter~0 99)} is VALID [2022-04-27 13:16:26,404 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2192#true} {2380#(< ~counter~0 99)} #94#return; {2380#(< ~counter~0 99)} is VALID [2022-04-27 13:16:26,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:16:26,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:16:26,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:16:26,404 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2192#true} is VALID [2022-04-27 13:16:26,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {2380#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2380#(< ~counter~0 99)} is VALID [2022-04-27 13:16:26,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {2405#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2380#(< ~counter~0 99)} is VALID [2022-04-27 13:16:26,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {2405#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2405#(< ~counter~0 98)} is VALID [2022-04-27 13:16:26,406 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2192#true} {2405#(< ~counter~0 98)} #92#return; {2405#(< ~counter~0 98)} is VALID [2022-04-27 13:16:26,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:16:26,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:16:26,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:16:26,407 INFO L272 TraceCheckUtils]: 11: Hoare triple {2405#(< ~counter~0 98)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2192#true} is VALID [2022-04-27 13:16:26,408 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2192#true} {2405#(< ~counter~0 98)} #90#return; {2405#(< ~counter~0 98)} is VALID [2022-04-27 13:16:26,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-27 13:16:26,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-27 13:16:26,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-27 13:16:26,408 INFO L272 TraceCheckUtils]: 6: Hoare triple {2405#(< ~counter~0 98)} 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:16:26,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {2405#(< ~counter~0 98)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2405#(< ~counter~0 98)} is VALID [2022-04-27 13:16:26,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#(< ~counter~0 98)} call #t~ret9 := main(); {2405#(< ~counter~0 98)} is VALID [2022-04-27 13:16:26,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#(< ~counter~0 98)} {2192#true} #102#return; {2405#(< ~counter~0 98)} is VALID [2022-04-27 13:16:26,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#(< ~counter~0 98)} assume true; {2405#(< ~counter~0 98)} is VALID [2022-04-27 13:16:26,410 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 98)} is VALID [2022-04-27 13:16:26,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2022-04-27 13:16:26,411 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:16:26,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:26,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179586755] [2022-04-27 13:16:26,411 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:26,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740326386] [2022-04-27 13:16:26,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740326386] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:26,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:26,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:16:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602843427] [2022-04-27 13:16:26,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:26,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:16:26,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:26,415 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:16:26,478 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:16:26,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:16:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:26,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:16:26,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:16:26,479 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:16:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:26,920 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-04-27 13:16:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:16:26,921 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:16:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:26,921 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:16:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-27 13:16:26,924 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:16:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-27 13:16:26,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2022-04-27 13:16:27,045 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:16:27,047 INFO L225 Difference]: With dead ends: 129 [2022-04-27 13:16:27,047 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 13:16:27,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:16:27,051 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:16:27,052 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:16:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 13:16:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2022-04-27 13:16:27,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:27,110 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:16:27,110 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:16:27,111 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:16:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:27,114 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-27 13:16:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-04-27 13:16:27,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:27,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:27,115 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:16:27,116 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:16:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:27,119 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-27 13:16:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-04-27 13:16:27,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:27,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:27,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:27,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:27,120 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:16:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2022-04-27 13:16:27,124 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 43 [2022-04-27 13:16:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:27,124 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2022-04-27 13:16:27,124 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:16:27,124 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-27 13:16:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 13:16:27,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:27,125 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:16:27,150 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:16:27,339 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:16:27,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:27,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-27 13:16:27,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:27,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982901895] [2022-04-27 13:16:27,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:27,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:27,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:27,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574577510] [2022-04-27 13:16:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:27,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:27,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:27,354 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:16:27,355 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:16:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:27,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 13:16:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:27,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:27,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {2996#true} call ULTIMATE.init(); {2996#true} is VALID [2022-04-27 13:16:27,552 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:16:27,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:16:27,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2996#true} {2996#true} #102#return; {2996#true} is VALID [2022-04-27 13:16:27,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {2996#true} call #t~ret9 := main(); {2996#true} is VALID [2022-04-27 13:16:27,552 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:16:27,552 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:16:27,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:16:27,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:16:27,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:16:27,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2996#true} {2996#true} #90#return; {2996#true} is VALID [2022-04-27 13:16:27,553 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:16:27,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:16:27,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:16:27,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:16:27,553 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2996#true} {2996#true} #92#return; {2996#true} is VALID [2022-04-27 13:16:27,553 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:16:27,553 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:16:27,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {2996#true} assume !!(#t~post6 < 100);havoc #t~post6; {2996#true} is VALID [2022-04-27 13:16:27,554 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:16:27,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:16:27,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:16:27,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:16:27,554 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2996#true} {2996#true} #94#return; {2996#true} is VALID [2022-04-27 13:16:27,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {2996#true} assume !!(0 != ~r~0); {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:16:27,560 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:16:27,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {3073#(not (= main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {3073#(not (= main_~r~0 0))} is VALID [2022-04-27 13:16:27,560 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:16:27,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:16:27,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:16:27,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:16:27,561 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:16:27,562 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:16:27,562 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:16:27,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {3098#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-27 13:16:27,563 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:16:27,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-27 13:16:27,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-27 13:16:27,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-27 13:16:27,567 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:16:27,568 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:16:27,568 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:16:27,568 INFO L290 TraceCheckUtils]: 42: Hoare triple {2997#false} assume !(#t~post6 < 100);havoc #t~post6; {2997#false} is VALID [2022-04-27 13:16:27,568 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:16:27,568 INFO L290 TraceCheckUtils]: 44: Hoare triple {2997#false} ~cond := #in~cond; {2997#false} is VALID [2022-04-27 13:16:27,569 INFO L290 TraceCheckUtils]: 45: Hoare triple {2997#false} assume 0 == ~cond; {2997#false} is VALID [2022-04-27 13:16:27,569 INFO L290 TraceCheckUtils]: 46: Hoare triple {2997#false} assume !false; {2997#false} is VALID [2022-04-27 13:16:27,569 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:16:27,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:27,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:27,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982901895] [2022-04-27 13:16:27,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:27,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574577510] [2022-04-27 13:16:27,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574577510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:27,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:27,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:16:27,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812328783] [2022-04-27 13:16:27,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:27,571 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:16:27,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:27,575 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:16:27,601 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:16:27,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:16:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:27,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:16:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:27,612 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:16:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:27,762 INFO L93 Difference]: Finished difference Result 158 states and 202 transitions. [2022-04-27 13:16:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:16:27,762 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:16:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:27,762 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:16:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:16:27,764 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:16:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 13:16:27,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-27 13:16:27,847 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:16:27,849 INFO L225 Difference]: With dead ends: 158 [2022-04-27 13:16:27,849 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 13:16:27,850 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:16:27,850 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:16:27,851 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:16:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 13:16:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2022-04-27 13:16:27,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:27,901 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:16:27,902 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:16:27,902 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:16:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:27,906 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2022-04-27 13:16:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-27 13:16:27,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:27,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:27,907 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:16:27,908 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:16:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:27,912 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2022-04-27 13:16:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-27 13:16:27,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:27,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:27,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:27,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:27,913 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:16:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2022-04-27 13:16:27,917 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 47 [2022-04-27 13:16:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:27,917 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2022-04-27 13:16:27,917 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:16:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-27 13:16:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 13:16:27,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:27,918 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:16:27,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 13:16:28,142 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:16:28,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-27 13:16:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:28,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636418440] [2022-04-27 13:16:28,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:28,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:28,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:28,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856793641] [2022-04-27 13:16:28,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:28,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:28,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:28,154 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:16:28,179 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:16:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:28,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 13:16:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:28,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:28,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {3753#true} call ULTIMATE.init(); {3753#true} is VALID [2022-04-27 13:16:28,514 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:16:28,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:28,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3761#(<= ~counter~0 0)} {3753#true} #102#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:28,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {3761#(<= ~counter~0 0)} call #t~ret9 := main(); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:28,517 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:16:28,518 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:16:28,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {3761#(<= ~counter~0 0)} ~cond := #in~cond; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:28,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {3761#(<= ~counter~0 0)} assume !(0 == ~cond); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:28,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:28,521 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:16:28,521 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:16:28,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {3761#(<= ~counter~0 0)} ~cond := #in~cond; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:28,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {3761#(<= ~counter~0 0)} assume !(0 == ~cond); {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:28,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:28,522 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:16:28,522 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:16:28,523 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:16:28,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {3810#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:28,524 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:16:28,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {3810#(<= ~counter~0 1)} ~cond := #in~cond; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:28,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {3810#(<= ~counter~0 1)} assume !(0 == ~cond); {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:28,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {3810#(<= ~counter~0 1)} assume true; {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:28,525 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:16:28,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {3810#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3810#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:28,526 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:16:28,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {3835#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:28,527 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:16:28,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {3835#(<= ~counter~0 2)} ~cond := #in~cond; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:28,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {3835#(<= ~counter~0 2)} assume !(0 == ~cond); {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:28,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {3835#(<= ~counter~0 2)} assume true; {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:28,528 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:16:28,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {3835#(<= ~counter~0 2)} assume !(~r~0 > 0); {3835#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:28,528 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:16:28,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {3860#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:28,529 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:16:28,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {3860#(<= ~counter~0 3)} ~cond := #in~cond; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:28,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#(<= ~counter~0 3)} assume !(0 == ~cond); {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:28,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#(<= ~counter~0 3)} assume true; {3860#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:28,531 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:16:28,531 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:16:28,531 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:16:28,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {3885#(<= |main_#t~post8| 3)} assume !(#t~post8 < 100);havoc #t~post8; {3754#false} is VALID [2022-04-27 13:16:28,532 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:16:28,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#false} assume !(#t~post6 < 100);havoc #t~post6; {3754#false} is VALID [2022-04-27 13:16:28,532 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:16:28,532 INFO L290 TraceCheckUtils]: 46: Hoare triple {3754#false} ~cond := #in~cond; {3754#false} is VALID [2022-04-27 13:16:28,532 INFO L290 TraceCheckUtils]: 47: Hoare triple {3754#false} assume 0 == ~cond; {3754#false} is VALID [2022-04-27 13:16:28,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {3754#false} assume !false; {3754#false} is VALID [2022-04-27 13:16:28,533 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:16:28,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:28,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {3754#false} assume !false; {3754#false} is VALID [2022-04-27 13:16:28,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {3754#false} assume 0 == ~cond; {3754#false} is VALID [2022-04-27 13:16:28,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {3754#false} ~cond := #in~cond; {3754#false} is VALID [2022-04-27 13:16:28,787 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:16:28,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#false} assume !(#t~post6 < 100);havoc #t~post6; {3754#false} is VALID [2022-04-27 13:16:28,787 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:16:28,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {3925#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {3754#false} is VALID [2022-04-27 13:16:28,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {3929#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3925#(< |main_#t~post8| 100)} is VALID [2022-04-27 13:16:28,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {3929#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {3929#(< ~counter~0 100)} is VALID [2022-04-27 13:16:28,788 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3753#true} {3929#(< ~counter~0 100)} #98#return; {3929#(< ~counter~0 100)} is VALID [2022-04-27 13:16:28,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:16:28,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:16:28,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:16:28,789 INFO L272 TraceCheckUtils]: 35: Hoare triple {3929#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:16:28,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {3929#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {3929#(< ~counter~0 100)} is VALID [2022-04-27 13:16:28,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {3954#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3929#(< ~counter~0 100)} is VALID [2022-04-27 13:16:28,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {3954#(< ~counter~0 99)} assume !(~r~0 > 0); {3954#(< ~counter~0 99)} is VALID [2022-04-27 13:16:28,790 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3753#true} {3954#(< ~counter~0 99)} #96#return; {3954#(< ~counter~0 99)} is VALID [2022-04-27 13:16:28,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:16:28,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:16:28,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:16:28,790 INFO L272 TraceCheckUtils]: 27: Hoare triple {3954#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:16:28,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {3954#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {3954#(< ~counter~0 99)} is VALID [2022-04-27 13:16:28,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {3979#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3954#(< ~counter~0 99)} is VALID [2022-04-27 13:16:28,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {3979#(< ~counter~0 98)} assume !!(0 != ~r~0); {3979#(< ~counter~0 98)} is VALID [2022-04-27 13:16:28,792 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3753#true} {3979#(< ~counter~0 98)} #94#return; {3979#(< ~counter~0 98)} is VALID [2022-04-27 13:16:28,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:16:28,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:16:28,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:16:28,792 INFO L272 TraceCheckUtils]: 19: Hoare triple {3979#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3753#true} is VALID [2022-04-27 13:16:28,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {3979#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {3979#(< ~counter~0 98)} is VALID [2022-04-27 13:16:28,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {4004#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3979#(< ~counter~0 98)} is VALID [2022-04-27 13:16:28,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {4004#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4004#(< ~counter~0 97)} is VALID [2022-04-27 13:16:28,793 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3753#true} {4004#(< ~counter~0 97)} #92#return; {4004#(< ~counter~0 97)} is VALID [2022-04-27 13:16:28,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:16:28,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:16:28,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:16:28,794 INFO L272 TraceCheckUtils]: 11: Hoare triple {4004#(< ~counter~0 97)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3753#true} is VALID [2022-04-27 13:16:28,794 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3753#true} {4004#(< ~counter~0 97)} #90#return; {4004#(< ~counter~0 97)} is VALID [2022-04-27 13:16:28,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-27 13:16:28,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-27 13:16:28,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-27 13:16:28,795 INFO L272 TraceCheckUtils]: 6: Hoare triple {4004#(< ~counter~0 97)} 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:16:28,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {4004#(< ~counter~0 97)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4004#(< ~counter~0 97)} is VALID [2022-04-27 13:16:28,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {4004#(< ~counter~0 97)} call #t~ret9 := main(); {4004#(< ~counter~0 97)} is VALID [2022-04-27 13:16:28,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4004#(< ~counter~0 97)} {3753#true} #102#return; {4004#(< ~counter~0 97)} is VALID [2022-04-27 13:16:28,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {4004#(< ~counter~0 97)} assume true; {4004#(< ~counter~0 97)} is VALID [2022-04-27 13:16:28,796 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 97)} is VALID [2022-04-27 13:16:28,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {3753#true} call ULTIMATE.init(); {3753#true} is VALID [2022-04-27 13:16:28,796 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:16:28,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:28,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636418440] [2022-04-27 13:16:28,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:28,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856793641] [2022-04-27 13:16:28,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856793641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:28,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:28,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-27 13:16:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166809953] [2022-04-27 13:16:28,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:28,798 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:16:28,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:28,799 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:16:28,869 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:16:28,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 13:16:28,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:28,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 13:16:28,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:16:28,870 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:16:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:29,493 INFO L93 Difference]: Finished difference Result 219 states and 283 transitions. [2022-04-27 13:16:29,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 13:16:29,494 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:16:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:29,494 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:16:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-27 13:16:29,497 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:16:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-27 13:16:29,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 194 transitions. [2022-04-27 13:16:29,636 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:16:29,640 INFO L225 Difference]: With dead ends: 219 [2022-04-27 13:16:29,640 INFO L226 Difference]: Without dead ends: 172 [2022-04-27 13:16:29,641 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:16:29,641 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 180 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:29,641 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.2s Time] [2022-04-27 13:16:29,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-27 13:16:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 153. [2022-04-27 13:16:29,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:29,700 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:16:29,701 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:16:29,701 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:16:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:29,707 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-27 13:16:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-27 13:16:29,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:29,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:29,708 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:16:29,708 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:16:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:29,713 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-27 13:16:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-27 13:16:29,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:29,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:29,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:29,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:29,715 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:16:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2022-04-27 13:16:29,719 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 49 [2022-04-27 13:16:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:29,719 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2022-04-27 13:16:29,719 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:16:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2022-04-27 13:16:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 13:16:29,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:29,720 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:16:29,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 13:16:29,942 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:16:29,942 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-27 13:16:29,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:29,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113670956] [2022-04-27 13:16:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:29,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:29,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:29,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2033296749] [2022-04-27 13:16:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:29,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:29,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:29,957 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:16:29,968 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:16:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:30,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:16:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:30,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:30,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {4930#true} call ULTIMATE.init(); {4930#true} is VALID [2022-04-27 13:16:30,314 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:16:30,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:30,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4938#(<= ~counter~0 0)} {4930#true} #102#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:30,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {4938#(<= ~counter~0 0)} call #t~ret9 := main(); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:30,316 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:16:30,316 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:16:30,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {4938#(<= ~counter~0 0)} ~cond := #in~cond; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:30,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {4938#(<= ~counter~0 0)} assume !(0 == ~cond); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:30,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:30,317 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:16:30,318 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:16:30,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {4938#(<= ~counter~0 0)} ~cond := #in~cond; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:30,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {4938#(<= ~counter~0 0)} assume !(0 == ~cond); {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:30,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:30,319 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:16:30,319 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:16:30,320 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:16:30,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {4987#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:30,321 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:16:30,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {4987#(<= ~counter~0 1)} ~cond := #in~cond; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:30,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {4987#(<= ~counter~0 1)} assume !(0 == ~cond); {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:30,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {4987#(<= ~counter~0 1)} assume true; {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:30,322 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:16:30,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {4987#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4987#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:30,323 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:16:30,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {5012#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:30,323 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:16:30,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {5012#(<= ~counter~0 2)} ~cond := #in~cond; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:30,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {5012#(<= ~counter~0 2)} assume !(0 == ~cond); {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:30,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {5012#(<= ~counter~0 2)} assume true; {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:30,327 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:16:30,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {5012#(<= ~counter~0 2)} assume !(~r~0 > 0); {5012#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:30,328 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:16:30,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {5037#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:30,329 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:16:30,329 INFO L290 TraceCheckUtils]: 36: Hoare triple {5037#(<= ~counter~0 3)} ~cond := #in~cond; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:30,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {5037#(<= ~counter~0 3)} assume !(0 == ~cond); {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:30,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {5037#(<= ~counter~0 3)} assume true; {5037#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:30,330 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:16:30,330 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:16:30,331 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:16:30,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {5062#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:30,331 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:16:30,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {5062#(<= ~counter~0 4)} ~cond := #in~cond; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:30,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {5062#(<= ~counter~0 4)} assume !(0 == ~cond); {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:30,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {5062#(<= ~counter~0 4)} assume true; {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:30,333 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:16:30,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {5062#(<= ~counter~0 4)} assume !(~r~0 < 0); {5062#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:30,333 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:16:30,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {5087#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {4931#false} is VALID [2022-04-27 13:16:30,334 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:16:30,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {4931#false} ~cond := #in~cond; {4931#false} is VALID [2022-04-27 13:16:30,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {4931#false} assume 0 == ~cond; {4931#false} is VALID [2022-04-27 13:16:30,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {4931#false} assume !false; {4931#false} is VALID [2022-04-27 13:16:30,334 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:16:30,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:30,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {4931#false} assume !false; {4931#false} is VALID [2022-04-27 13:16:30,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {4931#false} assume 0 == ~cond; {4931#false} is VALID [2022-04-27 13:16:30,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {4931#false} ~cond := #in~cond; {4931#false} is VALID [2022-04-27 13:16:30,643 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:16:30,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {5115#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {4931#false} is VALID [2022-04-27 13:16:30,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {5119#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5115#(< |main_#t~post6| 100)} is VALID [2022-04-27 13:16:30,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {5119#(< ~counter~0 100)} assume !(~r~0 < 0); {5119#(< ~counter~0 100)} is VALID [2022-04-27 13:16:30,645 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4930#true} {5119#(< ~counter~0 100)} #98#return; {5119#(< ~counter~0 100)} is VALID [2022-04-27 13:16:30,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:16:30,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:16:30,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:16:30,646 INFO L272 TraceCheckUtils]: 43: Hoare triple {5119#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:16:30,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {5119#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {5119#(< ~counter~0 100)} is VALID [2022-04-27 13:16:30,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {5144#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5119#(< ~counter~0 100)} is VALID [2022-04-27 13:16:30,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {5144#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {5144#(< ~counter~0 99)} is VALID [2022-04-27 13:16:30,648 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4930#true} {5144#(< ~counter~0 99)} #98#return; {5144#(< ~counter~0 99)} is VALID [2022-04-27 13:16:30,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:16:30,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:16:30,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:16:30,648 INFO L272 TraceCheckUtils]: 35: Hoare triple {5144#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:16:30,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {5144#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {5144#(< ~counter~0 99)} is VALID [2022-04-27 13:16:30,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {5169#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5144#(< ~counter~0 99)} is VALID [2022-04-27 13:16:30,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {5169#(< ~counter~0 98)} assume !(~r~0 > 0); {5169#(< ~counter~0 98)} is VALID [2022-04-27 13:16:30,650 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4930#true} {5169#(< ~counter~0 98)} #96#return; {5169#(< ~counter~0 98)} is VALID [2022-04-27 13:16:30,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:16:30,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:16:30,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:16:30,650 INFO L272 TraceCheckUtils]: 27: Hoare triple {5169#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:16:30,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {5169#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {5169#(< ~counter~0 98)} is VALID [2022-04-27 13:16:30,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {5194#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5169#(< ~counter~0 98)} is VALID [2022-04-27 13:16:30,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {5194#(< ~counter~0 97)} assume !!(0 != ~r~0); {5194#(< ~counter~0 97)} is VALID [2022-04-27 13:16:30,652 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4930#true} {5194#(< ~counter~0 97)} #94#return; {5194#(< ~counter~0 97)} is VALID [2022-04-27 13:16:30,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:16:30,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:16:30,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:16:30,653 INFO L272 TraceCheckUtils]: 19: Hoare triple {5194#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4930#true} is VALID [2022-04-27 13:16:30,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {5194#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {5194#(< ~counter~0 97)} is VALID [2022-04-27 13:16:30,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {5219#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5194#(< ~counter~0 97)} is VALID [2022-04-27 13:16:30,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {5219#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5219#(< ~counter~0 96)} is VALID [2022-04-27 13:16:30,654 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4930#true} {5219#(< ~counter~0 96)} #92#return; {5219#(< ~counter~0 96)} is VALID [2022-04-27 13:16:30,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:16:30,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:16:30,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:16:30,655 INFO L272 TraceCheckUtils]: 11: Hoare triple {5219#(< ~counter~0 96)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4930#true} is VALID [2022-04-27 13:16:30,655 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4930#true} {5219#(< ~counter~0 96)} #90#return; {5219#(< ~counter~0 96)} is VALID [2022-04-27 13:16:30,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-27 13:16:30,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-27 13:16:30,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-27 13:16:30,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {5219#(< ~counter~0 96)} 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:16:30,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#(< ~counter~0 96)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5219#(< ~counter~0 96)} is VALID [2022-04-27 13:16:30,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#(< ~counter~0 96)} call #t~ret9 := main(); {5219#(< ~counter~0 96)} is VALID [2022-04-27 13:16:30,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#(< ~counter~0 96)} {4930#true} #102#return; {5219#(< ~counter~0 96)} is VALID [2022-04-27 13:16:30,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#(< ~counter~0 96)} assume true; {5219#(< ~counter~0 96)} is VALID [2022-04-27 13:16:30,658 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 96)} is VALID [2022-04-27 13:16:30,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {4930#true} call ULTIMATE.init(); {4930#true} is VALID [2022-04-27 13:16:30,658 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:16:30,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:30,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113670956] [2022-04-27 13:16:30,658 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:30,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033296749] [2022-04-27 13:16:30,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033296749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:30,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:30,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:16:30,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197856717] [2022-04-27 13:16:30,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:30,660 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:16:30,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:30,660 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:16:30,739 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:16:30,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:16:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:30,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:16:30,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:16:30,740 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:16:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:31,563 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2022-04-27 13:16:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 13:16:31,563 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:16:31,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:31,564 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:16:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-27 13:16:31,567 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:16:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-27 13:16:31,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 204 transitions. [2022-04-27 13:16:31,712 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:16:31,716 INFO L225 Difference]: With dead ends: 211 [2022-04-27 13:16:31,716 INFO L226 Difference]: Without dead ends: 206 [2022-04-27 13:16:31,716 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:16:31,717 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:16:31,717 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:16:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-27 13:16:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2022-04-27 13:16:31,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:31,814 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:16:31,814 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:16:31,815 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:16:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:31,820 INFO L93 Difference]: Finished difference Result 206 states and 267 transitions. [2022-04-27 13:16:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2022-04-27 13:16:31,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:31,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:31,821 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:16:31,822 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:16:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:31,827 INFO L93 Difference]: Finished difference Result 206 states and 267 transitions. [2022-04-27 13:16:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2022-04-27 13:16:31,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:31,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:31,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:31,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:31,828 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:16:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 257 transitions. [2022-04-27 13:16:31,833 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 257 transitions. Word has length 55 [2022-04-27 13:16:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:31,834 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 257 transitions. [2022-04-27 13:16:31,834 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:16:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 257 transitions. [2022-04-27 13:16:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:16:31,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:31,835 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:16:31,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-27 13:16:32,051 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:16:32,051 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:32,052 INFO L85 PathProgramCache]: Analyzing trace with hash -304792209, now seen corresponding path program 1 times [2022-04-27 13:16:32,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:32,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65439833] [2022-04-27 13:16:32,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:32,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:32,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:32,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [94385716] [2022-04-27 13:16:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:32,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:32,067 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:16:32,070 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:16:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:32,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:16:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:32,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:32,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-27 13:16:32,419 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:16:32,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6268#true} {6268#true} #102#return; {6268#true} is VALID [2022-04-27 13:16:32,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {6268#true} call #t~ret9 := main(); {6268#true} is VALID [2022-04-27 13:16:32,419 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:16:32,419 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:16:32,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6268#true} {6268#true} #90#return; {6268#true} is VALID [2022-04-27 13:16:32,420 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:16:32,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,420 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6268#true} {6268#true} #92#return; {6268#true} is VALID [2022-04-27 13:16:32,420 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:16:32,421 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:16:32,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,421 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:16:32,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,421 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:16:32,422 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:16:32,422 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:16:32,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,422 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:16:32,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,423 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:16:32,423 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:16:32,423 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:16:32,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,424 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:16:32,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,425 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:16:32,425 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:16:32,426 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:16:32,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,426 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:16:32,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,427 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:16:32,427 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:16:32,427 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:16:32,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,427 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:16:32,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,428 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:16:32,428 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:16:32,428 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:16:32,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,429 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:16:32,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,429 INFO L290 TraceCheckUtils]: 61: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,429 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:16:32,430 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:16:32,430 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:16:32,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 100);havoc #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:16:32,431 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:16:32,431 INFO L290 TraceCheckUtils]: 68: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:16:32,431 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:16:32,431 INFO L290 TraceCheckUtils]: 70: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,431 INFO L290 TraceCheckUtils]: 71: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,435 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:16:32,436 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:16:32,436 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:16:32,436 INFO L290 TraceCheckUtils]: 76: Hoare triple {6269#false} assume !!(#t~post8 < 100);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:16:32,437 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:16:32,437 INFO L290 TraceCheckUtils]: 78: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-27 13:16:32,437 INFO L290 TraceCheckUtils]: 79: Hoare triple {6269#false} assume !(0 == ~cond); {6269#false} is VALID [2022-04-27 13:16:32,437 INFO L290 TraceCheckUtils]: 80: Hoare triple {6269#false} assume true; {6269#false} is VALID [2022-04-27 13:16:32,437 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6269#false} {6269#false} #98#return; {6269#false} is VALID [2022-04-27 13:16:32,437 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:16:32,437 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:16:32,437 INFO L290 TraceCheckUtils]: 84: Hoare triple {6269#false} assume !(#t~post8 < 100);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:16:32,437 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:16:32,437 INFO L290 TraceCheckUtils]: 86: Hoare triple {6269#false} assume !(#t~post6 < 100);havoc #t~post6; {6269#false} is VALID [2022-04-27 13:16:32,437 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:16:32,437 INFO L290 TraceCheckUtils]: 88: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-27 13:16:32,437 INFO L290 TraceCheckUtils]: 89: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-27 13:16:32,438 INFO L290 TraceCheckUtils]: 90: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-27 13:16:32,438 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:16:32,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:32,730 INFO L290 TraceCheckUtils]: 90: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-27 13:16:32,730 INFO L290 TraceCheckUtils]: 89: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-27 13:16:32,730 INFO L290 TraceCheckUtils]: 88: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-27 13:16:32,730 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:16:32,730 INFO L290 TraceCheckUtils]: 86: Hoare triple {6269#false} assume !(#t~post6 < 100);havoc #t~post6; {6269#false} is VALID [2022-04-27 13:16:32,730 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:16:32,730 INFO L290 TraceCheckUtils]: 84: Hoare triple {6269#false} assume !(#t~post8 < 100);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:16:32,730 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:16:32,730 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:16:32,730 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6268#true} {6269#false} #98#return; {6269#false} is VALID [2022-04-27 13:16:32,730 INFO L290 TraceCheckUtils]: 80: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,730 INFO L290 TraceCheckUtils]: 79: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,730 INFO L290 TraceCheckUtils]: 78: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,730 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:16:32,730 INFO L290 TraceCheckUtils]: 76: Hoare triple {6269#false} assume !!(#t~post8 < 100);havoc #t~post8; {6269#false} is VALID [2022-04-27 13:16:32,730 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:16:32,731 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:16:32,732 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:16:32,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,732 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:16:32,732 INFO L290 TraceCheckUtils]: 68: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:16:32,732 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:16:32,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {6466#(< 0 (+ main_~r~0 1))} assume !(#t~post7 < 100);havoc #t~post7; {6466#(< 0 (+ main_~r~0 1))} is VALID [2022-04-27 13:16:32,733 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:16:32,733 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:16:32,734 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:16:32,734 INFO L290 TraceCheckUtils]: 62: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,734 INFO L290 TraceCheckUtils]: 60: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,734 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:16:32,734 INFO L290 TraceCheckUtils]: 58: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,734 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:16:32,735 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:16:32,735 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:16:32,735 INFO L290 TraceCheckUtils]: 54: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,735 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:16:32,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,736 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:16:32,736 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:16:32,750 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:16:32,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,751 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:16:32,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,751 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:16:32,751 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:16:32,752 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:16:32,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,752 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:16:32,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,753 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:16:32,753 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:16:32,753 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:16:32,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,754 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:16:32,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,754 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:16:32,754 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:16:32,755 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:16:32,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,755 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:16:32,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {6321#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6321#(<= main_~v~0 1)} is VALID [2022-04-27 13:16:32,755 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:16:32,756 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:16:32,756 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6268#true} {6268#true} #92#return; {6268#true} is VALID [2022-04-27 13:16:32,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,756 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:16:32,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6268#true} {6268#true} #90#return; {6268#true} is VALID [2022-04-27 13:16:32,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-27 13:16:32,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-27 13:16:32,756 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:16:32,756 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:16:32,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {6268#true} call #t~ret9 := main(); {6268#true} is VALID [2022-04-27 13:16:32,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6268#true} {6268#true} #102#return; {6268#true} is VALID [2022-04-27 13:16:32,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-27 13:16:32,757 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:16:32,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-27 13:16:32,757 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:16:32,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:32,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65439833] [2022-04-27 13:16:32,757 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:32,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94385716] [2022-04-27 13:16:32,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94385716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:32,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:32,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-27 13:16:32,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145720090] [2022-04-27 13:16:32,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:32,758 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:16:32,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:32,759 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:16:32,806 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:16:32,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:16:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:32,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:16:32,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:32,807 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:16:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:33,316 INFO L93 Difference]: Finished difference Result 502 states and 697 transitions. [2022-04-27 13:16:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:16:33,316 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:16:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:33,317 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:16:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 13:16:33,319 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:16:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-27 13:16:33,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-27 13:16:33,409 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:16:33,418 INFO L225 Difference]: With dead ends: 502 [2022-04-27 13:16:33,419 INFO L226 Difference]: Without dead ends: 359 [2022-04-27 13:16:33,420 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:16:33,420 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:16:33,421 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:16:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-27 13:16:33,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2022-04-27 13:16:33,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:33,633 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:16:33,633 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:16:33,634 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:16:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:33,645 INFO L93 Difference]: Finished difference Result 359 states and 490 transitions. [2022-04-27 13:16:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 490 transitions. [2022-04-27 13:16:33,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:33,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:33,647 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:16:33,648 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:16:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:33,659 INFO L93 Difference]: Finished difference Result 359 states and 490 transitions. [2022-04-27 13:16:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 490 transitions. [2022-04-27 13:16:33,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:33,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:33,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:33,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:33,661 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:16:33,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 469 transitions. [2022-04-27 13:16:33,672 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 469 transitions. Word has length 91 [2022-04-27 13:16:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:33,673 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 469 transitions. [2022-04-27 13:16:33,673 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:16:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 469 transitions. [2022-04-27 13:16:33,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 13:16:33,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:33,675 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:16:33,699 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:16:33,887 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:16:33,887 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:33,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1103092705, now seen corresponding path program 2 times [2022-04-27 13:16:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:33,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809450261] [2022-04-27 13:16:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:33,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:33,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1798207888] [2022-04-27 13:16:33,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:16:33,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:33,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:33,903 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:16:33,910 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:16:33,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:16:33,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:16:33,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 13:16:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:33,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:34,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {8722#true} call ULTIMATE.init(); {8722#true} is VALID [2022-04-27 13:16:34,398 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:16:34,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:34,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#(<= ~counter~0 0)} {8722#true} #102#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:34,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {8730#(<= ~counter~0 0)} call #t~ret9 := main(); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:34,400 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:16:34,400 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:16:34,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#(<= ~counter~0 0)} ~cond := #in~cond; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:34,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#(<= ~counter~0 0)} assume !(0 == ~cond); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:34,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:34,402 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:16:34,402 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:16:34,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {8730#(<= ~counter~0 0)} ~cond := #in~cond; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:34,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {8730#(<= ~counter~0 0)} assume !(0 == ~cond); {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:34,403 INFO L290 TraceCheckUtils]: 14: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:34,404 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:16:34,404 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:16:34,405 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:16:34,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {8779#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:34,406 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:16:34,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {8779#(<= ~counter~0 1)} ~cond := #in~cond; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:34,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {8779#(<= ~counter~0 1)} assume !(0 == ~cond); {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:34,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {8779#(<= ~counter~0 1)} assume true; {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:34,407 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:16:34,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {8779#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8779#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:34,408 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:16:34,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {8804#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:34,409 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:16:34,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {8804#(<= ~counter~0 2)} ~cond := #in~cond; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:34,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {8804#(<= ~counter~0 2)} assume !(0 == ~cond); {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:34,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {8804#(<= ~counter~0 2)} assume true; {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:34,411 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:16:34,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {8804#(<= ~counter~0 2)} assume !(~r~0 > 0); {8804#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:34,412 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:16:34,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {8829#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:34,413 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:16:34,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {8829#(<= ~counter~0 3)} ~cond := #in~cond; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:34,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {8829#(<= ~counter~0 3)} assume !(0 == ~cond); {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:34,414 INFO L290 TraceCheckUtils]: 38: Hoare triple {8829#(<= ~counter~0 3)} assume true; {8829#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:34,415 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:16:34,415 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:16:34,415 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:16:34,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {8854#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:34,417 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:16:34,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {8854#(<= ~counter~0 4)} ~cond := #in~cond; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:34,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {8854#(<= ~counter~0 4)} assume !(0 == ~cond); {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:34,418 INFO L290 TraceCheckUtils]: 46: Hoare triple {8854#(<= ~counter~0 4)} assume true; {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:34,418 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:16:34,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {8854#(<= ~counter~0 4)} assume !(~r~0 < 0); {8854#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:34,419 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:16:34,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {8879#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:34,420 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:16:34,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {8879#(<= ~counter~0 5)} ~cond := #in~cond; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:34,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {8879#(<= ~counter~0 5)} assume !(0 == ~cond); {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:34,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {8879#(<= ~counter~0 5)} assume true; {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:34,422 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:16:34,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {8879#(<= ~counter~0 5)} assume !!(0 != ~r~0); {8879#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:34,423 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:16:34,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {8904#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:34,424 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:16:34,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {8904#(<= ~counter~0 6)} ~cond := #in~cond; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:34,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {8904#(<= ~counter~0 6)} assume !(0 == ~cond); {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:34,425 INFO L290 TraceCheckUtils]: 62: Hoare triple {8904#(<= ~counter~0 6)} assume true; {8904#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:34,426 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:16:34,426 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:16:34,427 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:16:34,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {8929#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:34,428 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:16:34,428 INFO L290 TraceCheckUtils]: 68: Hoare triple {8929#(<= ~counter~0 7)} ~cond := #in~cond; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:34,428 INFO L290 TraceCheckUtils]: 69: Hoare triple {8929#(<= ~counter~0 7)} assume !(0 == ~cond); {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:34,429 INFO L290 TraceCheckUtils]: 70: Hoare triple {8929#(<= ~counter~0 7)} assume true; {8929#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:34,429 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:16:34,430 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:16:34,430 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:16:34,430 INFO L290 TraceCheckUtils]: 74: Hoare triple {8954#(<= |main_#t~post7| 7)} assume !(#t~post7 < 100);havoc #t~post7; {8723#false} is VALID [2022-04-27 13:16:34,431 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:16:34,431 INFO L290 TraceCheckUtils]: 76: Hoare triple {8723#false} assume !!(#t~post8 < 100);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:16:34,431 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:16:34,431 INFO L290 TraceCheckUtils]: 78: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-27 13:16:34,431 INFO L290 TraceCheckUtils]: 79: Hoare triple {8723#false} assume !(0 == ~cond); {8723#false} is VALID [2022-04-27 13:16:34,431 INFO L290 TraceCheckUtils]: 80: Hoare triple {8723#false} assume true; {8723#false} is VALID [2022-04-27 13:16:34,431 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8723#false} {8723#false} #98#return; {8723#false} is VALID [2022-04-27 13:16:34,431 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:16:34,431 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:16:34,431 INFO L290 TraceCheckUtils]: 84: Hoare triple {8723#false} assume !(#t~post8 < 100);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:16:34,431 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:16:34,431 INFO L290 TraceCheckUtils]: 86: Hoare triple {8723#false} assume !(#t~post6 < 100);havoc #t~post6; {8723#false} is VALID [2022-04-27 13:16:34,432 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:16:34,432 INFO L290 TraceCheckUtils]: 88: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-27 13:16:34,432 INFO L290 TraceCheckUtils]: 89: Hoare triple {8723#false} assume 0 == ~cond; {8723#false} is VALID [2022-04-27 13:16:34,432 INFO L290 TraceCheckUtils]: 90: Hoare triple {8723#false} assume !false; {8723#false} is VALID [2022-04-27 13:16:34,432 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:16:34,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:34,880 INFO L290 TraceCheckUtils]: 90: Hoare triple {8723#false} assume !false; {8723#false} is VALID [2022-04-27 13:16:34,881 INFO L290 TraceCheckUtils]: 89: Hoare triple {8723#false} assume 0 == ~cond; {8723#false} is VALID [2022-04-27 13:16:34,881 INFO L290 TraceCheckUtils]: 88: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-27 13:16:34,881 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:16:34,881 INFO L290 TraceCheckUtils]: 86: Hoare triple {8723#false} assume !(#t~post6 < 100);havoc #t~post6; {8723#false} is VALID [2022-04-27 13:16:34,881 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:16:34,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {8723#false} assume !(#t~post8 < 100);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:16:34,881 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:16:34,881 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:16:34,881 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8722#true} {8723#false} #98#return; {8723#false} is VALID [2022-04-27 13:16:34,881 INFO L290 TraceCheckUtils]: 80: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,881 INFO L290 TraceCheckUtils]: 79: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,881 INFO L290 TraceCheckUtils]: 78: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,881 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:16:34,881 INFO L290 TraceCheckUtils]: 76: Hoare triple {8723#false} assume !!(#t~post8 < 100);havoc #t~post8; {8723#false} is VALID [2022-04-27 13:16:34,881 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:16:34,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {9054#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {8723#false} is VALID [2022-04-27 13:16:34,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {9058#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9054#(< |main_#t~post7| 100)} is VALID [2022-04-27 13:16:34,886 INFO L290 TraceCheckUtils]: 72: Hoare triple {9058#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9058#(< ~counter~0 100)} is VALID [2022-04-27 13:16:34,887 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8722#true} {9058#(< ~counter~0 100)} #96#return; {9058#(< ~counter~0 100)} is VALID [2022-04-27 13:16:34,887 INFO L290 TraceCheckUtils]: 70: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,887 INFO L290 TraceCheckUtils]: 69: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,887 INFO L290 TraceCheckUtils]: 68: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,887 INFO L272 TraceCheckUtils]: 67: Hoare triple {9058#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:16:34,887 INFO L290 TraceCheckUtils]: 66: Hoare triple {9058#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {9058#(< ~counter~0 100)} is VALID [2022-04-27 13:16:34,888 INFO L290 TraceCheckUtils]: 65: Hoare triple {9083#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9058#(< ~counter~0 100)} is VALID [2022-04-27 13:16:34,888 INFO L290 TraceCheckUtils]: 64: Hoare triple {9083#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9083#(< ~counter~0 99)} is VALID [2022-04-27 13:16:34,889 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8722#true} {9083#(< ~counter~0 99)} #96#return; {9083#(< ~counter~0 99)} is VALID [2022-04-27 13:16:34,889 INFO L290 TraceCheckUtils]: 62: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,889 INFO L290 TraceCheckUtils]: 61: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,889 INFO L290 TraceCheckUtils]: 60: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,889 INFO L272 TraceCheckUtils]: 59: Hoare triple {9083#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:16:34,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {9083#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {9083#(< ~counter~0 99)} is VALID [2022-04-27 13:16:34,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {9108#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9083#(< ~counter~0 99)} is VALID [2022-04-27 13:16:34,890 INFO L290 TraceCheckUtils]: 56: Hoare triple {9108#(< ~counter~0 98)} assume !!(0 != ~r~0); {9108#(< ~counter~0 98)} is VALID [2022-04-27 13:16:34,890 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8722#true} {9108#(< ~counter~0 98)} #94#return; {9108#(< ~counter~0 98)} is VALID [2022-04-27 13:16:34,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,891 INFO L290 TraceCheckUtils]: 52: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,891 INFO L272 TraceCheckUtils]: 51: Hoare triple {9108#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:16:34,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {9108#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {9108#(< ~counter~0 98)} is VALID [2022-04-27 13:16:34,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {9133#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9108#(< ~counter~0 98)} is VALID [2022-04-27 13:16:34,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {9133#(< ~counter~0 97)} assume !(~r~0 < 0); {9133#(< ~counter~0 97)} is VALID [2022-04-27 13:16:34,892 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8722#true} {9133#(< ~counter~0 97)} #98#return; {9133#(< ~counter~0 97)} is VALID [2022-04-27 13:16:34,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,892 INFO L272 TraceCheckUtils]: 43: Hoare triple {9133#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:16:34,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {9133#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {9133#(< ~counter~0 97)} is VALID [2022-04-27 13:16:34,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {9158#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9133#(< ~counter~0 97)} is VALID [2022-04-27 13:16:34,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {9158#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9158#(< ~counter~0 96)} is VALID [2022-04-27 13:16:34,894 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8722#true} {9158#(< ~counter~0 96)} #98#return; {9158#(< ~counter~0 96)} is VALID [2022-04-27 13:16:34,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,894 INFO L272 TraceCheckUtils]: 35: Hoare triple {9158#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:16:34,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {9158#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {9158#(< ~counter~0 96)} is VALID [2022-04-27 13:16:34,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {9183#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9158#(< ~counter~0 96)} is VALID [2022-04-27 13:16:34,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {9183#(< ~counter~0 95)} assume !(~r~0 > 0); {9183#(< ~counter~0 95)} is VALID [2022-04-27 13:16:34,897 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8722#true} {9183#(< ~counter~0 95)} #96#return; {9183#(< ~counter~0 95)} is VALID [2022-04-27 13:16:34,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,897 INFO L272 TraceCheckUtils]: 27: Hoare triple {9183#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:16:34,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {9183#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {9183#(< ~counter~0 95)} is VALID [2022-04-27 13:16:34,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {9208#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9183#(< ~counter~0 95)} is VALID [2022-04-27 13:16:34,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {9208#(< ~counter~0 94)} assume !!(0 != ~r~0); {9208#(< ~counter~0 94)} is VALID [2022-04-27 13:16:34,899 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8722#true} {9208#(< ~counter~0 94)} #94#return; {9208#(< ~counter~0 94)} is VALID [2022-04-27 13:16:34,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,899 INFO L272 TraceCheckUtils]: 19: Hoare triple {9208#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8722#true} is VALID [2022-04-27 13:16:34,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {9208#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {9208#(< ~counter~0 94)} is VALID [2022-04-27 13:16:34,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {9233#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9208#(< ~counter~0 94)} is VALID [2022-04-27 13:16:34,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {9233#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9233#(< ~counter~0 93)} is VALID [2022-04-27 13:16:34,901 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8722#true} {9233#(< ~counter~0 93)} #92#return; {9233#(< ~counter~0 93)} is VALID [2022-04-27 13:16:34,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,901 INFO L272 TraceCheckUtils]: 11: Hoare triple {9233#(< ~counter~0 93)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {8722#true} is VALID [2022-04-27 13:16:34,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8722#true} {9233#(< ~counter~0 93)} #90#return; {9233#(< ~counter~0 93)} is VALID [2022-04-27 13:16:34,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-27 13:16:34,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-27 13:16:34,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-27 13:16:34,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {9233#(< ~counter~0 93)} 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:16:34,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {9233#(< ~counter~0 93)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9233#(< ~counter~0 93)} is VALID [2022-04-27 13:16:34,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {9233#(< ~counter~0 93)} call #t~ret9 := main(); {9233#(< ~counter~0 93)} is VALID [2022-04-27 13:16:34,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9233#(< ~counter~0 93)} {8722#true} #102#return; {9233#(< ~counter~0 93)} is VALID [2022-04-27 13:16:34,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {9233#(< ~counter~0 93)} assume true; {9233#(< ~counter~0 93)} is VALID [2022-04-27 13:16:34,904 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 93)} is VALID [2022-04-27 13:16:34,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {8722#true} call ULTIMATE.init(); {8722#true} is VALID [2022-04-27 13:16:34,905 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:16:34,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:34,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809450261] [2022-04-27 13:16:34,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:34,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798207888] [2022-04-27 13:16:34,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798207888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:34,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:34,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-27 13:16:34,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829475181] [2022-04-27 13:16:34,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:34,906 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:16:34,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:34,907 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:16:35,010 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:16:35,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 13:16:35,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 13:16:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-27 13:16:35,012 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:16:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:36,899 INFO L93 Difference]: Finished difference Result 985 states and 1423 transitions. [2022-04-27 13:16:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-27 13:16:36,899 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:16:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:36,900 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:16:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-27 13:16:36,905 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:16:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-27 13:16:36,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 373 transitions. [2022-04-27 13:16:37,232 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:16:37,293 INFO L225 Difference]: With dead ends: 985 [2022-04-27 13:16:37,293 INFO L226 Difference]: Without dead ends: 842 [2022-04-27 13:16:37,294 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:16:37,295 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 352 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:37,295 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.4s Time] [2022-04-27 13:16:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-04-27 13:16:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 793. [2022-04-27 13:16:37,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:37,834 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:16:37,835 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:16:37,836 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:16:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:37,877 INFO L93 Difference]: Finished difference Result 842 states and 1155 transitions. [2022-04-27 13:16:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2022-04-27 13:16:37,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:37,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:37,881 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:16:37,882 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:16:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:37,923 INFO L93 Difference]: Finished difference Result 842 states and 1155 transitions. [2022-04-27 13:16:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2022-04-27 13:16:37,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:37,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:37,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:37,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:37,940 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:16:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1109 transitions. [2022-04-27 13:16:37,985 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1109 transitions. Word has length 91 [2022-04-27 13:16:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:37,986 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1109 transitions. [2022-04-27 13:16:37,986 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:16:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1109 transitions. [2022-04-27 13:16:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 13:16:37,988 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:37,988 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:16:38,014 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:16:38,203 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:16:38,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 1 times [2022-04-27 13:16:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:38,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245567129] [2022-04-27 13:16:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:38,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:38,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114513652] [2022-04-27 13:16:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:38,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:38,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:38,219 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:16:38,220 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:16:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:38,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 13:16:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:38,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:38,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {13512#true} call ULTIMATE.init(); {13512#true} is VALID [2022-04-27 13:16:38,775 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:16:38,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:38,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13520#(<= ~counter~0 0)} {13512#true} #102#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:38,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {13520#(<= ~counter~0 0)} call #t~ret9 := main(); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:38,776 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:16:38,776 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:16:38,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {13520#(<= ~counter~0 0)} ~cond := #in~cond; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:38,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {13520#(<= ~counter~0 0)} assume !(0 == ~cond); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:38,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:38,777 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:16:38,778 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:16:38,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {13520#(<= ~counter~0 0)} ~cond := #in~cond; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:38,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {13520#(<= ~counter~0 0)} assume !(0 == ~cond); {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:38,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:38,779 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:16:38,779 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:16:38,780 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:16:38,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {13569#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:38,780 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:16:38,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {13569#(<= ~counter~0 1)} ~cond := #in~cond; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:38,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {13569#(<= ~counter~0 1)} assume !(0 == ~cond); {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:38,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {13569#(<= ~counter~0 1)} assume true; {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:38,783 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:16:38,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {13569#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13569#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:38,784 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:16:38,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {13594#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:38,785 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:16:38,785 INFO L290 TraceCheckUtils]: 28: Hoare triple {13594#(<= ~counter~0 2)} ~cond := #in~cond; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:38,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {13594#(<= ~counter~0 2)} assume !(0 == ~cond); {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:38,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {13594#(<= ~counter~0 2)} assume true; {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:38,786 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:16:38,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {13594#(<= ~counter~0 2)} assume !(~r~0 > 0); {13594#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:38,787 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:16:38,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {13619#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:38,788 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:16:38,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {13619#(<= ~counter~0 3)} ~cond := #in~cond; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:38,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {13619#(<= ~counter~0 3)} assume !(0 == ~cond); {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:38,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {13619#(<= ~counter~0 3)} assume true; {13619#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:38,789 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:16:38,789 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:16:38,790 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:16:38,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {13644#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:38,791 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:16:38,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {13644#(<= ~counter~0 4)} ~cond := #in~cond; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:38,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {13644#(<= ~counter~0 4)} assume !(0 == ~cond); {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:38,791 INFO L290 TraceCheckUtils]: 46: Hoare triple {13644#(<= ~counter~0 4)} assume true; {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:38,792 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:16:38,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {13644#(<= ~counter~0 4)} assume !(~r~0 < 0); {13644#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:38,793 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:16:38,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {13669#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:38,793 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:16:38,794 INFO L290 TraceCheckUtils]: 52: Hoare triple {13669#(<= ~counter~0 5)} ~cond := #in~cond; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:38,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {13669#(<= ~counter~0 5)} assume !(0 == ~cond); {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:38,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {13669#(<= ~counter~0 5)} assume true; {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:38,795 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:16:38,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {13669#(<= ~counter~0 5)} assume !!(0 != ~r~0); {13669#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:38,795 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:16:38,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {13694#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:38,796 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:16:38,796 INFO L290 TraceCheckUtils]: 60: Hoare triple {13694#(<= ~counter~0 6)} ~cond := #in~cond; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:38,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {13694#(<= ~counter~0 6)} assume !(0 == ~cond); {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:38,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {13694#(<= ~counter~0 6)} assume true; {13694#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:38,797 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:16:38,798 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:16:38,798 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:16:38,798 INFO L290 TraceCheckUtils]: 66: Hoare triple {13719#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:38,799 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:16:38,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {13719#(<= ~counter~0 7)} ~cond := #in~cond; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:38,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {13719#(<= ~counter~0 7)} assume !(0 == ~cond); {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:38,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {13719#(<= ~counter~0 7)} assume true; {13719#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:38,800 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:16:38,800 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:16:38,801 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:16:38,801 INFO L290 TraceCheckUtils]: 74: Hoare triple {13744#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:38,802 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:16:38,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {13744#(<= ~counter~0 8)} ~cond := #in~cond; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:38,802 INFO L290 TraceCheckUtils]: 77: Hoare triple {13744#(<= ~counter~0 8)} assume !(0 == ~cond); {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:38,802 INFO L290 TraceCheckUtils]: 78: Hoare triple {13744#(<= ~counter~0 8)} assume true; {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:38,803 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:16:38,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {13744#(<= ~counter~0 8)} assume !(~r~0 > 0); {13744#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:38,804 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:16:38,804 INFO L290 TraceCheckUtils]: 82: Hoare triple {13769#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:38,804 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:16:38,805 INFO L290 TraceCheckUtils]: 84: Hoare triple {13769#(<= ~counter~0 9)} ~cond := #in~cond; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:38,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {13769#(<= ~counter~0 9)} assume !(0 == ~cond); {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:38,805 INFO L290 TraceCheckUtils]: 86: Hoare triple {13769#(<= ~counter~0 9)} assume true; {13769#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:38,806 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:16:38,806 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:16:38,806 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:16:38,807 INFO L290 TraceCheckUtils]: 90: Hoare triple {13794#(<= |main_#t~post8| 9)} assume !(#t~post8 < 100);havoc #t~post8; {13513#false} is VALID [2022-04-27 13:16:38,807 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:16:38,807 INFO L290 TraceCheckUtils]: 92: Hoare triple {13513#false} assume !(#t~post6 < 100);havoc #t~post6; {13513#false} is VALID [2022-04-27 13:16:38,807 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:16:38,807 INFO L290 TraceCheckUtils]: 94: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-27 13:16:38,807 INFO L290 TraceCheckUtils]: 95: Hoare triple {13513#false} assume 0 == ~cond; {13513#false} is VALID [2022-04-27 13:16:38,807 INFO L290 TraceCheckUtils]: 96: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-27 13:16:38,807 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:16:38,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:39,421 INFO L290 TraceCheckUtils]: 96: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-27 13:16:39,421 INFO L290 TraceCheckUtils]: 95: Hoare triple {13513#false} assume 0 == ~cond; {13513#false} is VALID [2022-04-27 13:16:39,422 INFO L290 TraceCheckUtils]: 94: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-27 13:16:39,422 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:16:39,422 INFO L290 TraceCheckUtils]: 92: Hoare triple {13513#false} assume !(#t~post6 < 100);havoc #t~post6; {13513#false} is VALID [2022-04-27 13:16:39,422 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:16:39,422 INFO L290 TraceCheckUtils]: 90: Hoare triple {13834#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {13513#false} is VALID [2022-04-27 13:16:39,422 INFO L290 TraceCheckUtils]: 89: Hoare triple {13838#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13834#(< |main_#t~post8| 100)} is VALID [2022-04-27 13:16:39,423 INFO L290 TraceCheckUtils]: 88: Hoare triple {13838#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13838#(< ~counter~0 100)} is VALID [2022-04-27 13:16:39,423 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13512#true} {13838#(< ~counter~0 100)} #98#return; {13838#(< ~counter~0 100)} is VALID [2022-04-27 13:16:39,423 INFO L290 TraceCheckUtils]: 86: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,423 INFO L290 TraceCheckUtils]: 85: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,423 INFO L290 TraceCheckUtils]: 84: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,423 INFO L272 TraceCheckUtils]: 83: Hoare triple {13838#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,424 INFO L290 TraceCheckUtils]: 82: Hoare triple {13838#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {13838#(< ~counter~0 100)} is VALID [2022-04-27 13:16:39,424 INFO L290 TraceCheckUtils]: 81: Hoare triple {13863#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13838#(< ~counter~0 100)} is VALID [2022-04-27 13:16:39,424 INFO L290 TraceCheckUtils]: 80: Hoare triple {13863#(< ~counter~0 99)} assume !(~r~0 > 0); {13863#(< ~counter~0 99)} is VALID [2022-04-27 13:16:39,425 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13512#true} {13863#(< ~counter~0 99)} #96#return; {13863#(< ~counter~0 99)} is VALID [2022-04-27 13:16:39,425 INFO L290 TraceCheckUtils]: 78: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,425 INFO L290 TraceCheckUtils]: 77: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,425 INFO L290 TraceCheckUtils]: 76: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,425 INFO L272 TraceCheckUtils]: 75: Hoare triple {13863#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,425 INFO L290 TraceCheckUtils]: 74: Hoare triple {13863#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {13863#(< ~counter~0 99)} is VALID [2022-04-27 13:16:39,426 INFO L290 TraceCheckUtils]: 73: Hoare triple {13888#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13863#(< ~counter~0 99)} is VALID [2022-04-27 13:16:39,426 INFO L290 TraceCheckUtils]: 72: Hoare triple {13888#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13888#(< ~counter~0 98)} is VALID [2022-04-27 13:16:39,426 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13512#true} {13888#(< ~counter~0 98)} #96#return; {13888#(< ~counter~0 98)} is VALID [2022-04-27 13:16:39,427 INFO L290 TraceCheckUtils]: 70: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,427 INFO L290 TraceCheckUtils]: 69: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,427 INFO L290 TraceCheckUtils]: 68: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,427 INFO L272 TraceCheckUtils]: 67: Hoare triple {13888#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,427 INFO L290 TraceCheckUtils]: 66: Hoare triple {13888#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {13888#(< ~counter~0 98)} is VALID [2022-04-27 13:16:39,427 INFO L290 TraceCheckUtils]: 65: Hoare triple {13913#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13888#(< ~counter~0 98)} is VALID [2022-04-27 13:16:39,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {13913#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13913#(< ~counter~0 97)} is VALID [2022-04-27 13:16:39,428 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13512#true} {13913#(< ~counter~0 97)} #96#return; {13913#(< ~counter~0 97)} is VALID [2022-04-27 13:16:39,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,428 INFO L272 TraceCheckUtils]: 59: Hoare triple {13913#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {13913#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {13913#(< ~counter~0 97)} is VALID [2022-04-27 13:16:39,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {13938#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13913#(< ~counter~0 97)} is VALID [2022-04-27 13:16:39,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {13938#(< ~counter~0 96)} assume !!(0 != ~r~0); {13938#(< ~counter~0 96)} is VALID [2022-04-27 13:16:39,430 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13512#true} {13938#(< ~counter~0 96)} #94#return; {13938#(< ~counter~0 96)} is VALID [2022-04-27 13:16:39,430 INFO L290 TraceCheckUtils]: 54: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,430 INFO L272 TraceCheckUtils]: 51: Hoare triple {13938#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {13938#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {13938#(< ~counter~0 96)} is VALID [2022-04-27 13:16:39,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {13963#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13938#(< ~counter~0 96)} is VALID [2022-04-27 13:16:39,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {13963#(< ~counter~0 95)} assume !(~r~0 < 0); {13963#(< ~counter~0 95)} is VALID [2022-04-27 13:16:39,431 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13512#true} {13963#(< ~counter~0 95)} #98#return; {13963#(< ~counter~0 95)} is VALID [2022-04-27 13:16:39,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,432 INFO L272 TraceCheckUtils]: 43: Hoare triple {13963#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {13963#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {13963#(< ~counter~0 95)} is VALID [2022-04-27 13:16:39,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {13988#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13963#(< ~counter~0 95)} is VALID [2022-04-27 13:16:39,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {13988#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13988#(< ~counter~0 94)} is VALID [2022-04-27 13:16:39,433 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13512#true} {13988#(< ~counter~0 94)} #98#return; {13988#(< ~counter~0 94)} is VALID [2022-04-27 13:16:39,433 INFO L290 TraceCheckUtils]: 38: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,433 INFO L272 TraceCheckUtils]: 35: Hoare triple {13988#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {13988#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {13988#(< ~counter~0 94)} is VALID [2022-04-27 13:16:39,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {14013#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13988#(< ~counter~0 94)} is VALID [2022-04-27 13:16:39,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {14013#(< ~counter~0 93)} assume !(~r~0 > 0); {14013#(< ~counter~0 93)} is VALID [2022-04-27 13:16:39,435 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13512#true} {14013#(< ~counter~0 93)} #96#return; {14013#(< ~counter~0 93)} is VALID [2022-04-27 13:16:39,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,435 INFO L272 TraceCheckUtils]: 27: Hoare triple {14013#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {14013#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {14013#(< ~counter~0 93)} is VALID [2022-04-27 13:16:39,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {14038#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14013#(< ~counter~0 93)} is VALID [2022-04-27 13:16:39,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {14038#(< ~counter~0 92)} assume !!(0 != ~r~0); {14038#(< ~counter~0 92)} is VALID [2022-04-27 13:16:39,436 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13512#true} {14038#(< ~counter~0 92)} #94#return; {14038#(< ~counter~0 92)} is VALID [2022-04-27 13:16:39,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,437 INFO L272 TraceCheckUtils]: 19: Hoare triple {14038#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {14038#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {14038#(< ~counter~0 92)} is VALID [2022-04-27 13:16:39,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {14063#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14038#(< ~counter~0 92)} is VALID [2022-04-27 13:16:39,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {14063#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14063#(< ~counter~0 91)} is VALID [2022-04-27 13:16:39,438 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13512#true} {14063#(< ~counter~0 91)} #92#return; {14063#(< ~counter~0 91)} is VALID [2022-04-27 13:16:39,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,438 INFO L272 TraceCheckUtils]: 11: Hoare triple {14063#(< ~counter~0 91)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13512#true} is VALID [2022-04-27 13:16:39,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13512#true} {14063#(< ~counter~0 91)} #90#return; {14063#(< ~counter~0 91)} is VALID [2022-04-27 13:16:39,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-27 13:16:39,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-27 13:16:39,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-27 13:16:39,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {14063#(< ~counter~0 91)} 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:16:39,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {14063#(< ~counter~0 91)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {14063#(< ~counter~0 91)} is VALID [2022-04-27 13:16:39,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {14063#(< ~counter~0 91)} call #t~ret9 := main(); {14063#(< ~counter~0 91)} is VALID [2022-04-27 13:16:39,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14063#(< ~counter~0 91)} {13512#true} #102#return; {14063#(< ~counter~0 91)} is VALID [2022-04-27 13:16:39,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {14063#(< ~counter~0 91)} assume true; {14063#(< ~counter~0 91)} is VALID [2022-04-27 13:16:39,440 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 91)} is VALID [2022-04-27 13:16:39,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {13512#true} call ULTIMATE.init(); {13512#true} is VALID [2022-04-27 13:16:39,441 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:16:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:39,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245567129] [2022-04-27 13:16:39,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:39,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114513652] [2022-04-27 13:16:39,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114513652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:39,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:39,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-27 13:16:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95247395] [2022-04-27 13:16:39,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:39,442 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:16:39,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:39,443 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:16:39,554 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:16:39,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-27 13:16:39,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-27 13:16:39,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-27 13:16:39,555 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:16:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:42,159 INFO L93 Difference]: Finished difference Result 1285 states and 1799 transitions. [2022-04-27 13:16:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-27 13:16:42,160 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:16:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:42,160 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:16:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-27 13:16:42,167 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:16:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-27 13:16:42,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 467 transitions. [2022-04-27 13:16:42,598 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:16:42,654 INFO L225 Difference]: With dead ends: 1285 [2022-04-27 13:16:42,655 INFO L226 Difference]: Without dead ends: 795 [2022-04-27 13:16:42,656 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:16:42,657 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 597 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:42,657 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.6s Time] [2022-04-27 13:16:42,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-27 13:16:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 740. [2022-04-27 13:16:43,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:43,159 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:16:43,160 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:16:43,161 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:16:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:43,196 INFO L93 Difference]: Finished difference Result 795 states and 1047 transitions. [2022-04-27 13:16:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1047 transitions. [2022-04-27 13:16:43,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:43,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:43,200 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:16:43,201 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:16:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:43,236 INFO L93 Difference]: Finished difference Result 795 states and 1047 transitions. [2022-04-27 13:16:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1047 transitions. [2022-04-27 13:16:43,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:43,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:43,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:43,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:43,240 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:16:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1001 transitions. [2022-04-27 13:16:43,289 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1001 transitions. Word has length 97 [2022-04-27 13:16:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:43,290 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1001 transitions. [2022-04-27 13:16:43,290 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:16:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1001 transitions. [2022-04-27 13:16:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-27 13:16:43,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:43,292 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:16:43,321 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:16:43,516 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:16:43,516 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 1 times [2022-04-27 13:16:43,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:43,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002366745] [2022-04-27 13:16:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:43,540 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:43,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751010005] [2022-04-27 13:16:43,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:43,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:43,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:43,543 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:16:43,571 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:16:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:43,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:16:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:43,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:44,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-27 13:16:44,181 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:16:44,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:44,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18589#(<= ~counter~0 0)} {18581#true} #102#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:44,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {18589#(<= ~counter~0 0)} call #t~ret9 := main(); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:44,182 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:16:44,183 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:16:44,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {18589#(<= ~counter~0 0)} ~cond := #in~cond; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:44,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {18589#(<= ~counter~0 0)} assume !(0 == ~cond); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:44,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:44,192 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:16:44,193 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:16:44,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {18589#(<= ~counter~0 0)} ~cond := #in~cond; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:44,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {18589#(<= ~counter~0 0)} assume !(0 == ~cond); {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:44,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-27 13:16:44,194 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:16:44,195 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:16:44,196 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:16:44,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {18638#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:44,197 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:16:44,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {18638#(<= ~counter~0 1)} ~cond := #in~cond; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:44,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {18638#(<= ~counter~0 1)} assume !(0 == ~cond); {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:44,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {18638#(<= ~counter~0 1)} assume true; {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:44,198 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:16:44,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {18638#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18638#(<= ~counter~0 1)} is VALID [2022-04-27 13:16:44,199 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:16:44,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {18663#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:44,200 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:16:44,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {18663#(<= ~counter~0 2)} ~cond := #in~cond; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:44,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {18663#(<= ~counter~0 2)} assume !(0 == ~cond); {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:44,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {18663#(<= ~counter~0 2)} assume true; {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:44,203 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:16:44,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {18663#(<= ~counter~0 2)} assume !(~r~0 > 0); {18663#(<= ~counter~0 2)} is VALID [2022-04-27 13:16:44,204 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:16:44,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {18688#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:44,205 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:16:44,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {18688#(<= ~counter~0 3)} ~cond := #in~cond; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:44,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {18688#(<= ~counter~0 3)} assume !(0 == ~cond); {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:44,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {18688#(<= ~counter~0 3)} assume true; {18688#(<= ~counter~0 3)} is VALID [2022-04-27 13:16:44,207 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:16:44,207 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:16:44,208 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:16:44,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {18713#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:44,209 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:16:44,209 INFO L290 TraceCheckUtils]: 44: Hoare triple {18713#(<= ~counter~0 4)} ~cond := #in~cond; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:44,209 INFO L290 TraceCheckUtils]: 45: Hoare triple {18713#(<= ~counter~0 4)} assume !(0 == ~cond); {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:44,210 INFO L290 TraceCheckUtils]: 46: Hoare triple {18713#(<= ~counter~0 4)} assume true; {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:44,210 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:16:44,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {18713#(<= ~counter~0 4)} assume !(~r~0 < 0); {18713#(<= ~counter~0 4)} is VALID [2022-04-27 13:16:44,212 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:16:44,212 INFO L290 TraceCheckUtils]: 50: Hoare triple {18738#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:44,213 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:16:44,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {18738#(<= ~counter~0 5)} ~cond := #in~cond; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:44,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {18738#(<= ~counter~0 5)} assume !(0 == ~cond); {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:44,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {18738#(<= ~counter~0 5)} assume true; {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:44,214 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:16:44,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {18738#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18738#(<= ~counter~0 5)} is VALID [2022-04-27 13:16:44,216 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:16:44,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {18763#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:44,217 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:16:44,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {18763#(<= ~counter~0 6)} ~cond := #in~cond; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:44,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {18763#(<= ~counter~0 6)} assume !(0 == ~cond); {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:44,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {18763#(<= ~counter~0 6)} assume true; {18763#(<= ~counter~0 6)} is VALID [2022-04-27 13:16:44,218 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:16:44,219 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:16:44,219 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:16:44,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {18788#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:44,221 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:16:44,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {18788#(<= ~counter~0 7)} ~cond := #in~cond; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:44,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {18788#(<= ~counter~0 7)} assume !(0 == ~cond); {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:44,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {18788#(<= ~counter~0 7)} assume true; {18788#(<= ~counter~0 7)} is VALID [2022-04-27 13:16:44,222 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:16:44,223 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:16:44,224 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:16:44,224 INFO L290 TraceCheckUtils]: 74: Hoare triple {18813#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:44,225 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:16:44,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {18813#(<= ~counter~0 8)} ~cond := #in~cond; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:44,225 INFO L290 TraceCheckUtils]: 77: Hoare triple {18813#(<= ~counter~0 8)} assume !(0 == ~cond); {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:44,226 INFO L290 TraceCheckUtils]: 78: Hoare triple {18813#(<= ~counter~0 8)} assume true; {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:44,226 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:16:44,227 INFO L290 TraceCheckUtils]: 80: Hoare triple {18813#(<= ~counter~0 8)} assume !(~r~0 > 0); {18813#(<= ~counter~0 8)} is VALID [2022-04-27 13:16:44,227 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:16:44,228 INFO L290 TraceCheckUtils]: 82: Hoare triple {18838#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:44,229 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:16:44,229 INFO L290 TraceCheckUtils]: 84: Hoare triple {18838#(<= ~counter~0 9)} ~cond := #in~cond; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:44,229 INFO L290 TraceCheckUtils]: 85: Hoare triple {18838#(<= ~counter~0 9)} assume !(0 == ~cond); {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:44,230 INFO L290 TraceCheckUtils]: 86: Hoare triple {18838#(<= ~counter~0 9)} assume true; {18838#(<= ~counter~0 9)} is VALID [2022-04-27 13:16:44,230 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:16:44,231 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:16:44,236 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:16:44,236 INFO L290 TraceCheckUtils]: 90: Hoare triple {18863#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:44,237 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:16:44,237 INFO L290 TraceCheckUtils]: 92: Hoare triple {18863#(<= ~counter~0 10)} ~cond := #in~cond; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:44,238 INFO L290 TraceCheckUtils]: 93: Hoare triple {18863#(<= ~counter~0 10)} assume !(0 == ~cond); {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:44,238 INFO L290 TraceCheckUtils]: 94: Hoare triple {18863#(<= ~counter~0 10)} assume true; {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:44,239 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:16:44,239 INFO L290 TraceCheckUtils]: 96: Hoare triple {18863#(<= ~counter~0 10)} assume !(~r~0 < 0); {18863#(<= ~counter~0 10)} is VALID [2022-04-27 13:16:44,240 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:16:44,240 INFO L290 TraceCheckUtils]: 98: Hoare triple {18888#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {18582#false} is VALID [2022-04-27 13:16:44,240 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:16:44,240 INFO L290 TraceCheckUtils]: 100: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-27 13:16:44,240 INFO L290 TraceCheckUtils]: 101: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-27 13:16:44,241 INFO L290 TraceCheckUtils]: 102: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-27 13:16:44,241 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:16:44,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:16:44,859 INFO L290 TraceCheckUtils]: 102: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-27 13:16:44,859 INFO L290 TraceCheckUtils]: 101: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-27 13:16:44,859 INFO L290 TraceCheckUtils]: 100: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-27 13:16:44,859 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:16:44,859 INFO L290 TraceCheckUtils]: 98: Hoare triple {18916#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {18582#false} is VALID [2022-04-27 13:16:44,860 INFO L290 TraceCheckUtils]: 97: Hoare triple {18920#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18916#(< |main_#t~post6| 100)} is VALID [2022-04-27 13:16:44,860 INFO L290 TraceCheckUtils]: 96: Hoare triple {18920#(< ~counter~0 100)} assume !(~r~0 < 0); {18920#(< ~counter~0 100)} is VALID [2022-04-27 13:16:44,860 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18581#true} {18920#(< ~counter~0 100)} #98#return; {18920#(< ~counter~0 100)} is VALID [2022-04-27 13:16:44,860 INFO L290 TraceCheckUtils]: 94: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,860 INFO L290 TraceCheckUtils]: 93: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,860 INFO L290 TraceCheckUtils]: 92: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,861 INFO L272 TraceCheckUtils]: 91: Hoare triple {18920#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,861 INFO L290 TraceCheckUtils]: 90: Hoare triple {18920#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {18920#(< ~counter~0 100)} is VALID [2022-04-27 13:16:44,861 INFO L290 TraceCheckUtils]: 89: Hoare triple {18945#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18920#(< ~counter~0 100)} is VALID [2022-04-27 13:16:44,862 INFO L290 TraceCheckUtils]: 88: Hoare triple {18945#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18945#(< ~counter~0 99)} is VALID [2022-04-27 13:16:44,862 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18581#true} {18945#(< ~counter~0 99)} #98#return; {18945#(< ~counter~0 99)} is VALID [2022-04-27 13:16:44,862 INFO L290 TraceCheckUtils]: 86: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,862 INFO L290 TraceCheckUtils]: 85: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,862 INFO L290 TraceCheckUtils]: 84: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,862 INFO L272 TraceCheckUtils]: 83: Hoare triple {18945#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {18945#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {18945#(< ~counter~0 99)} is VALID [2022-04-27 13:16:44,863 INFO L290 TraceCheckUtils]: 81: Hoare triple {18970#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18945#(< ~counter~0 99)} is VALID [2022-04-27 13:16:44,863 INFO L290 TraceCheckUtils]: 80: Hoare triple {18970#(< ~counter~0 98)} assume !(~r~0 > 0); {18970#(< ~counter~0 98)} is VALID [2022-04-27 13:16:44,864 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18581#true} {18970#(< ~counter~0 98)} #96#return; {18970#(< ~counter~0 98)} is VALID [2022-04-27 13:16:44,864 INFO L290 TraceCheckUtils]: 78: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,864 INFO L290 TraceCheckUtils]: 77: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,864 INFO L290 TraceCheckUtils]: 76: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,864 INFO L272 TraceCheckUtils]: 75: Hoare triple {18970#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,867 INFO L290 TraceCheckUtils]: 74: Hoare triple {18970#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {18970#(< ~counter~0 98)} is VALID [2022-04-27 13:16:44,868 INFO L290 TraceCheckUtils]: 73: Hoare triple {18995#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18970#(< ~counter~0 98)} is VALID [2022-04-27 13:16:44,868 INFO L290 TraceCheckUtils]: 72: Hoare triple {18995#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18995#(< ~counter~0 97)} is VALID [2022-04-27 13:16:44,868 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18581#true} {18995#(< ~counter~0 97)} #96#return; {18995#(< ~counter~0 97)} is VALID [2022-04-27 13:16:44,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,869 INFO L290 TraceCheckUtils]: 69: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,869 INFO L290 TraceCheckUtils]: 68: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,869 INFO L272 TraceCheckUtils]: 67: Hoare triple {18995#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {18995#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {18995#(< ~counter~0 97)} is VALID [2022-04-27 13:16:44,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {19020#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18995#(< ~counter~0 97)} is VALID [2022-04-27 13:16:44,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {19020#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19020#(< ~counter~0 96)} is VALID [2022-04-27 13:16:44,878 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18581#true} {19020#(< ~counter~0 96)} #96#return; {19020#(< ~counter~0 96)} is VALID [2022-04-27 13:16:44,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,878 INFO L290 TraceCheckUtils]: 61: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,878 INFO L272 TraceCheckUtils]: 59: Hoare triple {19020#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,879 INFO L290 TraceCheckUtils]: 58: Hoare triple {19020#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {19020#(< ~counter~0 96)} is VALID [2022-04-27 13:16:44,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {19045#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19020#(< ~counter~0 96)} is VALID [2022-04-27 13:16:44,879 INFO L290 TraceCheckUtils]: 56: Hoare triple {19045#(< ~counter~0 95)} assume !!(0 != ~r~0); {19045#(< ~counter~0 95)} is VALID [2022-04-27 13:16:44,880 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18581#true} {19045#(< ~counter~0 95)} #94#return; {19045#(< ~counter~0 95)} is VALID [2022-04-27 13:16:44,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,880 INFO L272 TraceCheckUtils]: 51: Hoare triple {19045#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {19045#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {19045#(< ~counter~0 95)} is VALID [2022-04-27 13:16:44,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {19070#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19045#(< ~counter~0 95)} is VALID [2022-04-27 13:16:44,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {19070#(< ~counter~0 94)} assume !(~r~0 < 0); {19070#(< ~counter~0 94)} is VALID [2022-04-27 13:16:44,882 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18581#true} {19070#(< ~counter~0 94)} #98#return; {19070#(< ~counter~0 94)} is VALID [2022-04-27 13:16:44,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,882 INFO L290 TraceCheckUtils]: 45: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,882 INFO L272 TraceCheckUtils]: 43: Hoare triple {19070#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {19070#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {19070#(< ~counter~0 94)} is VALID [2022-04-27 13:16:44,882 INFO L290 TraceCheckUtils]: 41: Hoare triple {19095#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19070#(< ~counter~0 94)} is VALID [2022-04-27 13:16:44,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {19095#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19095#(< ~counter~0 93)} is VALID [2022-04-27 13:16:44,883 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18581#true} {19095#(< ~counter~0 93)} #98#return; {19095#(< ~counter~0 93)} is VALID [2022-04-27 13:16:44,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,883 INFO L272 TraceCheckUtils]: 35: Hoare triple {19095#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {19095#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {19095#(< ~counter~0 93)} is VALID [2022-04-27 13:16:44,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {19120#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19095#(< ~counter~0 93)} is VALID [2022-04-27 13:16:44,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {19120#(< ~counter~0 92)} assume !(~r~0 > 0); {19120#(< ~counter~0 92)} is VALID [2022-04-27 13:16:44,885 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18581#true} {19120#(< ~counter~0 92)} #96#return; {19120#(< ~counter~0 92)} is VALID [2022-04-27 13:16:44,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,885 INFO L272 TraceCheckUtils]: 27: Hoare triple {19120#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {19120#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {19120#(< ~counter~0 92)} is VALID [2022-04-27 13:16:44,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {19145#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19120#(< ~counter~0 92)} is VALID [2022-04-27 13:16:44,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {19145#(< ~counter~0 91)} assume !!(0 != ~r~0); {19145#(< ~counter~0 91)} is VALID [2022-04-27 13:16:44,887 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18581#true} {19145#(< ~counter~0 91)} #94#return; {19145#(< ~counter~0 91)} is VALID [2022-04-27 13:16:44,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,887 INFO L272 TraceCheckUtils]: 19: Hoare triple {19145#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {19145#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {19145#(< ~counter~0 91)} is VALID [2022-04-27 13:16:44,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {19170#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19145#(< ~counter~0 91)} is VALID [2022-04-27 13:16:44,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {19170#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19170#(< ~counter~0 90)} is VALID [2022-04-27 13:16:44,888 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18581#true} {19170#(< ~counter~0 90)} #92#return; {19170#(< ~counter~0 90)} is VALID [2022-04-27 13:16:44,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,889 INFO L272 TraceCheckUtils]: 11: Hoare triple {19170#(< ~counter~0 90)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {18581#true} is VALID [2022-04-27 13:16:44,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18581#true} {19170#(< ~counter~0 90)} #90#return; {19170#(< ~counter~0 90)} is VALID [2022-04-27 13:16:44,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-27 13:16:44,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-27 13:16:44,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-27 13:16:44,889 INFO L272 TraceCheckUtils]: 6: Hoare triple {19170#(< ~counter~0 90)} 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:16:44,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {19170#(< ~counter~0 90)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {19170#(< ~counter~0 90)} is VALID [2022-04-27 13:16:44,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {19170#(< ~counter~0 90)} call #t~ret9 := main(); {19170#(< ~counter~0 90)} is VALID [2022-04-27 13:16:44,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19170#(< ~counter~0 90)} {18581#true} #102#return; {19170#(< ~counter~0 90)} is VALID [2022-04-27 13:16:44,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {19170#(< ~counter~0 90)} assume true; {19170#(< ~counter~0 90)} is VALID [2022-04-27 13:16:44,891 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; {19170#(< ~counter~0 90)} is VALID [2022-04-27 13:16:44,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-27 13:16:44,891 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:16:44,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:44,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002366745] [2022-04-27 13:16:44,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:44,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751010005] [2022-04-27 13:16:44,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751010005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:16:44,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:16:44,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-27 13:16:44,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409185265] [2022-04-27 13:16:44,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:16:44,892 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 103 [2022-04-27 13:16:44,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:44,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:16:45,017 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:16:45,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 13:16:45,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:45,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 13:16:45,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-27 13:16:45,018 INFO L87 Difference]: Start difference. First operand 740 states and 1001 transitions. Second operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:16:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:47,547 INFO L93 Difference]: Finished difference Result 850 states and 1161 transitions. [2022-04-27 13:16:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 13:16:47,547 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 103 [2022-04-27 13:16:47,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:16:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-27 13:16:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:16:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-27 13:16:47,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 452 transitions. [2022-04-27 13:16:47,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:47,997 INFO L225 Difference]: With dead ends: 850 [2022-04-27 13:16:47,997 INFO L226 Difference]: Without dead ends: 845 [2022-04-27 13:16:47,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=670, Invalid=1222, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 13:16:47,999 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 485 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:48,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 549 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:16:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-27 13:16:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 830. [2022-04-27 13:16:48,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:48,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2022-04-27 13:16:48,565 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2022-04-27 13:16:48,566 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2022-04-27 13:16:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:48,603 INFO L93 Difference]: Finished difference Result 845 states and 1130 transitions. [2022-04-27 13:16:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1130 transitions. [2022-04-27 13:16:48,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:48,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:48,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) Second operand 845 states. [2022-04-27 13:16:48,607 INFO L87 Difference]: Start difference. First operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) Second operand 845 states. [2022-04-27 13:16:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:48,644 INFO L93 Difference]: Finished difference Result 845 states and 1130 transitions. [2022-04-27 13:16:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1130 transitions. [2022-04-27 13:16:48,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:48,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:48,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:48,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 621 states have (on average 1.1996779388083736) internal successors, (745), 627 states have internal predecessors, (745), 184 states have call successors, (184), 26 states have call predecessors, (184), 24 states have return successors, (182), 176 states have call predecessors, (182), 182 states have call successors, (182) [2022-04-27 13:16:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1111 transitions. [2022-04-27 13:16:48,690 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1111 transitions. Word has length 103 [2022-04-27 13:16:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:48,691 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 1111 transitions. [2022-04-27 13:16:48,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.384615384615385) internal successors, (114), 26 states have internal predecessors, (114), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:16:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1111 transitions. [2022-04-27 13:16:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-27 13:16:48,695 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:48,696 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 9, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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:16:48,721 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:16:48,918 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:16:48,918 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash -599363247, now seen corresponding path program 3 times [2022-04-27 13:16:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:48,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503669757] [2022-04-27 13:16:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:48,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:48,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847572701] [2022-04-27 13:16:48,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:16:48,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:48,946 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:16:48,976 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:16:49,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 13:16:49,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:16:49,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 13:16:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:49,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:49,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {23302#true} call ULTIMATE.init(); {23302#true} is VALID [2022-04-27 13:16:49,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {23302#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23302#true} is VALID [2022-04-27 13:16:49,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23302#true} {23302#true} #102#return; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {23302#true} call #t~ret9 := main(); {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {23302#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; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L272 TraceCheckUtils]: 6: Hoare triple {23302#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23302#true} {23302#true} #90#return; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L272 TraceCheckUtils]: 11: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23302#true} {23302#true} #92#return; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {23302#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,414 INFO L272 TraceCheckUtils]: 19: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L272 TraceCheckUtils]: 27: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L290 TraceCheckUtils]: 34: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,415 INFO L272 TraceCheckUtils]: 35: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {23302#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L272 TraceCheckUtils]: 43: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 48: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 49: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 50: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L272 TraceCheckUtils]: 51: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L272 TraceCheckUtils]: 59: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 64: Hoare triple {23302#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 66: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L272 TraceCheckUtils]: 67: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,417 INFO L290 TraceCheckUtils]: 68: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 69: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 70: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 72: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 73: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 74: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L272 TraceCheckUtils]: 75: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 76: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 77: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 78: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 81: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 82: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L272 TraceCheckUtils]: 83: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,418 INFO L290 TraceCheckUtils]: 84: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 85: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 86: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 88: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 89: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 90: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L272 TraceCheckUtils]: 91: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 92: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 93: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 94: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 96: Hoare triple {23302#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 97: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 98: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L272 TraceCheckUtils]: 99: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,419 INFO L290 TraceCheckUtils]: 100: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 101: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 102: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 104: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 105: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 106: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L272 TraceCheckUtils]: 107: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 108: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 109: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 110: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 112: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 113: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 114: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L272 TraceCheckUtils]: 115: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,420 INFO L290 TraceCheckUtils]: 116: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 117: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 118: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 120: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 121: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 122: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L272 TraceCheckUtils]: 123: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 124: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 125: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 126: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 128: Hoare triple {23302#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 129: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 130: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L272 TraceCheckUtils]: 131: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,421 INFO L290 TraceCheckUtils]: 132: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 133: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 134: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 136: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 137: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 138: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L272 TraceCheckUtils]: 139: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 140: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 141: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 142: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 144: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 145: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 146: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L272 TraceCheckUtils]: 147: Hoare triple {23302#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)); {23302#true} is VALID [2022-04-27 13:16:49,422 INFO L290 TraceCheckUtils]: 148: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-27 13:16:49,423 INFO L290 TraceCheckUtils]: 149: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-27 13:16:49,423 INFO L290 TraceCheckUtils]: 150: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-27 13:16:49,423 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-27 13:16:49,423 INFO L290 TraceCheckUtils]: 152: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-27 13:16:49,423 INFO L290 TraceCheckUtils]: 153: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23766#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-27 13:16:49,424 INFO L290 TraceCheckUtils]: 154: Hoare triple {23766#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 100);havoc #t~post7; {23770#(<= 101 ~counter~0)} is VALID [2022-04-27 13:16:49,424 INFO L290 TraceCheckUtils]: 155: Hoare triple {23770#(<= 101 ~counter~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23774#(<= 102 ~counter~0)} is VALID [2022-04-27 13:16:49,425 INFO L290 TraceCheckUtils]: 156: Hoare triple {23774#(<= 102 ~counter~0)} assume !!(#t~post8 < 100);havoc #t~post8; {23774#(<= 102 ~counter~0)} is VALID [2022-04-27 13:16:49,425 INFO L272 TraceCheckUtils]: 157: Hoare triple {23774#(<= 102 ~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)); {23774#(<= 102 ~counter~0)} is VALID [2022-04-27 13:16:49,425 INFO L290 TraceCheckUtils]: 158: Hoare triple {23774#(<= 102 ~counter~0)} ~cond := #in~cond; {23774#(<= 102 ~counter~0)} is VALID [2022-04-27 13:16:49,426 INFO L290 TraceCheckUtils]: 159: Hoare triple {23774#(<= 102 ~counter~0)} assume !(0 == ~cond); {23774#(<= 102 ~counter~0)} is VALID [2022-04-27 13:16:49,426 INFO L290 TraceCheckUtils]: 160: Hoare triple {23774#(<= 102 ~counter~0)} assume true; {23774#(<= 102 ~counter~0)} is VALID [2022-04-27 13:16:49,427 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {23774#(<= 102 ~counter~0)} {23774#(<= 102 ~counter~0)} #98#return; {23774#(<= 102 ~counter~0)} is VALID [2022-04-27 13:16:49,427 INFO L290 TraceCheckUtils]: 162: Hoare triple {23774#(<= 102 ~counter~0)} assume !(~r~0 < 0); {23774#(<= 102 ~counter~0)} is VALID [2022-04-27 13:16:49,427 INFO L290 TraceCheckUtils]: 163: Hoare triple {23774#(<= 102 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23799#(<= 102 |main_#t~post6|)} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 164: Hoare triple {23799#(<= 102 |main_#t~post6|)} assume !!(#t~post6 < 100);havoc #t~post6; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L272 TraceCheckUtils]: 165: Hoare triple {23303#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)); {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 166: Hoare triple {23303#false} ~cond := #in~cond; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 167: Hoare triple {23303#false} assume !(0 == ~cond); {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 168: Hoare triple {23303#false} assume true; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {23303#false} {23303#false} #94#return; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 170: Hoare triple {23303#false} assume !!(0 != ~r~0); {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 171: Hoare triple {23303#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 172: Hoare triple {23303#false} assume !(#t~post7 < 100);havoc #t~post7; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 173: Hoare triple {23303#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 174: Hoare triple {23303#false} assume !(#t~post8 < 100);havoc #t~post8; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 175: Hoare triple {23303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 176: Hoare triple {23303#false} assume !(#t~post6 < 100);havoc #t~post6; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L272 TraceCheckUtils]: 177: Hoare triple {23303#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 178: Hoare triple {23303#false} ~cond := #in~cond; {23303#false} is VALID [2022-04-27 13:16:49,428 INFO L290 TraceCheckUtils]: 179: Hoare triple {23303#false} assume 0 == ~cond; {23303#false} is VALID [2022-04-27 13:16:49,429 INFO L290 TraceCheckUtils]: 180: Hoare triple {23303#false} assume !false; {23303#false} is VALID [2022-04-27 13:16:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2022-04-27 13:16:49,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503669757] [2022-04-27 13:16:49,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:49,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847572701] [2022-04-27 13:16:49,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847572701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:49,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:49,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:16:49,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527999852] [2022-04-27 13:16:49,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:49,430 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 181 [2022-04-27 13:16:49,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:49,431 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:16:49,479 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:16:49,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:16:49,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:49,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:16:49,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:16:49,480 INFO L87 Difference]: Start difference. First operand 830 states and 1111 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:16:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:50,523 INFO L93 Difference]: Finished difference Result 1103 states and 1482 transitions. [2022-04-27 13:16:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:16:50,523 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 181 [2022-04-27 13:16:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:50,523 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:16:50,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 13:16:50,524 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:16:50,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-27 13:16:50,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-27 13:16:50,594 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:16:50,643 INFO L225 Difference]: With dead ends: 1103 [2022-04-27 13:16:50,644 INFO L226 Difference]: Without dead ends: 896 [2022-04-27 13:16:50,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 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:16:50,648 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:16:50,648 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:16:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-04-27 13:16:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 861. [2022-04-27 13:16:51,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:51,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 896 states. Second operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:16:51,250 INFO L74 IsIncluded]: Start isIncluded. First operand 896 states. Second operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:16:51,251 INFO L87 Difference]: Start difference. First operand 896 states. Second operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:16:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:51,293 INFO L93 Difference]: Finished difference Result 896 states and 1170 transitions. [2022-04-27 13:16:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1170 transitions. [2022-04-27 13:16:51,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:51,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:51,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) Second operand 896 states. [2022-04-27 13:16:51,298 INFO L87 Difference]: Start difference. First operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) Second operand 896 states. [2022-04-27 13:16:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:51,336 INFO L93 Difference]: Finished difference Result 896 states and 1170 transitions. [2022-04-27 13:16:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1170 transitions. [2022-04-27 13:16:51,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:51,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:51,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:51,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 645 states have (on average 1.1767441860465115) internal successors, (759), 652 states have internal predecessors, (759), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 177 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:16:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1129 transitions. [2022-04-27 13:16:51,385 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1129 transitions. Word has length 181 [2022-04-27 13:16:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:51,385 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 1129 transitions. [2022-04-27 13:16:51,385 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:16:51,385 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1129 transitions. [2022-04-27 13:16:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:16:51,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:51,389 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 9, 8, 8, 8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 3, 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:51,413 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:16:51,609 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:16:51,610 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:51,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:51,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1408642227, now seen corresponding path program 4 times [2022-04-27 13:16:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:51,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281167211] [2022-04-27 13:16:51,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:51,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:51,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:51,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [468002260] [2022-04-27 13:16:51,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 13:16:51,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:51,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:51,639 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:16:51,643 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:16:51,732 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 13:16:51,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:16:51,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-27 13:16:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:51,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:52,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {28385#true} call ULTIMATE.init(); {28385#true} is VALID [2022-04-27 13:16:52,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {28385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28385#true} is VALID [2022-04-27 13:16:52,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28385#true} {28385#true} #102#return; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {28385#true} call #t~ret9 := main(); {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {28385#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; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L272 TraceCheckUtils]: 6: Hoare triple {28385#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28385#true} {28385#true} #90#return; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L272 TraceCheckUtils]: 11: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28385#true} {28385#true} #92#return; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {28385#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {28385#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28385#true} is VALID [2022-04-27 13:16:52,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {28385#true} assume !!(#t~post6 < 100);havoc #t~post6; {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L272 TraceCheckUtils]: 19: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28385#true} {28385#true} #94#return; {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {28385#true} assume !!(0 != ~r~0); {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {28385#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {28385#true} assume !!(#t~post7 < 100);havoc #t~post7; {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L272 TraceCheckUtils]: 27: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28385#true} {28385#true} #96#return; {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {28385#true} assume !(~r~0 > 0); {28385#true} is VALID [2022-04-27 13:16:52,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {28385#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {28385#true} assume !!(#t~post8 < 100);havoc #t~post8; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L272 TraceCheckUtils]: 35: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28385#true} {28385#true} #98#return; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 40: Hoare triple {28385#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 41: Hoare triple {28385#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {28385#true} assume !!(#t~post8 < 100);havoc #t~post8; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L272 TraceCheckUtils]: 43: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28385#true} {28385#true} #98#return; {28385#true} is VALID [2022-04-27 13:16:52,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {28385#true} assume !(~r~0 < 0); {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {28385#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {28385#true} assume !!(#t~post6 < 100);havoc #t~post6; {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L272 TraceCheckUtils]: 51: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28385#true} {28385#true} #94#return; {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {28385#true} assume !!(0 != ~r~0); {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {28385#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 58: Hoare triple {28385#true} assume !!(#t~post7 < 100);havoc #t~post7; {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L272 TraceCheckUtils]: 59: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 60: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L290 TraceCheckUtils]: 62: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,092 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28385#true} {28385#true} #96#return; {28385#true} is VALID [2022-04-27 13:16:52,093 INFO L290 TraceCheckUtils]: 64: Hoare triple {28385#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28385#true} is VALID [2022-04-27 13:16:52,093 INFO L290 TraceCheckUtils]: 65: Hoare triple {28385#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28385#true} is VALID [2022-04-27 13:16:52,093 INFO L290 TraceCheckUtils]: 66: Hoare triple {28385#true} assume !!(#t~post7 < 100);havoc #t~post7; {28385#true} is VALID [2022-04-27 13:16:52,093 INFO L272 TraceCheckUtils]: 67: Hoare triple {28385#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)); {28385#true} is VALID [2022-04-27 13:16:52,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,093 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28385#true} {28385#true} #96#return; {28385#true} is VALID [2022-04-27 13:16:52,093 INFO L290 TraceCheckUtils]: 72: Hoare triple {28385#true} assume !(~r~0 > 0); {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,094 INFO L290 TraceCheckUtils]: 73: Hoare triple {28606#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,094 INFO L290 TraceCheckUtils]: 74: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,094 INFO L272 TraceCheckUtils]: 75: Hoare triple {28606#(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)); {28385#true} is VALID [2022-04-27 13:16:52,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,094 INFO L290 TraceCheckUtils]: 77: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,094 INFO L290 TraceCheckUtils]: 78: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,095 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {28385#true} {28606#(not (< 0 main_~r~0))} #98#return; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,095 INFO L290 TraceCheckUtils]: 80: Hoare triple {28606#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,095 INFO L290 TraceCheckUtils]: 81: Hoare triple {28606#(not (< 0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,096 INFO L290 TraceCheckUtils]: 82: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,096 INFO L272 TraceCheckUtils]: 83: Hoare triple {28606#(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)); {28385#true} is VALID [2022-04-27 13:16:52,096 INFO L290 TraceCheckUtils]: 84: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,096 INFO L290 TraceCheckUtils]: 85: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,096 INFO L290 TraceCheckUtils]: 86: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,096 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {28385#true} {28606#(not (< 0 main_~r~0))} #94#return; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,097 INFO L290 TraceCheckUtils]: 88: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(0 != ~r~0); {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,097 INFO L290 TraceCheckUtils]: 89: Hoare triple {28606#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,097 INFO L290 TraceCheckUtils]: 90: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,097 INFO L272 TraceCheckUtils]: 91: Hoare triple {28606#(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)); {28385#true} is VALID [2022-04-27 13:16:52,097 INFO L290 TraceCheckUtils]: 92: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-27 13:16:52,097 INFO L290 TraceCheckUtils]: 93: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-27 13:16:52,097 INFO L290 TraceCheckUtils]: 94: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-27 13:16:52,098 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {28385#true} {28606#(not (< 0 main_~r~0))} #96#return; {28606#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:52,098 INFO L290 TraceCheckUtils]: 96: Hoare triple {28606#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28386#false} is VALID [2022-04-27 13:16:52,098 INFO L290 TraceCheckUtils]: 97: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,098 INFO L290 TraceCheckUtils]: 98: Hoare triple {28386#false} assume !!(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,098 INFO L272 TraceCheckUtils]: 99: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,098 INFO L290 TraceCheckUtils]: 100: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 101: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 102: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 104: Hoare triple {28386#false} assume !(~r~0 > 0); {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 105: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 106: Hoare triple {28386#false} assume !!(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L272 TraceCheckUtils]: 107: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 108: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 109: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 110: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 112: Hoare triple {28386#false} assume !(~r~0 < 0); {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 113: Hoare triple {28386#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L290 TraceCheckUtils]: 114: Hoare triple {28386#false} assume !!(#t~post6 < 100);havoc #t~post6; {28386#false} is VALID [2022-04-27 13:16:52,099 INFO L272 TraceCheckUtils]: 115: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 116: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 117: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 118: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {28386#false} {28386#false} #94#return; {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 120: Hoare triple {28386#false} assume !!(0 != ~r~0); {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 121: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 122: Hoare triple {28386#false} assume !!(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L272 TraceCheckUtils]: 123: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 124: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 125: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 126: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 128: Hoare triple {28386#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28386#false} is VALID [2022-04-27 13:16:52,100 INFO L290 TraceCheckUtils]: 129: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,101 INFO L290 TraceCheckUtils]: 130: Hoare triple {28386#false} assume !!(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,101 INFO L272 TraceCheckUtils]: 131: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,101 INFO L290 TraceCheckUtils]: 132: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,101 INFO L290 TraceCheckUtils]: 133: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,101 INFO L290 TraceCheckUtils]: 134: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,101 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-27 13:16:52,101 INFO L290 TraceCheckUtils]: 136: Hoare triple {28386#false} assume !(~r~0 > 0); {28386#false} is VALID [2022-04-27 13:16:52,101 INFO L290 TraceCheckUtils]: 137: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,101 INFO L290 TraceCheckUtils]: 138: Hoare triple {28386#false} assume !!(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L272 TraceCheckUtils]: 139: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 140: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 141: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 142: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 144: Hoare triple {28386#false} assume !(~r~0 < 0); {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 145: Hoare triple {28386#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 146: Hoare triple {28386#false} assume !!(#t~post6 < 100);havoc #t~post6; {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L272 TraceCheckUtils]: 147: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 148: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 149: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 150: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {28386#false} {28386#false} #94#return; {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 152: Hoare triple {28386#false} assume !!(0 != ~r~0); {28386#false} is VALID [2022-04-27 13:16:52,102 INFO L290 TraceCheckUtils]: 153: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 154: Hoare triple {28386#false} assume !!(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L272 TraceCheckUtils]: 155: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 156: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 157: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 158: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 160: Hoare triple {28386#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 161: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 162: Hoare triple {28386#false} assume !(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 163: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 164: Hoare triple {28386#false} assume !!(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L272 TraceCheckUtils]: 165: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 166: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,103 INFO L290 TraceCheckUtils]: 167: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 168: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 170: Hoare triple {28386#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 171: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 172: Hoare triple {28386#false} assume !!(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L272 TraceCheckUtils]: 173: Hoare triple {28386#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)); {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 174: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 175: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 176: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 178: Hoare triple {28386#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 179: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 180: Hoare triple {28386#false} assume !(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 181: Hoare triple {28386#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28386#false} is VALID [2022-04-27 13:16:52,104 INFO L290 TraceCheckUtils]: 182: Hoare triple {28386#false} assume !(#t~post6 < 100);havoc #t~post6; {28386#false} is VALID [2022-04-27 13:16:52,105 INFO L272 TraceCheckUtils]: 183: Hoare triple {28386#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {28386#false} is VALID [2022-04-27 13:16:52,105 INFO L290 TraceCheckUtils]: 184: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-27 13:16:52,105 INFO L290 TraceCheckUtils]: 185: Hoare triple {28386#false} assume 0 == ~cond; {28386#false} is VALID [2022-04-27 13:16:52,105 INFO L290 TraceCheckUtils]: 186: Hoare triple {28386#false} assume !false; {28386#false} is VALID [2022-04-27 13:16:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2022-04-27 13:16:52,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:52,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:52,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281167211] [2022-04-27 13:16:52,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:52,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468002260] [2022-04-27 13:16:52,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468002260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:52,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:52,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:16:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807766053] [2022-04-27 13:16:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:52,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 187 [2022-04-27 13:16:52,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:52,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:16:52,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:52,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:16:52,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:52,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:16:52,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:16:52,162 INFO L87 Difference]: Start difference. First operand 861 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:16:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:53,210 INFO L93 Difference]: Finished difference Result 1462 states and 1917 transitions. [2022-04-27 13:16:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:16:53,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 187 [2022-04-27 13:16:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:16:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-27 13:16:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:16:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-27 13:16:53,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-04-27 13:16:53,281 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:16:53,333 INFO L225 Difference]: With dead ends: 1462 [2022-04-27 13:16:53,333 INFO L226 Difference]: Without dead ends: 919 [2022-04-27 13:16:53,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 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:16:53,335 INFO L413 NwaCegarLoop]: 50 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, 81 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:16:53,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 81 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-04-27 13:16:53,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 867. [2022-04-27 13:16:53,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:53,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 919 states. Second operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:16:53,942 INFO L74 IsIncluded]: Start isIncluded. First operand 919 states. Second operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:16:53,942 INFO L87 Difference]: Start difference. First operand 919 states. Second operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:16:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:53,988 INFO L93 Difference]: Finished difference Result 919 states and 1203 transitions. [2022-04-27 13:16:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1203 transitions. [2022-04-27 13:16:53,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:53,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:53,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) Second operand 919 states. [2022-04-27 13:16:54,001 INFO L87 Difference]: Start difference. First operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) Second operand 919 states. [2022-04-27 13:16:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:54,041 INFO L93 Difference]: Finished difference Result 919 states and 1203 transitions. [2022-04-27 13:16:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1203 transitions. [2022-04-27 13:16:54,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:54,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:54,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:54,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 651 states have (on average 1.1751152073732718) internal successors, (765), 660 states have internal predecessors, (765), 186 states have call successors, (186), 31 states have call predecessors, (186), 29 states have return successors, (184), 175 states have call predecessors, (184), 184 states have call successors, (184) [2022-04-27 13:16:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1135 transitions. [2022-04-27 13:16:54,091 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1135 transitions. Word has length 187 [2022-04-27 13:16:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:54,091 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1135 transitions. [2022-04-27 13:16:54,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:16:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1135 transitions. [2022-04-27 13:16:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:16:54,095 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:54,095 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 10, 9, 9, 9, 8, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 3, 3, 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:54,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-27 13:16:54,313 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:16:54,313 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash -464040263, now seen corresponding path program 5 times [2022-04-27 13:16:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:54,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119575425] [2022-04-27 13:16:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:54,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:54,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442106934] [2022-04-27 13:16:54,339 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 13:16:54,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:54,340 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:16:54,341 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:16:54,686 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-04-27 13:16:54,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:16:54,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 13:16:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:54,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:55,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {34032#true} call ULTIMATE.init(); {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {34032#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34032#true} {34032#true} #102#return; {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {34032#true} call #t~ret9 := main(); {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {34032#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; {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {34032#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34032#true} {34032#true} #90#return; {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34032#true} {34032#true} #92#return; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {34032#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {34032#true} assume !!(#t~post6 < 100);havoc #t~post6; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L272 TraceCheckUtils]: 19: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L272 TraceCheckUtils]: 27: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {34032#true} assume !(~r~0 > 0); {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,069 INFO L272 TraceCheckUtils]: 35: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {34032#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L272 TraceCheckUtils]: 43: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 48: Hoare triple {34032#true} assume !(~r~0 < 0); {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {34032#true} assume !!(#t~post6 < 100);havoc #t~post6; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L272 TraceCheckUtils]: 51: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,070 INFO L290 TraceCheckUtils]: 58: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L272 TraceCheckUtils]: 59: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 62: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {34032#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L272 TraceCheckUtils]: 67: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 68: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 69: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 70: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:16:55,071 INFO L290 TraceCheckUtils]: 72: Hoare triple {34032#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 73: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 74: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L272 TraceCheckUtils]: 75: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 76: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 77: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 78: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 80: Hoare triple {34032#true} assume !(~r~0 > 0); {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 81: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 82: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L272 TraceCheckUtils]: 83: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 84: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,072 INFO L290 TraceCheckUtils]: 85: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 86: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 88: Hoare triple {34032#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 89: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 90: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L272 TraceCheckUtils]: 91: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 92: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 93: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 94: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 96: Hoare triple {34032#true} assume !(~r~0 < 0); {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 97: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L290 TraceCheckUtils]: 98: Hoare triple {34032#true} assume !!(#t~post6 < 100);havoc #t~post6; {34032#true} is VALID [2022-04-27 13:16:55,073 INFO L272 TraceCheckUtils]: 99: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 100: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 101: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 102: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 104: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 105: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 106: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L272 TraceCheckUtils]: 107: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 108: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 109: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 110: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 112: Hoare triple {34032#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 113: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,074 INFO L290 TraceCheckUtils]: 114: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L272 TraceCheckUtils]: 115: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 116: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 117: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 118: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 120: Hoare triple {34032#true} assume !(~r~0 > 0); {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 121: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 122: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L272 TraceCheckUtils]: 123: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 124: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 125: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 126: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:16:55,075 INFO L290 TraceCheckUtils]: 128: Hoare triple {34032#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 129: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 130: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L272 TraceCheckUtils]: 131: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 132: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 133: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 134: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 136: Hoare triple {34032#true} assume !(~r~0 < 0); {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 137: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 138: Hoare triple {34032#true} assume !!(#t~post6 < 100);havoc #t~post6; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L272 TraceCheckUtils]: 139: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 140: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 141: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L290 TraceCheckUtils]: 142: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,076 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-27 13:16:55,077 INFO L290 TraceCheckUtils]: 144: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-27 13:16:55,077 INFO L290 TraceCheckUtils]: 145: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,077 INFO L290 TraceCheckUtils]: 146: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-27 13:16:55,077 INFO L272 TraceCheckUtils]: 147: Hoare triple {34032#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)); {34032#true} is VALID [2022-04-27 13:16:55,077 INFO L290 TraceCheckUtils]: 148: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-27 13:16:55,077 INFO L290 TraceCheckUtils]: 149: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-27 13:16:55,077 INFO L290 TraceCheckUtils]: 150: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-27 13:16:55,077 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-27 13:16:55,077 INFO L290 TraceCheckUtils]: 152: Hoare triple {34032#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {34032#true} is VALID [2022-04-27 13:16:55,079 INFO L290 TraceCheckUtils]: 153: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34496#(<= (+ |main_#t~post7| 1) ~counter~0)} is VALID [2022-04-27 13:16:55,080 INFO L290 TraceCheckUtils]: 154: Hoare triple {34496#(<= (+ |main_#t~post7| 1) ~counter~0)} assume !(#t~post7 < 100);havoc #t~post7; {34500#(<= 101 ~counter~0)} is VALID [2022-04-27 13:16:55,080 INFO L290 TraceCheckUtils]: 155: Hoare triple {34500#(<= 101 ~counter~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34504#(<= 101 |main_#t~post8|)} is VALID [2022-04-27 13:16:55,081 INFO L290 TraceCheckUtils]: 156: Hoare triple {34504#(<= 101 |main_#t~post8|)} assume !!(#t~post8 < 100);havoc #t~post8; {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L272 TraceCheckUtils]: 157: Hoare triple {34033#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)); {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L290 TraceCheckUtils]: 158: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L290 TraceCheckUtils]: 159: Hoare triple {34033#false} assume !(0 == ~cond); {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L290 TraceCheckUtils]: 160: Hoare triple {34033#false} assume true; {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {34033#false} {34033#false} #98#return; {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L290 TraceCheckUtils]: 162: Hoare triple {34033#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L290 TraceCheckUtils]: 163: Hoare triple {34033#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L290 TraceCheckUtils]: 164: Hoare triple {34033#false} assume !!(#t~post8 < 100);havoc #t~post8; {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L272 TraceCheckUtils]: 165: Hoare triple {34033#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)); {34033#false} is VALID [2022-04-27 13:16:55,081 INFO L290 TraceCheckUtils]: 166: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 167: Hoare triple {34033#false} assume !(0 == ~cond); {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 168: Hoare triple {34033#false} assume true; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {34033#false} {34033#false} #98#return; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 170: Hoare triple {34033#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 171: Hoare triple {34033#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 172: Hoare triple {34033#false} assume !!(#t~post8 < 100);havoc #t~post8; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L272 TraceCheckUtils]: 173: Hoare triple {34033#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)); {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 174: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 175: Hoare triple {34033#false} assume !(0 == ~cond); {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 176: Hoare triple {34033#false} assume true; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {34033#false} {34033#false} #98#return; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 178: Hoare triple {34033#false} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 179: Hoare triple {34033#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 180: Hoare triple {34033#false} assume !(#t~post8 < 100);havoc #t~post8; {34033#false} is VALID [2022-04-27 13:16:55,082 INFO L290 TraceCheckUtils]: 181: Hoare triple {34033#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34033#false} is VALID [2022-04-27 13:16:55,083 INFO L290 TraceCheckUtils]: 182: Hoare triple {34033#false} assume !(#t~post6 < 100);havoc #t~post6; {34033#false} is VALID [2022-04-27 13:16:55,083 INFO L272 TraceCheckUtils]: 183: Hoare triple {34033#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34033#false} is VALID [2022-04-27 13:16:55,083 INFO L290 TraceCheckUtils]: 184: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-27 13:16:55,083 INFO L290 TraceCheckUtils]: 185: Hoare triple {34033#false} assume 0 == ~cond; {34033#false} is VALID [2022-04-27 13:16:55,083 INFO L290 TraceCheckUtils]: 186: Hoare triple {34033#false} assume !false; {34033#false} is VALID [2022-04-27 13:16:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2022-04-27 13:16:55,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:55,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:55,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119575425] [2022-04-27 13:16:55,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:55,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442106934] [2022-04-27 13:16:55,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442106934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:55,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:55,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:16:55,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344865350] [2022-04-27 13:16:55,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:55,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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 187 [2022-04-27 13:16:55,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:55,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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:16:55,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:55,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:16:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:55,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:16:55,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:16:55,124 INFO L87 Difference]: Start difference. First operand 867 states and 1135 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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:16:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:55,858 INFO L93 Difference]: Finished difference Result 887 states and 1154 transitions. [2022-04-27 13:16:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:16:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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 187 [2022-04-27 13:16:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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:16:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 13:16:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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:16:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 13:16:55,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 13:16:55,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:55,964 INFO L225 Difference]: With dead ends: 887 [2022-04-27 13:16:55,964 INFO L226 Difference]: Without dead ends: 831 [2022-04-27 13:16:55,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 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:16:55,965 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:55,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 143 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-04-27 13:16:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 806. [2022-04-27 13:16:56,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:56,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 831 states. Second operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:16:56,546 INFO L74 IsIncluded]: Start isIncluded. First operand 831 states. Second operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:16:56,547 INFO L87 Difference]: Start difference. First operand 831 states. Second operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:16:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:56,579 INFO L93 Difference]: Finished difference Result 831 states and 1088 transitions. [2022-04-27 13:16:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1088 transitions. [2022-04-27 13:16:56,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:56,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:56,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) Second operand 831 states. [2022-04-27 13:16:56,585 INFO L87 Difference]: Start difference. First operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) Second operand 831 states. [2022-04-27 13:16:56,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:56,616 INFO L93 Difference]: Finished difference Result 831 states and 1088 transitions. [2022-04-27 13:16:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1088 transitions. [2022-04-27 13:16:56,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:56,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:56,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:56,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 604 states have (on average 1.1688741721854305) internal successors, (706), 612 states have internal predecessors, (706), 177 states have call successors, (177), 26 states have call predecessors, (177), 24 states have return successors, (175), 167 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-27 13:16:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1058 transitions. [2022-04-27 13:16:56,661 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1058 transitions. Word has length 187 [2022-04-27 13:16:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:56,661 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1058 transitions. [2022-04-27 13:16:56,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 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:16:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1058 transitions. [2022-04-27 13:16:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:16:56,665 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:56,665 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 9, 8, 8, 8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 4, 3, 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:56,673 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:16:56,871 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:16:56,872 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:56,872 INFO L85 PathProgramCache]: Analyzing trace with hash 372440269, now seen corresponding path program 6 times [2022-04-27 13:16:56,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:56,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055086135] [2022-04-27 13:16:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:56,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:56,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1442606126] [2022-04-27 13:16:56,896 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 13:16:56,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:56,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:56,897 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:16:56,899 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:16:57,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 13:16:57,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:16:57,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 13:16:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:57,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:16:57,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {38618#true} call ULTIMATE.init(); {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {38618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38618#true} {38618#true} #102#return; {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {38618#true} call #t~ret9 := main(); {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {38618#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; {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {38618#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38618#true} {38618#true} #90#return; {38618#true} is VALID [2022-04-27 13:16:57,472 INFO L272 TraceCheckUtils]: 11: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38618#true} {38618#true} #92#return; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {38618#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {38618#true} assume !!(#t~post6 < 100);havoc #t~post6; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L272 TraceCheckUtils]: 19: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L272 TraceCheckUtils]: 27: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:16:57,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {38618#true} assume !(~r~0 > 0); {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L272 TraceCheckUtils]: 35: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 40: Hoare triple {38618#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 41: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 42: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L272 TraceCheckUtils]: 43: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 45: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 46: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {38618#true} assume !(~r~0 < 0); {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {38618#true} assume !!(#t~post6 < 100);havoc #t~post6; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L272 TraceCheckUtils]: 51: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L272 TraceCheckUtils]: 59: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 64: Hoare triple {38618#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 65: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 66: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L272 TraceCheckUtils]: 67: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {38618#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 73: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 74: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L272 TraceCheckUtils]: 75: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,475 INFO L290 TraceCheckUtils]: 76: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 77: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 78: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 80: Hoare triple {38618#true} assume !(~r~0 > 0); {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 81: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 82: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L272 TraceCheckUtils]: 83: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 84: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 85: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 86: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 88: Hoare triple {38618#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 89: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 90: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L272 TraceCheckUtils]: 91: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 92: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 93: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 94: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 96: Hoare triple {38618#true} assume !(~r~0 < 0); {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 97: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L290 TraceCheckUtils]: 98: Hoare triple {38618#true} assume !!(#t~post6 < 100);havoc #t~post6; {38618#true} is VALID [2022-04-27 13:16:57,476 INFO L272 TraceCheckUtils]: 99: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 100: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 101: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 102: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 104: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 105: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 106: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L272 TraceCheckUtils]: 107: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 108: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 109: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 110: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:16:57,477 INFO L290 TraceCheckUtils]: 112: Hoare triple {38618#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L290 TraceCheckUtils]: 113: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L290 TraceCheckUtils]: 114: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L272 TraceCheckUtils]: 115: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L290 TraceCheckUtils]: 116: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L290 TraceCheckUtils]: 117: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L290 TraceCheckUtils]: 118: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L290 TraceCheckUtils]: 120: Hoare triple {38618#true} assume !(~r~0 > 0); {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L290 TraceCheckUtils]: 121: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L290 TraceCheckUtils]: 122: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L272 TraceCheckUtils]: 123: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,478 INFO L290 TraceCheckUtils]: 124: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L290 TraceCheckUtils]: 125: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L290 TraceCheckUtils]: 126: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L290 TraceCheckUtils]: 128: Hoare triple {38618#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L290 TraceCheckUtils]: 129: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L290 TraceCheckUtils]: 130: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L272 TraceCheckUtils]: 131: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L290 TraceCheckUtils]: 132: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L290 TraceCheckUtils]: 133: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L290 TraceCheckUtils]: 134: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-27 13:16:57,479 INFO L290 TraceCheckUtils]: 136: Hoare triple {38618#true} assume !(~r~0 < 0); {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L290 TraceCheckUtils]: 137: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L290 TraceCheckUtils]: 138: Hoare triple {38618#true} assume !!(#t~post6 < 100);havoc #t~post6; {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L272 TraceCheckUtils]: 139: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L290 TraceCheckUtils]: 140: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L290 TraceCheckUtils]: 141: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L290 TraceCheckUtils]: 142: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L290 TraceCheckUtils]: 144: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L290 TraceCheckUtils]: 145: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L290 TraceCheckUtils]: 146: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L272 TraceCheckUtils]: 147: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,480 INFO L290 TraceCheckUtils]: 148: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L290 TraceCheckUtils]: 149: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L290 TraceCheckUtils]: 150: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L290 TraceCheckUtils]: 152: Hoare triple {38618#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L290 TraceCheckUtils]: 153: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L290 TraceCheckUtils]: 154: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L272 TraceCheckUtils]: 155: Hoare triple {38618#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)); {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L290 TraceCheckUtils]: 156: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L290 TraceCheckUtils]: 157: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L290 TraceCheckUtils]: 158: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,481 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-27 13:16:57,483 INFO L290 TraceCheckUtils]: 160: Hoare triple {38618#true} assume !(~r~0 > 0); {39103#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:57,483 INFO L290 TraceCheckUtils]: 161: Hoare triple {39103#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {39103#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:57,484 INFO L290 TraceCheckUtils]: 162: Hoare triple {39103#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {39103#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:57,484 INFO L272 TraceCheckUtils]: 163: Hoare triple {39103#(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)); {38618#true} is VALID [2022-04-27 13:16:57,484 INFO L290 TraceCheckUtils]: 164: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,484 INFO L290 TraceCheckUtils]: 165: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,484 INFO L290 TraceCheckUtils]: 166: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,484 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {38618#true} {39103#(not (< 0 main_~r~0))} #98#return; {39103#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:16:57,485 INFO L290 TraceCheckUtils]: 168: Hoare triple {39103#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:16:57,485 INFO L290 TraceCheckUtils]: 169: Hoare triple {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:16:57,486 INFO L290 TraceCheckUtils]: 170: Hoare triple {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 100);havoc #t~post6; {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:16:57,486 INFO L272 TraceCheckUtils]: 171: Hoare triple {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38618#true} is VALID [2022-04-27 13:16:57,486 INFO L290 TraceCheckUtils]: 172: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-27 13:16:57,486 INFO L290 TraceCheckUtils]: 173: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-27 13:16:57,486 INFO L290 TraceCheckUtils]: 174: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-27 13:16:57,486 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {38618#true} {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:16:57,487 INFO L290 TraceCheckUtils]: 176: Hoare triple {39128#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {38619#false} is VALID [2022-04-27 13:16:57,487 INFO L290 TraceCheckUtils]: 177: Hoare triple {38619#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38619#false} is VALID [2022-04-27 13:16:57,487 INFO L290 TraceCheckUtils]: 178: Hoare triple {38619#false} assume !(#t~post7 < 100);havoc #t~post7; {38619#false} is VALID [2022-04-27 13:16:57,487 INFO L290 TraceCheckUtils]: 179: Hoare triple {38619#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38619#false} is VALID [2022-04-27 13:16:57,487 INFO L290 TraceCheckUtils]: 180: Hoare triple {38619#false} assume !(#t~post8 < 100);havoc #t~post8; {38619#false} is VALID [2022-04-27 13:16:57,487 INFO L290 TraceCheckUtils]: 181: Hoare triple {38619#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38619#false} is VALID [2022-04-27 13:16:57,487 INFO L290 TraceCheckUtils]: 182: Hoare triple {38619#false} assume !(#t~post6 < 100);havoc #t~post6; {38619#false} is VALID [2022-04-27 13:16:57,487 INFO L272 TraceCheckUtils]: 183: Hoare triple {38619#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38619#false} is VALID [2022-04-27 13:16:57,487 INFO L290 TraceCheckUtils]: 184: Hoare triple {38619#false} ~cond := #in~cond; {38619#false} is VALID [2022-04-27 13:16:57,488 INFO L290 TraceCheckUtils]: 185: Hoare triple {38619#false} assume 0 == ~cond; {38619#false} is VALID [2022-04-27 13:16:57,488 INFO L290 TraceCheckUtils]: 186: Hoare triple {38619#false} assume !false; {38619#false} is VALID [2022-04-27 13:16:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2022-04-27 13:16:57,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:16:57,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:16:57,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055086135] [2022-04-27 13:16:57,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:16:57,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442606126] [2022-04-27 13:16:57,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442606126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:16:57,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:16:57,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:16:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196105134] [2022-04-27 13:16:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:16:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 187 [2022-04-27 13:16:57,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:16:57,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:16:57,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:16:57,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:16:57,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:16:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:16:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:16:57,530 INFO L87 Difference]: Start difference. First operand 806 states and 1058 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:16:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:58,250 INFO L93 Difference]: Finished difference Result 853 states and 1107 transitions. [2022-04-27 13:16:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:16:58,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 187 [2022-04-27 13:16:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:16:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:16:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 13:16:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:16:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 13:16:58,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-27 13:16:58,326 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:16:58,361 INFO L225 Difference]: With dead ends: 853 [2022-04-27 13:16:58,362 INFO L226 Difference]: Without dead ends: 782 [2022-04-27 13:16:58,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 184 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:16:58,363 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:16:58,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:16:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-04-27 13:16:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 755. [2022-04-27 13:16:58,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:16:58,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 782 states. Second operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:16:58,960 INFO L74 IsIncluded]: Start isIncluded. First operand 782 states. Second operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:16:58,961 INFO L87 Difference]: Start difference. First operand 782 states. Second operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:16:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:58,991 INFO L93 Difference]: Finished difference Result 782 states and 1016 transitions. [2022-04-27 13:16:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1016 transitions. [2022-04-27 13:16:58,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:58,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:58,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) Second operand 782 states. [2022-04-27 13:16:58,995 INFO L87 Difference]: Start difference. First operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) Second operand 782 states. [2022-04-27 13:16:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:16:59,025 INFO L93 Difference]: Finished difference Result 782 states and 1016 transitions. [2022-04-27 13:16:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1016 transitions. [2022-04-27 13:16:59,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:16:59,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:16:59,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:16:59,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:16:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 566 states have (on average 1.1625441696113075) internal successors, (658), 573 states have internal predecessors, (658), 164 states have call successors, (164), 26 states have call predecessors, (164), 24 states have return successors, (162), 155 states have call predecessors, (162), 162 states have call successors, (162) [2022-04-27 13:16:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 984 transitions. [2022-04-27 13:16:59,060 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 984 transitions. Word has length 187 [2022-04-27 13:16:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:16:59,060 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 984 transitions. [2022-04-27 13:16:59,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-27 13:16:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 984 transitions. [2022-04-27 13:16:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:16:59,063 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:16:59,064 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:16:59,068 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:16:59,279 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:16:59,279 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:16:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:16:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -288806385, now seen corresponding path program 7 times [2022-04-27 13:16:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:16:59,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291451695] [2022-04-27 13:16:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:16:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:16:59,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:16:59,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321454246] [2022-04-27 13:16:59,338 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 13:16:59,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:16:59,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:16:59,348 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:16:59,381 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:16:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 13:16:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:16:59,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:00,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {42989#true} call ULTIMATE.init(); {42989#true} is VALID [2022-04-27 13:17:00,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {42989#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42989#true} is VALID [2022-04-27 13:17:00,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42989#true} {42989#true} #102#return; {42989#true} is VALID [2022-04-27 13:17:00,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {42989#true} call #t~ret9 := main(); {42989#true} is VALID [2022-04-27 13:17:00,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {42989#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; {42989#true} is VALID [2022-04-27 13:17:00,104 INFO L272 TraceCheckUtils]: 6: Hoare triple {42989#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:00,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,105 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42989#true} {42989#true} #90#return; {42989#true} is VALID [2022-04-27 13:17:00,105 INFO L272 TraceCheckUtils]: 11: Hoare triple {42989#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)); {42989#true} is VALID [2022-04-27 13:17:00,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,105 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42989#true} {42989#true} #92#return; {42989#true} is VALID [2022-04-27 13:17:00,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {42989#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {43042#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,106 INFO L272 TraceCheckUtils]: 19: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,106 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {43042#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,107 INFO L272 TraceCheckUtils]: 27: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,108 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 > 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {43042#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,108 INFO L272 TraceCheckUtils]: 35: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,109 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,109 INFO L290 TraceCheckUtils]: 40: Hoare triple {43042#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,110 INFO L290 TraceCheckUtils]: 41: Hoare triple {43042#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,110 INFO L272 TraceCheckUtils]: 43: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,110 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 < 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {43042#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,111 INFO L272 TraceCheckUtils]: 51: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,112 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {43042#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,113 INFO L272 TraceCheckUtils]: 59: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,113 INFO L290 TraceCheckUtils]: 61: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,113 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,114 INFO L290 TraceCheckUtils]: 64: Hoare triple {43042#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:00,114 INFO L290 TraceCheckUtils]: 65: Hoare triple {43187#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:00,114 INFO L290 TraceCheckUtils]: 66: Hoare triple {43187#(<= main_~v~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:00,114 INFO L272 TraceCheckUtils]: 67: Hoare triple {43187#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,114 INFO L290 TraceCheckUtils]: 68: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,115 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42989#true} {43187#(<= main_~v~0 3)} #96#return; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:00,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {43187#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {43212#(< 0 (+ main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,116 INFO L290 TraceCheckUtils]: 74: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,116 INFO L272 TraceCheckUtils]: 75: Hoare triple {43212#(< 0 (+ main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,116 INFO L290 TraceCheckUtils]: 77: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,116 INFO L290 TraceCheckUtils]: 78: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,116 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {42989#true} {43212#(< 0 (+ main_~r~0 3))} #96#return; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,117 INFO L290 TraceCheckUtils]: 80: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !(~r~0 > 0); {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,117 INFO L290 TraceCheckUtils]: 81: Hoare triple {43212#(< 0 (+ main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,117 INFO L290 TraceCheckUtils]: 82: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,117 INFO L272 TraceCheckUtils]: 83: Hoare triple {43212#(< 0 (+ main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,117 INFO L290 TraceCheckUtils]: 84: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,118 INFO L290 TraceCheckUtils]: 85: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,118 INFO L290 TraceCheckUtils]: 86: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,118 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {42989#true} {43212#(< 0 (+ main_~r~0 3))} #98#return; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,119 INFO L290 TraceCheckUtils]: 88: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,119 INFO L290 TraceCheckUtils]: 89: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,119 INFO L290 TraceCheckUtils]: 90: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,119 INFO L272 TraceCheckUtils]: 91: Hoare triple {43261#(< main_~u~0 (+ 5 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)); {42989#true} is VALID [2022-04-27 13:17:00,119 INFO L290 TraceCheckUtils]: 92: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,119 INFO L290 TraceCheckUtils]: 93: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,119 INFO L290 TraceCheckUtils]: 94: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,120 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #98#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,120 INFO L290 TraceCheckUtils]: 96: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !(~r~0 < 0); {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,120 INFO L290 TraceCheckUtils]: 97: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,121 INFO L290 TraceCheckUtils]: 98: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,121 INFO L272 TraceCheckUtils]: 99: Hoare triple {43261#(< main_~u~0 (+ 5 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)); {42989#true} is VALID [2022-04-27 13:17:00,121 INFO L290 TraceCheckUtils]: 100: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,121 INFO L290 TraceCheckUtils]: 101: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,121 INFO L290 TraceCheckUtils]: 102: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,121 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #94#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,122 INFO L290 TraceCheckUtils]: 104: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(0 != ~r~0); {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,122 INFO L290 TraceCheckUtils]: 105: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,122 INFO L290 TraceCheckUtils]: 106: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,122 INFO L272 TraceCheckUtils]: 107: Hoare triple {43261#(< main_~u~0 (+ 5 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)); {42989#true} is VALID [2022-04-27 13:17:00,122 INFO L290 TraceCheckUtils]: 108: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,122 INFO L290 TraceCheckUtils]: 109: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,122 INFO L290 TraceCheckUtils]: 110: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,123 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #96#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,123 INFO L290 TraceCheckUtils]: 112: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:00,124 INFO L290 TraceCheckUtils]: 113: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:00,124 INFO L290 TraceCheckUtils]: 114: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:00,124 INFO L272 TraceCheckUtils]: 115: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,124 INFO L290 TraceCheckUtils]: 116: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,124 INFO L290 TraceCheckUtils]: 117: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,124 INFO L290 TraceCheckUtils]: 118: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,125 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {42989#true} {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #96#return; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:00,125 INFO L290 TraceCheckUtils]: 120: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !(~r~0 > 0); {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:00,125 INFO L290 TraceCheckUtils]: 121: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:00,125 INFO L290 TraceCheckUtils]: 122: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:00,125 INFO L272 TraceCheckUtils]: 123: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,126 INFO L290 TraceCheckUtils]: 124: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,126 INFO L290 TraceCheckUtils]: 125: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,126 INFO L290 TraceCheckUtils]: 126: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,126 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42989#true} {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} #98#return; {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} is VALID [2022-04-27 13:17:00,127 INFO L290 TraceCheckUtils]: 128: Hoare triple {43334#(< main_~u~0 (+ main_~v~0 main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,127 INFO L290 TraceCheckUtils]: 129: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,127 INFO L290 TraceCheckUtils]: 130: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,127 INFO L272 TraceCheckUtils]: 131: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,127 INFO L290 TraceCheckUtils]: 132: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,127 INFO L290 TraceCheckUtils]: 133: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,127 INFO L290 TraceCheckUtils]: 134: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,128 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #98#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,128 INFO L290 TraceCheckUtils]: 136: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !(~r~0 < 0); {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,128 INFO L290 TraceCheckUtils]: 137: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,128 INFO L290 TraceCheckUtils]: 138: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,129 INFO L272 TraceCheckUtils]: 139: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,129 INFO L290 TraceCheckUtils]: 140: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,129 INFO L290 TraceCheckUtils]: 141: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,129 INFO L290 TraceCheckUtils]: 142: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,129 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #94#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,129 INFO L290 TraceCheckUtils]: 144: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(0 != ~r~0); {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,130 INFO L290 TraceCheckUtils]: 145: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,130 INFO L290 TraceCheckUtils]: 146: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,130 INFO L272 TraceCheckUtils]: 147: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,130 INFO L290 TraceCheckUtils]: 148: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,130 INFO L290 TraceCheckUtils]: 149: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,130 INFO L290 TraceCheckUtils]: 150: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,131 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #96#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,131 INFO L290 TraceCheckUtils]: 152: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:00,131 INFO L290 TraceCheckUtils]: 153: Hoare triple {43456#(< main_~r~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:00,132 INFO L290 TraceCheckUtils]: 154: Hoare triple {43456#(< main_~r~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:00,132 INFO L272 TraceCheckUtils]: 155: Hoare triple {43456#(< 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)); {42989#true} is VALID [2022-04-27 13:17:00,132 INFO L290 TraceCheckUtils]: 156: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,132 INFO L290 TraceCheckUtils]: 157: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,132 INFO L290 TraceCheckUtils]: 158: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,132 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {42989#true} {43456#(< main_~r~0 1)} #96#return; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 160: Hoare triple {43456#(< main_~r~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 161: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 162: Hoare triple {42990#false} assume !!(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L272 TraceCheckUtils]: 163: Hoare triple {42990#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)); {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 164: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 165: Hoare triple {42990#false} assume !(0 == ~cond); {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 166: Hoare triple {42990#false} assume true; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {42990#false} {42990#false} #96#return; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 168: Hoare triple {42990#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 169: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 170: Hoare triple {42990#false} assume !!(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L272 TraceCheckUtils]: 171: Hoare triple {42990#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)); {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 172: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 173: Hoare triple {42990#false} assume !(0 == ~cond); {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 174: Hoare triple {42990#false} assume true; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {42990#false} {42990#false} #96#return; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 176: Hoare triple {42990#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 177: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,133 INFO L290 TraceCheckUtils]: 178: Hoare triple {42990#false} assume !(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,134 INFO L290 TraceCheckUtils]: 179: Hoare triple {42990#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42990#false} is VALID [2022-04-27 13:17:00,134 INFO L290 TraceCheckUtils]: 180: Hoare triple {42990#false} assume !(#t~post8 < 100);havoc #t~post8; {42990#false} is VALID [2022-04-27 13:17:00,134 INFO L290 TraceCheckUtils]: 181: Hoare triple {42990#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42990#false} is VALID [2022-04-27 13:17:00,134 INFO L290 TraceCheckUtils]: 182: Hoare triple {42990#false} assume !(#t~post6 < 100);havoc #t~post6; {42990#false} is VALID [2022-04-27 13:17:00,134 INFO L272 TraceCheckUtils]: 183: Hoare triple {42990#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42990#false} is VALID [2022-04-27 13:17:00,134 INFO L290 TraceCheckUtils]: 184: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-27 13:17:00,134 INFO L290 TraceCheckUtils]: 185: Hoare triple {42990#false} assume 0 == ~cond; {42990#false} is VALID [2022-04-27 13:17:00,134 INFO L290 TraceCheckUtils]: 186: Hoare triple {42990#false} assume !false; {42990#false} is VALID [2022-04-27 13:17:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 280 proven. 184 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2022-04-27 13:17:00,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:00,818 INFO L290 TraceCheckUtils]: 186: Hoare triple {42990#false} assume !false; {42990#false} is VALID [2022-04-27 13:17:00,818 INFO L290 TraceCheckUtils]: 185: Hoare triple {42990#false} assume 0 == ~cond; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 184: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L272 TraceCheckUtils]: 183: Hoare triple {42990#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 182: Hoare triple {42990#false} assume !(#t~post6 < 100);havoc #t~post6; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 181: Hoare triple {42990#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 180: Hoare triple {42990#false} assume !(#t~post8 < 100);havoc #t~post8; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 179: Hoare triple {42990#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 178: Hoare triple {42990#false} assume !(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 177: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 176: Hoare triple {42990#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {42989#true} {42990#false} #96#return; {42990#false} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 174: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 173: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,819 INFO L290 TraceCheckUtils]: 172: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,819 INFO L272 TraceCheckUtils]: 171: Hoare triple {42990#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)); {42989#true} is VALID [2022-04-27 13:17:00,820 INFO L290 TraceCheckUtils]: 170: Hoare triple {42990#false} assume !!(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,820 INFO L290 TraceCheckUtils]: 169: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,820 INFO L290 TraceCheckUtils]: 168: Hoare triple {42990#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:00,820 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {42989#true} {42990#false} #96#return; {42990#false} is VALID [2022-04-27 13:17:00,820 INFO L290 TraceCheckUtils]: 166: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,820 INFO L290 TraceCheckUtils]: 165: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,820 INFO L290 TraceCheckUtils]: 164: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,820 INFO L272 TraceCheckUtils]: 163: Hoare triple {42990#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)); {42989#true} is VALID [2022-04-27 13:17:00,820 INFO L290 TraceCheckUtils]: 162: Hoare triple {42990#false} assume !!(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,820 INFO L290 TraceCheckUtils]: 161: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-27 13:17:00,821 INFO L290 TraceCheckUtils]: 160: Hoare triple {43456#(< main_~r~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {42990#false} is VALID [2022-04-27 13:17:00,821 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {42989#true} {43456#(< main_~r~0 1)} #96#return; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:00,822 INFO L290 TraceCheckUtils]: 158: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,822 INFO L290 TraceCheckUtils]: 157: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,822 INFO L290 TraceCheckUtils]: 156: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,822 INFO L272 TraceCheckUtils]: 155: Hoare triple {43456#(< 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)); {42989#true} is VALID [2022-04-27 13:17:00,822 INFO L290 TraceCheckUtils]: 154: Hoare triple {43456#(< main_~r~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:00,822 INFO L290 TraceCheckUtils]: 153: Hoare triple {43456#(< main_~r~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:00,823 INFO L290 TraceCheckUtils]: 152: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43456#(< main_~r~0 1)} is VALID [2022-04-27 13:17:00,824 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #96#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,824 INFO L290 TraceCheckUtils]: 150: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,824 INFO L290 TraceCheckUtils]: 149: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,824 INFO L290 TraceCheckUtils]: 148: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,824 INFO L272 TraceCheckUtils]: 147: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,825 INFO L290 TraceCheckUtils]: 146: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,825 INFO L290 TraceCheckUtils]: 145: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,825 INFO L290 TraceCheckUtils]: 144: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(0 != ~r~0); {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,826 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #94#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,826 INFO L290 TraceCheckUtils]: 142: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,826 INFO L290 TraceCheckUtils]: 141: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,826 INFO L290 TraceCheckUtils]: 140: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,826 INFO L272 TraceCheckUtils]: 139: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,826 INFO L290 TraceCheckUtils]: 138: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,827 INFO L290 TraceCheckUtils]: 137: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,827 INFO L290 TraceCheckUtils]: 136: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !(~r~0 < 0); {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,828 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {42989#true} {43383#(< main_~r~0 (+ main_~v~0 1))} #98#return; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,828 INFO L290 TraceCheckUtils]: 134: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,828 INFO L290 TraceCheckUtils]: 133: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,828 INFO L290 TraceCheckUtils]: 132: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,828 INFO L272 TraceCheckUtils]: 131: Hoare triple {43383#(< main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,828 INFO L290 TraceCheckUtils]: 130: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,829 INFO L290 TraceCheckUtils]: 129: Hoare triple {43383#(< main_~r~0 (+ main_~v~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,829 INFO L290 TraceCheckUtils]: 128: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43383#(< main_~r~0 (+ main_~v~0 1))} is VALID [2022-04-27 13:17:00,830 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {42989#true} {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #98#return; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:00,830 INFO L290 TraceCheckUtils]: 126: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,830 INFO L290 TraceCheckUtils]: 125: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,830 INFO L290 TraceCheckUtils]: 124: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,830 INFO L272 TraceCheckUtils]: 123: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,831 INFO L290 TraceCheckUtils]: 122: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(#t~post8 < 100);havoc #t~post8; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:00,831 INFO L290 TraceCheckUtils]: 121: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:00,831 INFO L290 TraceCheckUtils]: 120: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !(~r~0 > 0); {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:00,832 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {42989#true} {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #96#return; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:00,832 INFO L290 TraceCheckUtils]: 118: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,832 INFO L290 TraceCheckUtils]: 117: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,832 INFO L290 TraceCheckUtils]: 116: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,832 INFO L272 TraceCheckUtils]: 115: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,833 INFO L290 TraceCheckUtils]: 114: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} assume !!(#t~post7 < 100);havoc #t~post7; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:00,833 INFO L290 TraceCheckUtils]: 113: Hoare triple {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:00,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43733#(or (not (< main_~r~0 0)) (< (+ main_~u~0 main_~r~0) (+ main_~v~0 1)))} is VALID [2022-04-27 13:17:00,834 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #96#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,834 INFO L290 TraceCheckUtils]: 110: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,834 INFO L290 TraceCheckUtils]: 109: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,834 INFO L290 TraceCheckUtils]: 108: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,834 INFO L272 TraceCheckUtils]: 107: Hoare triple {43261#(< main_~u~0 (+ 5 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)); {42989#true} is VALID [2022-04-27 13:17:00,835 INFO L290 TraceCheckUtils]: 106: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,835 INFO L290 TraceCheckUtils]: 105: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,835 INFO L290 TraceCheckUtils]: 104: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(0 != ~r~0); {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,836 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #94#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,836 INFO L290 TraceCheckUtils]: 102: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,836 INFO L290 TraceCheckUtils]: 101: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,836 INFO L290 TraceCheckUtils]: 100: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,836 INFO L272 TraceCheckUtils]: 99: Hoare triple {43261#(< main_~u~0 (+ 5 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)); {42989#true} is VALID [2022-04-27 13:17:00,836 INFO L290 TraceCheckUtils]: 98: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,837 INFO L290 TraceCheckUtils]: 97: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,837 INFO L290 TraceCheckUtils]: 96: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !(~r~0 < 0); {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,838 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {42989#true} {43261#(< main_~u~0 (+ 5 main_~r~0))} #98#return; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,838 INFO L290 TraceCheckUtils]: 94: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,838 INFO L290 TraceCheckUtils]: 93: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,838 INFO L290 TraceCheckUtils]: 92: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,838 INFO L272 TraceCheckUtils]: 91: Hoare triple {43261#(< main_~u~0 (+ 5 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)); {42989#true} is VALID [2022-04-27 13:17:00,838 INFO L290 TraceCheckUtils]: 90: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,839 INFO L290 TraceCheckUtils]: 89: Hoare triple {43261#(< main_~u~0 (+ 5 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,839 INFO L290 TraceCheckUtils]: 88: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43261#(< main_~u~0 (+ 5 main_~r~0))} is VALID [2022-04-27 13:17:00,840 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {42989#true} {43212#(< 0 (+ main_~r~0 3))} #98#return; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,840 INFO L290 TraceCheckUtils]: 86: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,840 INFO L290 TraceCheckUtils]: 85: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,840 INFO L290 TraceCheckUtils]: 84: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,840 INFO L272 TraceCheckUtils]: 83: Hoare triple {43212#(< 0 (+ main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,840 INFO L290 TraceCheckUtils]: 82: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {43212#(< 0 (+ main_~r~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !(~r~0 > 0); {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,842 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {42989#true} {43212#(< 0 (+ main_~r~0 3))} #96#return; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,842 INFO L290 TraceCheckUtils]: 78: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,842 INFO L290 TraceCheckUtils]: 77: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,842 INFO L272 TraceCheckUtils]: 75: Hoare triple {43212#(< 0 (+ main_~r~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)); {42989#true} is VALID [2022-04-27 13:17:00,842 INFO L290 TraceCheckUtils]: 74: Hoare triple {43212#(< 0 (+ main_~r~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,843 INFO L290 TraceCheckUtils]: 73: Hoare triple {43212#(< 0 (+ main_~r~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {43187#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43212#(< 0 (+ main_~r~0 3))} is VALID [2022-04-27 13:17:00,844 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42989#true} {43187#(<= main_~v~0 3)} #96#return; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:00,844 INFO L290 TraceCheckUtils]: 70: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,844 INFO L290 TraceCheckUtils]: 68: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,844 INFO L272 TraceCheckUtils]: 67: Hoare triple {43187#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {43187#(<= main_~v~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:00,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {43187#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:00,845 INFO L290 TraceCheckUtils]: 64: Hoare triple {43042#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {43187#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:00,846 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,846 INFO L290 TraceCheckUtils]: 62: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,846 INFO L272 TraceCheckUtils]: 59: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {43042#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,848 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,848 INFO L272 TraceCheckUtils]: 51: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {43042#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 < 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,850 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,850 INFO L272 TraceCheckUtils]: 43: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {43042#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {43042#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,852 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,852 INFO L272 TraceCheckUtils]: 35: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,852 INFO L290 TraceCheckUtils]: 34: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {43042#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 > 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,853 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,854 INFO L272 TraceCheckUtils]: 27: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {43042#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,855 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,855 INFO L272 TraceCheckUtils]: 19: Hoare triple {43042#(<= 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)); {42989#true} is VALID [2022-04-27 13:17:00,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {43042#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {43042#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {42989#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {43042#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:00,856 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42989#true} {42989#true} #92#return; {42989#true} is VALID [2022-04-27 13:17:00,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L272 TraceCheckUtils]: 11: Hoare triple {42989#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)); {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42989#true} {42989#true} #90#return; {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {42989#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {42989#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; {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {42989#true} call #t~ret9 := main(); {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42989#true} {42989#true} #102#return; {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {42989#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42989#true} is VALID [2022-04-27 13:17:00,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {42989#true} call ULTIMATE.init(); {42989#true} is VALID [2022-04-27 13:17:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 140 proven. 184 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-27 13:17:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:00,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291451695] [2022-04-27 13:17:00,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:00,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321454246] [2022-04-27 13:17:00,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321454246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:00,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:00,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2022-04-27 13:17:00,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758921230] [2022-04-27 13:17:00,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:00,860 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 187 [2022-04-27 13:17:00,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:00,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:00,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:00,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:17:00,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:00,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:17:00,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:17:00,951 INFO L87 Difference]: Start difference. First operand 755 states and 984 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:05,165 INFO L93 Difference]: Finished difference Result 1720 states and 2275 transitions. [2022-04-27 13:17:05,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 13:17:05,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) Word has length 187 [2022-04-27 13:17:05,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-27 13:17:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:05,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-27 13:17:05,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 430 transitions. [2022-04-27 13:17:05,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:05,650 INFO L225 Difference]: With dead ends: 1720 [2022-04-27 13:17:05,650 INFO L226 Difference]: Without dead ends: 1523 [2022-04-27 13:17:05,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2022-04-27 13:17:05,651 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 147 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:05,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 810 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 13:17:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-04-27 13:17:07,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1314. [2022-04-27 13:17:07,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:07,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1523 states. Second operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) [2022-04-27 13:17:07,069 INFO L74 IsIncluded]: Start isIncluded. First operand 1523 states. Second operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) [2022-04-27 13:17:07,071 INFO L87 Difference]: Start difference. First operand 1523 states. Second operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) [2022-04-27 13:17:07,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:07,167 INFO L93 Difference]: Finished difference Result 1523 states and 2012 transitions. [2022-04-27 13:17:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2012 transitions. [2022-04-27 13:17:07,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:07,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:07,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) Second operand 1523 states. [2022-04-27 13:17:07,174 INFO L87 Difference]: Start difference. First operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) Second operand 1523 states. [2022-04-27 13:17:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:07,255 INFO L93 Difference]: Finished difference Result 1523 states and 2012 transitions. [2022-04-27 13:17:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2012 transitions. [2022-04-27 13:17:07,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:07,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:07,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:07,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 986 states have (on average 1.1795131845841784) internal successors, (1163), 1002 states have internal predecessors, (1163), 303 states have call successors, (303), 26 states have call predecessors, (303), 24 states have return successors, (301), 285 states have call predecessors, (301), 301 states have call successors, (301) [2022-04-27 13:17:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1767 transitions. [2022-04-27 13:17:07,363 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1767 transitions. Word has length 187 [2022-04-27 13:17:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:07,363 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1767 transitions. [2022-04-27 13:17:07,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 10 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 10 states have call predecessors, (22), 10 states have call successors, (22) [2022-04-27 13:17:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1767 transitions. [2022-04-27 13:17:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:17:07,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:07,368 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 10, 9, 9, 9, 8, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 3, 3, 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:07,395 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:17:07,579 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:17:07,580 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash -719610275, now seen corresponding path program 8 times [2022-04-27 13:17:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:07,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754898949] [2022-04-27 13:17:07,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:07,600 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:07,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001862409] [2022-04-27 13:17:07,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:17:07,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:07,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:07,601 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:17:07,605 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:17:07,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:17:07,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:07,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:17:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:07,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:08,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {51455#true} call ULTIMATE.init(); {51455#true} is VALID [2022-04-27 13:17:08,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {51455#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51455#true} is VALID [2022-04-27 13:17:08,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51455#true} {51455#true} #102#return; {51455#true} is VALID [2022-04-27 13:17:08,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {51455#true} call #t~ret9 := main(); {51455#true} is VALID [2022-04-27 13:17:08,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {51455#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; {51455#true} is VALID [2022-04-27 13:17:08,421 INFO L272 TraceCheckUtils]: 6: Hoare triple {51455#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:08,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51455#true} {51455#true} #90#return; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L272 TraceCheckUtils]: 11: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51455#true} {51455#true} #92#return; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {51455#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {51455#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {51455#true} assume !!(#t~post6 < 100);havoc #t~post6; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L272 TraceCheckUtils]: 19: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51455#true} {51455#true} #94#return; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {51455#true} assume !!(0 != ~r~0); {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {51455#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {51455#true} assume !!(#t~post7 < 100);havoc #t~post7; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L272 TraceCheckUtils]: 27: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51455#true} {51455#true} #96#return; {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {51455#true} assume !(~r~0 > 0); {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {51455#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {51455#true} assume !!(#t~post8 < 100);havoc #t~post8; {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L272 TraceCheckUtils]: 35: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,423 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51455#true} {51455#true} #98#return; {51455#true} is VALID [2022-04-27 13:17:08,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {51455#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,425 INFO L272 TraceCheckUtils]: 43: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:08,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,425 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51455#true} {51580#(< (+ main_~r~0 2) main_~u~0)} #98#return; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,426 INFO L272 TraceCheckUtils]: 51: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:08,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,427 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51455#true} {51580#(< (+ main_~r~0 2) main_~u~0)} #94#return; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,428 INFO L272 TraceCheckUtils]: 59: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:08,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,428 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51455#true} {51580#(< (+ main_~r~0 2) main_~u~0)} #96#return; {51580#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-27 13:17:08,429 INFO L290 TraceCheckUtils]: 64: Hoare triple {51580#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-27 13:17:08,429 INFO L290 TraceCheckUtils]: 65: Hoare triple {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-27 13:17:08,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-27 13:17:08,430 INFO L272 TraceCheckUtils]: 67: Hoare triple {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:08,430 INFO L290 TraceCheckUtils]: 68: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,430 INFO L290 TraceCheckUtils]: 69: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,430 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51455#true} {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-27 13:17:08,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {51653#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:08,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:08,440 INFO L290 TraceCheckUtils]: 74: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post7 < 100);havoc #t~post7; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:08,440 INFO L272 TraceCheckUtils]: 75: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~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)); {51455#true} is VALID [2022-04-27 13:17:08,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,440 INFO L290 TraceCheckUtils]: 77: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,440 INFO L290 TraceCheckUtils]: 78: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,441 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51455#true} {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #96#return; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:08,441 INFO L290 TraceCheckUtils]: 80: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !(~r~0 > 0); {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:08,442 INFO L290 TraceCheckUtils]: 81: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:08,442 INFO L290 TraceCheckUtils]: 82: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(#t~post8 < 100);havoc #t~post8; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:08,442 INFO L272 TraceCheckUtils]: 83: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~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)); {51455#true} is VALID [2022-04-27 13:17:08,442 INFO L290 TraceCheckUtils]: 84: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,442 INFO L290 TraceCheckUtils]: 85: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,442 INFO L290 TraceCheckUtils]: 86: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,443 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51455#true} {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} #98#return; {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} is VALID [2022-04-27 13:17:08,444 INFO L290 TraceCheckUtils]: 88: Hoare triple {51678#(and (< 2 (+ main_~u~0 main_~r~0)) (< main_~v~0 (+ main_~u~0 1)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,445 INFO L290 TraceCheckUtils]: 89: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,445 INFO L290 TraceCheckUtils]: 90: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post8 < 100);havoc #t~post8; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,445 INFO L272 TraceCheckUtils]: 91: Hoare triple {51727#(and (< 2 main_~r~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)); {51455#true} is VALID [2022-04-27 13:17:08,445 INFO L290 TraceCheckUtils]: 92: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,445 INFO L290 TraceCheckUtils]: 93: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,446 INFO L290 TraceCheckUtils]: 94: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,446 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51455#true} {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #98#return; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,447 INFO L290 TraceCheckUtils]: 96: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !(~r~0 < 0); {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,447 INFO L290 TraceCheckUtils]: 97: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,447 INFO L290 TraceCheckUtils]: 98: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post6 < 100);havoc #t~post6; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,447 INFO L272 TraceCheckUtils]: 99: Hoare triple {51727#(and (< 2 main_~r~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)); {51455#true} is VALID [2022-04-27 13:17:08,448 INFO L290 TraceCheckUtils]: 100: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,448 INFO L290 TraceCheckUtils]: 101: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,448 INFO L290 TraceCheckUtils]: 102: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,448 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {51455#true} {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #94#return; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,449 INFO L290 TraceCheckUtils]: 104: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(0 != ~r~0); {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,449 INFO L290 TraceCheckUtils]: 105: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,449 INFO L290 TraceCheckUtils]: 106: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(#t~post7 < 100);havoc #t~post7; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,450 INFO L272 TraceCheckUtils]: 107: Hoare triple {51727#(and (< 2 main_~r~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)); {51455#true} is VALID [2022-04-27 13:17:08,450 INFO L290 TraceCheckUtils]: 108: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,450 INFO L290 TraceCheckUtils]: 109: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,450 INFO L290 TraceCheckUtils]: 110: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,450 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {51455#true} {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} #96#return; {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} is VALID [2022-04-27 13:17:08,451 INFO L290 TraceCheckUtils]: 112: Hoare triple {51727#(and (< 2 main_~r~0) (< (+ main_~v~0 1) main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:08,451 INFO L290 TraceCheckUtils]: 113: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:08,452 INFO L290 TraceCheckUtils]: 114: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:08,452 INFO L272 TraceCheckUtils]: 115: Hoare triple {51800#(< 4 (+ 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)); {51455#true} is VALID [2022-04-27 13:17:08,452 INFO L290 TraceCheckUtils]: 116: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,452 INFO L290 TraceCheckUtils]: 117: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,452 INFO L290 TraceCheckUtils]: 118: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,453 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {51455#true} {51800#(< 4 (+ main_~u~0 main_~r~0))} #96#return; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:08,453 INFO L290 TraceCheckUtils]: 120: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:08,453 INFO L290 TraceCheckUtils]: 121: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:08,454 INFO L290 TraceCheckUtils]: 122: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:08,454 INFO L272 TraceCheckUtils]: 123: Hoare triple {51800#(< 4 (+ 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)); {51455#true} is VALID [2022-04-27 13:17:08,454 INFO L290 TraceCheckUtils]: 124: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,454 INFO L290 TraceCheckUtils]: 125: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,454 INFO L290 TraceCheckUtils]: 126: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,455 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {51455#true} {51800#(< 4 (+ main_~u~0 main_~r~0))} #98#return; {51800#(< 4 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:08,455 INFO L290 TraceCheckUtils]: 128: Hoare triple {51800#(< 4 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51849#(< 4 main_~r~0)} is VALID [2022-04-27 13:17:08,455 INFO L290 TraceCheckUtils]: 129: Hoare triple {51849#(< 4 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51849#(< 4 main_~r~0)} is VALID [2022-04-27 13:17:08,456 INFO L290 TraceCheckUtils]: 130: Hoare triple {51849#(< 4 main_~r~0)} assume !!(#t~post8 < 100);havoc #t~post8; {51849#(< 4 main_~r~0)} is VALID [2022-04-27 13:17:08,456 INFO L272 TraceCheckUtils]: 131: Hoare triple {51849#(< 4 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)); {51455#true} is VALID [2022-04-27 13:17:08,456 INFO L290 TraceCheckUtils]: 132: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:08,456 INFO L290 TraceCheckUtils]: 133: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:08,456 INFO L290 TraceCheckUtils]: 134: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:08,457 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {51455#true} {51849#(< 4 main_~r~0)} #98#return; {51849#(< 4 main_~r~0)} is VALID [2022-04-27 13:17:08,458 INFO L290 TraceCheckUtils]: 136: Hoare triple {51849#(< 4 main_~r~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L290 TraceCheckUtils]: 137: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L290 TraceCheckUtils]: 138: Hoare triple {51456#false} assume !!(#t~post8 < 100);havoc #t~post8; {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L272 TraceCheckUtils]: 139: Hoare triple {51456#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)); {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L290 TraceCheckUtils]: 140: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L290 TraceCheckUtils]: 141: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L290 TraceCheckUtils]: 142: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {51456#false} {51456#false} #98#return; {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L290 TraceCheckUtils]: 144: Hoare triple {51456#false} assume !(~r~0 < 0); {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L290 TraceCheckUtils]: 145: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-27 13:17:08,458 INFO L290 TraceCheckUtils]: 146: Hoare triple {51456#false} assume !!(#t~post6 < 100);havoc #t~post6; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L272 TraceCheckUtils]: 147: Hoare triple {51456#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)); {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 148: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 149: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 150: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {51456#false} {51456#false} #94#return; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 152: Hoare triple {51456#false} assume !!(0 != ~r~0); {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 153: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 154: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L272 TraceCheckUtils]: 155: Hoare triple {51456#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)); {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 156: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 157: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 158: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {51456#false} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 160: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 161: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:08,459 INFO L290 TraceCheckUtils]: 162: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L272 TraceCheckUtils]: 163: Hoare triple {51456#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)); {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 164: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 165: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 166: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {51456#false} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 168: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 169: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 170: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L272 TraceCheckUtils]: 171: Hoare triple {51456#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)); {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 172: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 173: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 174: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {51456#false} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 176: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 177: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 178: Hoare triple {51456#false} assume !(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 179: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 180: Hoare triple {51456#false} assume !(#t~post8 < 100);havoc #t~post8; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 181: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 182: Hoare triple {51456#false} assume !(#t~post6 < 100);havoc #t~post6; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L272 TraceCheckUtils]: 183: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 184: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:08,460 INFO L290 TraceCheckUtils]: 185: Hoare triple {51456#false} assume 0 == ~cond; {51456#false} is VALID [2022-04-27 13:17:08,461 INFO L290 TraceCheckUtils]: 186: Hoare triple {51456#false} assume !false; {51456#false} is VALID [2022-04-27 13:17:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 516 proven. 84 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-27 13:17:08,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:09,097 INFO L290 TraceCheckUtils]: 186: Hoare triple {51456#false} assume !false; {51456#false} is VALID [2022-04-27 13:17:09,097 INFO L290 TraceCheckUtils]: 185: Hoare triple {51456#false} assume 0 == ~cond; {51456#false} is VALID [2022-04-27 13:17:09,097 INFO L290 TraceCheckUtils]: 184: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L272 TraceCheckUtils]: 183: Hoare triple {51456#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 182: Hoare triple {51456#false} assume !(#t~post6 < 100);havoc #t~post6; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 181: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 180: Hoare triple {51456#false} assume !(#t~post8 < 100);havoc #t~post8; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 179: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 178: Hoare triple {51456#false} assume !(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 177: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 176: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {51455#true} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 174: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 173: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 172: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,098 INFO L272 TraceCheckUtils]: 171: Hoare triple {51456#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)); {51455#true} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 170: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 169: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 168: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {51455#true} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 166: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 165: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,098 INFO L290 TraceCheckUtils]: 164: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,099 INFO L272 TraceCheckUtils]: 163: Hoare triple {51456#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)); {51455#true} is VALID [2022-04-27 13:17:09,099 INFO L290 TraceCheckUtils]: 162: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:09,099 INFO L290 TraceCheckUtils]: 161: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:09,099 INFO L290 TraceCheckUtils]: 160: Hoare triple {51456#false} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {51456#false} is VALID [2022-04-27 13:17:09,099 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {51455#true} {51456#false} #96#return; {51456#false} is VALID [2022-04-27 13:17:09,099 INFO L290 TraceCheckUtils]: 158: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,099 INFO L290 TraceCheckUtils]: 157: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,099 INFO L290 TraceCheckUtils]: 156: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,099 INFO L272 TraceCheckUtils]: 155: Hoare triple {51456#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)); {51455#true} is VALID [2022-04-27 13:17:09,099 INFO L290 TraceCheckUtils]: 154: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-27 13:17:09,099 INFO L290 TraceCheckUtils]: 153: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-27 13:17:09,099 INFO L290 TraceCheckUtils]: 152: Hoare triple {51456#false} assume !!(0 != ~r~0); {51456#false} is VALID [2022-04-27 13:17:09,100 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {51455#true} {51456#false} #94#return; {51456#false} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 150: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 149: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 148: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,100 INFO L272 TraceCheckUtils]: 147: Hoare triple {51456#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)); {51455#true} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 146: Hoare triple {51456#false} assume !!(#t~post6 < 100);havoc #t~post6; {51456#false} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 145: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 144: Hoare triple {51456#false} assume !(~r~0 < 0); {51456#false} is VALID [2022-04-27 13:17:09,100 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {51455#true} {51456#false} #98#return; {51456#false} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 142: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 141: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 140: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,100 INFO L272 TraceCheckUtils]: 139: Hoare triple {51456#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)); {51455#true} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 138: Hoare triple {51456#false} assume !!(#t~post8 < 100);havoc #t~post8; {51456#false} is VALID [2022-04-27 13:17:09,100 INFO L290 TraceCheckUtils]: 137: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-27 13:17:09,107 INFO L290 TraceCheckUtils]: 136: Hoare triple {52174#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {51456#false} is VALID [2022-04-27 13:17:09,108 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {51455#true} {52174#(not (< main_~r~0 0))} #98#return; {52174#(not (< main_~r~0 0))} is VALID [2022-04-27 13:17:09,108 INFO L290 TraceCheckUtils]: 134: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,108 INFO L290 TraceCheckUtils]: 133: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,108 INFO L290 TraceCheckUtils]: 132: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,108 INFO L272 TraceCheckUtils]: 131: Hoare triple {52174#(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)); {51455#true} is VALID [2022-04-27 13:17:09,108 INFO L290 TraceCheckUtils]: 130: Hoare triple {52174#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {52174#(not (< main_~r~0 0))} is VALID [2022-04-27 13:17:09,109 INFO L290 TraceCheckUtils]: 129: Hoare triple {52174#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52174#(not (< main_~r~0 0))} is VALID [2022-04-27 13:17:09,109 INFO L290 TraceCheckUtils]: 128: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52174#(not (< main_~r~0 0))} is VALID [2022-04-27 13:17:09,110 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {51455#true} {52199#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,110 INFO L290 TraceCheckUtils]: 126: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,110 INFO L290 TraceCheckUtils]: 125: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,110 INFO L290 TraceCheckUtils]: 124: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,110 INFO L272 TraceCheckUtils]: 123: Hoare triple {52199#(<= 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)); {51455#true} is VALID [2022-04-27 13:17:09,110 INFO L290 TraceCheckUtils]: 122: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,111 INFO L290 TraceCheckUtils]: 121: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,111 INFO L290 TraceCheckUtils]: 120: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,111 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {51455#true} {52199#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,111 INFO L290 TraceCheckUtils]: 118: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,111 INFO L290 TraceCheckUtils]: 117: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,111 INFO L290 TraceCheckUtils]: 116: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,111 INFO L272 TraceCheckUtils]: 115: Hoare triple {52199#(<= 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)); {51455#true} is VALID [2022-04-27 13:17:09,112 INFO L290 TraceCheckUtils]: 114: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,112 INFO L290 TraceCheckUtils]: 113: Hoare triple {52199#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,113 INFO L290 TraceCheckUtils]: 112: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52199#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,113 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {51455#true} {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,113 INFO L290 TraceCheckUtils]: 110: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,113 INFO L290 TraceCheckUtils]: 109: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,113 INFO L290 TraceCheckUtils]: 108: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,113 INFO L272 TraceCheckUtils]: 107: Hoare triple {52248#(<= 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)); {51455#true} is VALID [2022-04-27 13:17:09,114 INFO L290 TraceCheckUtils]: 106: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,114 INFO L290 TraceCheckUtils]: 105: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,114 INFO L290 TraceCheckUtils]: 104: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(0 != ~r~0); {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,114 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {51455#true} {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #94#return; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,115 INFO L290 TraceCheckUtils]: 102: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,115 INFO L290 TraceCheckUtils]: 101: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,115 INFO L290 TraceCheckUtils]: 100: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,115 INFO L272 TraceCheckUtils]: 99: Hoare triple {52248#(<= 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)); {51455#true} is VALID [2022-04-27 13:17:09,115 INFO L290 TraceCheckUtils]: 98: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,115 INFO L290 TraceCheckUtils]: 97: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,115 INFO L290 TraceCheckUtils]: 96: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 < 0); {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,116 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {51455#true} {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,116 INFO L290 TraceCheckUtils]: 94: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,116 INFO L290 TraceCheckUtils]: 93: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,116 INFO L290 TraceCheckUtils]: 92: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,116 INFO L272 TraceCheckUtils]: 91: Hoare triple {52248#(<= 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)); {51455#true} is VALID [2022-04-27 13:17:09,119 INFO L290 TraceCheckUtils]: 90: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,120 INFO L290 TraceCheckUtils]: 89: Hoare triple {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,121 INFO L290 TraceCheckUtils]: 88: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52248#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-27 13:17:09,122 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {51455#true} {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #98#return; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:09,122 INFO L290 TraceCheckUtils]: 86: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,122 INFO L290 TraceCheckUtils]: 85: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,122 INFO L290 TraceCheckUtils]: 84: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,122 INFO L272 TraceCheckUtils]: 83: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* 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)); {51455#true} is VALID [2022-04-27 13:17:09,123 INFO L290 TraceCheckUtils]: 82: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:09,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:09,123 INFO L290 TraceCheckUtils]: 80: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !(~r~0 > 0); {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:09,124 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {51455#true} {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #96#return; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:09,124 INFO L290 TraceCheckUtils]: 78: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,124 INFO L290 TraceCheckUtils]: 77: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,124 INFO L290 TraceCheckUtils]: 76: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,124 INFO L272 TraceCheckUtils]: 75: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* 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)); {51455#true} is VALID [2022-04-27 13:17:09,125 INFO L290 TraceCheckUtils]: 74: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:09,125 INFO L290 TraceCheckUtils]: 73: Hoare triple {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:09,126 INFO L290 TraceCheckUtils]: 72: Hoare triple {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52321#(<= main_~v~0 (+ main_~r~0 2 (* main_~u~0 2)))} is VALID [2022-04-27 13:17:09,126 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {51455#true} {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} #96#return; {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-27 13:17:09,126 INFO L290 TraceCheckUtils]: 70: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,126 INFO L290 TraceCheckUtils]: 69: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,126 INFO L290 TraceCheckUtils]: 68: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,127 INFO L272 TraceCheckUtils]: 67: Hoare triple {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ 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)); {51455#true} is VALID [2022-04-27 13:17:09,127 INFO L290 TraceCheckUtils]: 66: Hoare triple {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} assume !!(#t~post7 < 100);havoc #t~post7; {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-27 13:17:09,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-27 13:17:09,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52370#(or (not (< 0 main_~r~0)) (<= (* main_~v~0 2) (+ main_~r~0 (* main_~u~0 2))))} is VALID [2022-04-27 13:17:09,129 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {51455#true} {52395#(<= (+ main_~r~0 1) main_~u~0)} #96#return; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,129 INFO L290 TraceCheckUtils]: 60: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,129 INFO L272 TraceCheckUtils]: 59: Hoare triple {52395#(<= (+ 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)); {51455#true} is VALID [2022-04-27 13:17:09,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(0 != ~r~0); {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,131 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {51455#true} {52395#(<= (+ main_~r~0 1) main_~u~0)} #94#return; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,131 INFO L290 TraceCheckUtils]: 53: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,131 INFO L272 TraceCheckUtils]: 51: Hoare triple {52395#(<= (+ 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)); {51455#true} is VALID [2022-04-27 13:17:09,131 INFO L290 TraceCheckUtils]: 50: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !(~r~0 < 0); {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,132 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {51455#true} {52395#(<= (+ main_~r~0 1) main_~u~0)} #98#return; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,132 INFO L272 TraceCheckUtils]: 43: Hoare triple {52395#(<= (+ 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)); {51455#true} is VALID [2022-04-27 13:17:09,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,133 INFO L290 TraceCheckUtils]: 41: Hoare triple {52395#(<= (+ main_~r~0 1) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {51455#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52395#(<= (+ main_~r~0 1) main_~u~0)} is VALID [2022-04-27 13:17:09,134 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51455#true} {51455#true} #98#return; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L272 TraceCheckUtils]: 35: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {51455#true} assume !!(#t~post8 < 100);havoc #t~post8; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {51455#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {51455#true} assume !(~r~0 > 0); {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51455#true} {51455#true} #96#return; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L272 TraceCheckUtils]: 27: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {51455#true} assume !!(#t~post7 < 100);havoc #t~post7; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {51455#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {51455#true} assume !!(0 != ~r~0); {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51455#true} {51455#true} #94#return; {51455#true} is VALID [2022-04-27 13:17:09,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L272 TraceCheckUtils]: 19: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {51455#true} assume !!(#t~post6 < 100);havoc #t~post6; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {51455#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {51455#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51455#true} {51455#true} #92#return; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L272 TraceCheckUtils]: 11: Hoare triple {51455#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)); {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51455#true} {51455#true} #90#return; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {51455#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {51455#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; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {51455#true} call #t~ret9 := main(); {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51455#true} {51455#true} #102#return; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {51455#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {51455#true} is VALID [2022-04-27 13:17:09,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {51455#true} call ULTIMATE.init(); {51455#true} is VALID [2022-04-27 13:17:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 226 proven. 84 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-04-27 13:17:09,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:09,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754898949] [2022-04-27 13:17:09,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:09,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001862409] [2022-04-27 13:17:09,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001862409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:09,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:09,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:17:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922537228] [2022-04-27 13:17:09,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:09,137 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) Word has length 187 [2022-04-27 13:17:09,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:09,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:17:09,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:09,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:17:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:09,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:17:09,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:17:09,284 INFO L87 Difference]: Start difference. First operand 1314 states and 1767 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:17:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:16,763 INFO L93 Difference]: Finished difference Result 2714 states and 3675 transitions. [2022-04-27 13:17:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 13:17:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) Word has length 187 [2022-04-27 13:17:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:17:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-27 13:17:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:17:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-27 13:17:16,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 442 transitions. [2022-04-27 13:17:17,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:17,455 INFO L225 Difference]: With dead ends: 2714 [2022-04-27 13:17:17,455 INFO L226 Difference]: Without dead ends: 2417 [2022-04-27 13:17:17,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=1097, Unknown=0, NotChecked=0, Total=1482 [2022-04-27 13:17:17,457 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 182 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:17,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 969 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 13:17:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-04-27 13:17:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1968. [2022-04-27 13:17:20,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:20,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2417 states. Second operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) [2022-04-27 13:17:20,024 INFO L74 IsIncluded]: Start isIncluded. First operand 2417 states. Second operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) [2022-04-27 13:17:20,025 INFO L87 Difference]: Start difference. First operand 2417 states. Second operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) [2022-04-27 13:17:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:20,200 INFO L93 Difference]: Finished difference Result 2417 states and 3221 transitions. [2022-04-27 13:17:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3221 transitions. [2022-04-27 13:17:20,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:20,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:20,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) Second operand 2417 states. [2022-04-27 13:17:20,207 INFO L87 Difference]: Start difference. First operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) Second operand 2417 states. [2022-04-27 13:17:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:20,404 INFO L93 Difference]: Finished difference Result 2417 states and 3221 transitions. [2022-04-27 13:17:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3221 transitions. [2022-04-27 13:17:20,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:20,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:20,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:20,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1475 states have (on average 1.1627118644067798) internal successors, (1715), 1503 states have internal predecessors, (1715), 468 states have call successors, (468), 26 states have call predecessors, (468), 24 states have return successors, (466), 438 states have call predecessors, (466), 466 states have call successors, (466) [2022-04-27 13:17:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2649 transitions. [2022-04-27 13:17:20,596 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2649 transitions. Word has length 187 [2022-04-27 13:17:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:20,597 INFO L495 AbstractCegarLoop]: Abstraction has 1968 states and 2649 transitions. [2022-04-27 13:17:20,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 14 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (36), 14 states have call predecessors, (36), 14 states have call successors, (36) [2022-04-27 13:17:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2649 transitions. [2022-04-27 13:17:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:17:20,601 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:20,601 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:20,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-27 13:17:20,825 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:17:20,825 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1188230671, now seen corresponding path program 9 times [2022-04-27 13:17:20,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:20,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087295068] [2022-04-27 13:17:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:20,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:20,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936626503] [2022-04-27 13:17:20,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:17:20,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:20,847 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:17:20,871 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:17:21,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-27 13:17:21,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:21,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 13:17:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:21,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:22,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {64085#true} call ULTIMATE.init(); {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {64085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64085#true} {64085#true} #102#return; {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {64085#true} call #t~ret9 := main(); {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {64085#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; {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {64085#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {64085#true} {64085#true} #90#return; {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L272 TraceCheckUtils]: 11: Hoare triple {64085#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)); {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,564 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {64085#true} {64085#true} #92#return; {64085#true} is VALID [2022-04-27 13:17:22,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {64085#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {64138#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,565 INFO L272 TraceCheckUtils]: 19: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:22,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,566 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {64138#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,567 INFO L272 TraceCheckUtils]: 27: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:22,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,567 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 > 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {64138#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,568 INFO L272 TraceCheckUtils]: 35: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:22,568 INFO L290 TraceCheckUtils]: 36: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,568 INFO L290 TraceCheckUtils]: 37: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,569 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {64138#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,569 INFO L290 TraceCheckUtils]: 41: Hoare triple {64138#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,569 INFO L290 TraceCheckUtils]: 42: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,569 INFO L272 TraceCheckUtils]: 43: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:22,570 INFO L290 TraceCheckUtils]: 44: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,570 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,570 INFO L290 TraceCheckUtils]: 48: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 < 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,571 INFO L290 TraceCheckUtils]: 49: Hoare triple {64138#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,571 INFO L290 TraceCheckUtils]: 50: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,571 INFO L272 TraceCheckUtils]: 51: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:22,571 INFO L290 TraceCheckUtils]: 52: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,571 INFO L290 TraceCheckUtils]: 53: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,571 INFO L290 TraceCheckUtils]: 54: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,571 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,572 INFO L290 TraceCheckUtils]: 56: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,572 INFO L290 TraceCheckUtils]: 57: Hoare triple {64138#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,572 INFO L290 TraceCheckUtils]: 58: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,572 INFO L272 TraceCheckUtils]: 59: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:22,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,572 INFO L290 TraceCheckUtils]: 61: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,572 INFO L290 TraceCheckUtils]: 62: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,573 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:22,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {64138#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:22,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {64283#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:22,574 INFO L290 TraceCheckUtils]: 66: Hoare triple {64283#(<= main_~v~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:22,574 INFO L272 TraceCheckUtils]: 67: Hoare triple {64283#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:22,574 INFO L290 TraceCheckUtils]: 68: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,575 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {64085#true} {64283#(<= main_~v~0 3)} #96#return; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:22,575 INFO L290 TraceCheckUtils]: 72: Hoare triple {64283#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:17:22,576 INFO L290 TraceCheckUtils]: 73: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:17:22,576 INFO L290 TraceCheckUtils]: 74: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post7 < 100);havoc #t~post7; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:17:22,576 INFO L272 TraceCheckUtils]: 75: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:17:22,576 INFO L290 TraceCheckUtils]: 76: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,576 INFO L290 TraceCheckUtils]: 77: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,576 INFO L290 TraceCheckUtils]: 78: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,577 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {64085#true} {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #96#return; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:17:22,577 INFO L290 TraceCheckUtils]: 80: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !(~r~0 > 0); {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:17:22,577 INFO L290 TraceCheckUtils]: 81: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:17:22,578 INFO L290 TraceCheckUtils]: 82: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post8 < 100);havoc #t~post8; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:17:22,578 INFO L272 TraceCheckUtils]: 83: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:17:22,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,578 INFO L290 TraceCheckUtils]: 85: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,578 INFO L290 TraceCheckUtils]: 86: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,578 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {64085#true} {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #98#return; {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-27 13:17:22,580 INFO L290 TraceCheckUtils]: 88: Hoare triple {64308#(and (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,580 INFO L290 TraceCheckUtils]: 89: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,580 INFO L290 TraceCheckUtils]: 90: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,581 INFO L272 TraceCheckUtils]: 91: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 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)); {64085#true} is VALID [2022-04-27 13:17:22,581 INFO L290 TraceCheckUtils]: 92: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,581 INFO L290 TraceCheckUtils]: 93: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,581 INFO L290 TraceCheckUtils]: 94: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,581 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {64085#true} {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #98#return; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,581 INFO L290 TraceCheckUtils]: 96: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !(~r~0 < 0); {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,582 INFO L290 TraceCheckUtils]: 97: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,582 INFO L290 TraceCheckUtils]: 98: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,582 INFO L272 TraceCheckUtils]: 99: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 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)); {64085#true} is VALID [2022-04-27 13:17:22,582 INFO L290 TraceCheckUtils]: 100: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,582 INFO L290 TraceCheckUtils]: 101: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,582 INFO L290 TraceCheckUtils]: 102: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,583 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {64085#true} {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #94#return; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,583 INFO L290 TraceCheckUtils]: 104: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(0 != ~r~0); {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,584 INFO L290 TraceCheckUtils]: 105: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,584 INFO L290 TraceCheckUtils]: 106: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,584 INFO L272 TraceCheckUtils]: 107: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 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)); {64085#true} is VALID [2022-04-27 13:17:22,584 INFO L290 TraceCheckUtils]: 108: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,584 INFO L290 TraceCheckUtils]: 109: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,584 INFO L290 TraceCheckUtils]: 110: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,585 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {64085#true} {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} #96#return; {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} is VALID [2022-04-27 13:17:22,586 INFO L290 TraceCheckUtils]: 112: Hoare triple {64357#(and (<= main_~v~0 5) (< main_~u~0 (+ 5 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64430#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-27 13:17:22,586 INFO L290 TraceCheckUtils]: 113: Hoare triple {64430#(< main_~u~0 (+ main_~r~0 10))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64430#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-27 13:17:22,586 INFO L290 TraceCheckUtils]: 114: Hoare triple {64430#(< main_~u~0 (+ main_~r~0 10))} assume !!(#t~post7 < 100);havoc #t~post7; {64430#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-27 13:17:22,586 INFO L272 TraceCheckUtils]: 115: Hoare triple {64430#(< main_~u~0 (+ main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:22,586 INFO L290 TraceCheckUtils]: 116: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,586 INFO L290 TraceCheckUtils]: 117: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,586 INFO L290 TraceCheckUtils]: 118: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,587 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {64085#true} {64430#(< main_~u~0 (+ main_~r~0 10))} #96#return; {64430#(< main_~u~0 (+ main_~r~0 10))} is VALID [2022-04-27 13:17:22,588 INFO L290 TraceCheckUtils]: 120: Hoare triple {64430#(< main_~u~0 (+ main_~r~0 10))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:17:22,588 INFO L290 TraceCheckUtils]: 121: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:17:22,588 INFO L290 TraceCheckUtils]: 122: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !!(#t~post7 < 100);havoc #t~post7; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:17:22,588 INFO L272 TraceCheckUtils]: 123: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:22,588 INFO L290 TraceCheckUtils]: 124: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,588 INFO L290 TraceCheckUtils]: 125: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,588 INFO L290 TraceCheckUtils]: 126: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,589 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {64085#true} {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #96#return; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:17:22,589 INFO L290 TraceCheckUtils]: 128: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !(~r~0 > 0); {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:17:22,590 INFO L290 TraceCheckUtils]: 129: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:17:22,590 INFO L290 TraceCheckUtils]: 130: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !!(#t~post8 < 100);havoc #t~post8; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:17:22,590 INFO L272 TraceCheckUtils]: 131: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:22,590 INFO L290 TraceCheckUtils]: 132: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,590 INFO L290 TraceCheckUtils]: 133: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,590 INFO L290 TraceCheckUtils]: 134: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,591 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {64085#true} {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} #98#return; {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} is VALID [2022-04-27 13:17:22,592 INFO L290 TraceCheckUtils]: 136: Hoare triple {64455#(and (< 2 (+ main_~v~0 main_~r~0)) (< main_~u~0 (+ main_~v~0 main_~r~0 8)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,592 INFO L290 TraceCheckUtils]: 137: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,592 INFO L290 TraceCheckUtils]: 138: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post8 < 100);havoc #t~post8; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,592 INFO L272 TraceCheckUtils]: 139: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~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)); {64085#true} is VALID [2022-04-27 13:17:22,592 INFO L290 TraceCheckUtils]: 140: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,592 INFO L290 TraceCheckUtils]: 141: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,592 INFO L290 TraceCheckUtils]: 142: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,593 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {64085#true} {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #98#return; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,593 INFO L290 TraceCheckUtils]: 144: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !(~r~0 < 0); {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,594 INFO L290 TraceCheckUtils]: 145: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,594 INFO L290 TraceCheckUtils]: 146: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post6 < 100);havoc #t~post6; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,594 INFO L272 TraceCheckUtils]: 147: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~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)); {64085#true} is VALID [2022-04-27 13:17:22,594 INFO L290 TraceCheckUtils]: 148: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,594 INFO L290 TraceCheckUtils]: 149: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,594 INFO L290 TraceCheckUtils]: 150: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,595 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {64085#true} {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #94#return; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,595 INFO L290 TraceCheckUtils]: 152: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(0 != ~r~0); {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,595 INFO L290 TraceCheckUtils]: 153: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,596 INFO L290 TraceCheckUtils]: 154: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(#t~post7 < 100);havoc #t~post7; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,596 INFO L272 TraceCheckUtils]: 155: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~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)); {64085#true} is VALID [2022-04-27 13:17:22,596 INFO L290 TraceCheckUtils]: 156: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,596 INFO L290 TraceCheckUtils]: 157: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,596 INFO L290 TraceCheckUtils]: 158: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,596 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {64085#true} {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} #96#return; {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} is VALID [2022-04-27 13:17:22,597 INFO L290 TraceCheckUtils]: 160: Hoare triple {64504#(and (< 3 main_~v~0) (< main_~r~0 (+ main_~v~0 6)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-27 13:17:22,597 INFO L290 TraceCheckUtils]: 161: Hoare triple {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-27 13:17:22,598 INFO L290 TraceCheckUtils]: 162: Hoare triple {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} assume !!(#t~post7 < 100);havoc #t~post7; {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-27 13:17:22,598 INFO L272 TraceCheckUtils]: 163: Hoare triple {64577#(and (< 5 main_~v~0) (< main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:22,598 INFO L290 TraceCheckUtils]: 164: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,598 INFO L290 TraceCheckUtils]: 165: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,598 INFO L290 TraceCheckUtils]: 166: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,598 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {64085#true} {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} #96#return; {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} is VALID [2022-04-27 13:17:22,599 INFO L290 TraceCheckUtils]: 168: Hoare triple {64577#(and (< 5 main_~v~0) (< main_~r~0 6))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64602#(< main_~r~0 0)} is VALID [2022-04-27 13:17:22,599 INFO L290 TraceCheckUtils]: 169: Hoare triple {64602#(< main_~r~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64602#(< main_~r~0 0)} is VALID [2022-04-27 13:17:22,599 INFO L290 TraceCheckUtils]: 170: Hoare triple {64602#(< main_~r~0 0)} assume !!(#t~post7 < 100);havoc #t~post7; {64602#(< main_~r~0 0)} is VALID [2022-04-27 13:17:22,600 INFO L272 TraceCheckUtils]: 171: Hoare triple {64602#(< 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)); {64085#true} is VALID [2022-04-27 13:17:22,600 INFO L290 TraceCheckUtils]: 172: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:22,600 INFO L290 TraceCheckUtils]: 173: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:22,600 INFO L290 TraceCheckUtils]: 174: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:22,600 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {64085#true} {64602#(< main_~r~0 0)} #96#return; {64602#(< main_~r~0 0)} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 176: Hoare triple {64602#(< main_~r~0 0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 177: Hoare triple {64086#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 178: Hoare triple {64086#false} assume !(#t~post7 < 100);havoc #t~post7; {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 179: Hoare triple {64086#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 180: Hoare triple {64086#false} assume !(#t~post8 < 100);havoc #t~post8; {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 181: Hoare triple {64086#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 182: Hoare triple {64086#false} assume !(#t~post6 < 100);havoc #t~post6; {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L272 TraceCheckUtils]: 183: Hoare triple {64086#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 184: Hoare triple {64086#false} ~cond := #in~cond; {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 185: Hoare triple {64086#false} assume 0 == ~cond; {64086#false} is VALID [2022-04-27 13:17:22,601 INFO L290 TraceCheckUtils]: 186: Hoare triple {64086#false} assume !false; {64086#false} is VALID [2022-04-27 13:17:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 84 proven. 248 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-04-27 13:17:22,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 186: Hoare triple {64086#false} assume !false; {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 185: Hoare triple {64086#false} assume 0 == ~cond; {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 184: Hoare triple {64086#false} ~cond := #in~cond; {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L272 TraceCheckUtils]: 183: Hoare triple {64086#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 182: Hoare triple {64086#false} assume !(#t~post6 < 100);havoc #t~post6; {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 181: Hoare triple {64086#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 180: Hoare triple {64086#false} assume !(#t~post8 < 100);havoc #t~post8; {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 179: Hoare triple {64086#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 178: Hoare triple {64086#false} assume !(#t~post7 < 100);havoc #t~post7; {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 177: Hoare triple {64086#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64086#false} is VALID [2022-04-27 13:17:23,834 INFO L290 TraceCheckUtils]: 176: Hoare triple {64687#(not (< 0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64086#false} is VALID [2022-04-27 13:17:23,835 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {64085#true} {64687#(not (< 0 main_~r~0))} #96#return; {64687#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:23,835 INFO L290 TraceCheckUtils]: 174: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,835 INFO L290 TraceCheckUtils]: 173: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,835 INFO L290 TraceCheckUtils]: 172: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,835 INFO L272 TraceCheckUtils]: 171: Hoare triple {64687#(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)); {64085#true} is VALID [2022-04-27 13:17:23,835 INFO L290 TraceCheckUtils]: 170: Hoare triple {64687#(not (< 0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {64687#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:23,836 INFO L290 TraceCheckUtils]: 169: Hoare triple {64687#(not (< 0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64687#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:23,837 INFO L290 TraceCheckUtils]: 168: Hoare triple {64712#(<= main_~r~0 main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64687#(not (< 0 main_~r~0))} is VALID [2022-04-27 13:17:23,837 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {64085#true} {64712#(<= main_~r~0 main_~v~0)} #96#return; {64712#(<= main_~r~0 main_~v~0)} is VALID [2022-04-27 13:17:23,837 INFO L290 TraceCheckUtils]: 166: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,837 INFO L290 TraceCheckUtils]: 165: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,837 INFO L290 TraceCheckUtils]: 164: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,837 INFO L272 TraceCheckUtils]: 163: Hoare triple {64712#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:23,837 INFO L290 TraceCheckUtils]: 162: Hoare triple {64712#(<= main_~r~0 main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {64712#(<= main_~r~0 main_~v~0)} is VALID [2022-04-27 13:17:23,838 INFO L290 TraceCheckUtils]: 161: Hoare triple {64712#(<= main_~r~0 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64712#(<= main_~r~0 main_~v~0)} is VALID [2022-04-27 13:17:23,838 INFO L290 TraceCheckUtils]: 160: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64712#(<= main_~r~0 main_~v~0)} is VALID [2022-04-27 13:17:23,839 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {64085#true} {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #96#return; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,839 INFO L290 TraceCheckUtils]: 158: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,839 INFO L290 TraceCheckUtils]: 157: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,839 INFO L290 TraceCheckUtils]: 156: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,839 INFO L272 TraceCheckUtils]: 155: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 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)); {64085#true} is VALID [2022-04-27 13:17:23,839 INFO L290 TraceCheckUtils]: 154: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,840 INFO L290 TraceCheckUtils]: 153: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,840 INFO L290 TraceCheckUtils]: 152: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(0 != ~r~0); {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,840 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {64085#true} {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #94#return; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,840 INFO L290 TraceCheckUtils]: 150: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,841 INFO L290 TraceCheckUtils]: 149: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,841 INFO L290 TraceCheckUtils]: 148: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,841 INFO L272 TraceCheckUtils]: 147: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 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)); {64085#true} is VALID [2022-04-27 13:17:23,841 INFO L290 TraceCheckUtils]: 146: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post6 < 100);havoc #t~post6; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,841 INFO L290 TraceCheckUtils]: 145: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,842 INFO L290 TraceCheckUtils]: 144: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !(~r~0 < 0); {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,842 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {64085#true} {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #98#return; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,842 INFO L290 TraceCheckUtils]: 142: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,842 INFO L290 TraceCheckUtils]: 141: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,842 INFO L290 TraceCheckUtils]: 140: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,842 INFO L272 TraceCheckUtils]: 139: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 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)); {64085#true} is VALID [2022-04-27 13:17:23,843 INFO L290 TraceCheckUtils]: 138: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,843 INFO L290 TraceCheckUtils]: 137: Hoare triple {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,844 INFO L290 TraceCheckUtils]: 136: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64737#(<= main_~r~0 (+ (* main_~v~0 2) 2))} is VALID [2022-04-27 13:17:23,845 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {64085#true} {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #98#return; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:23,845 INFO L290 TraceCheckUtils]: 134: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,845 INFO L290 TraceCheckUtils]: 133: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,845 INFO L290 TraceCheckUtils]: 132: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,845 INFO L272 TraceCheckUtils]: 131: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (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)); {64085#true} is VALID [2022-04-27 13:17:23,845 INFO L290 TraceCheckUtils]: 130: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post8 < 100);havoc #t~post8; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:23,845 INFO L290 TraceCheckUtils]: 129: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:23,846 INFO L290 TraceCheckUtils]: 128: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:23,846 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {64085#true} {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #96#return; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:23,846 INFO L290 TraceCheckUtils]: 126: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,846 INFO L290 TraceCheckUtils]: 125: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,846 INFO L290 TraceCheckUtils]: 124: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,847 INFO L272 TraceCheckUtils]: 123: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (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)); {64085#true} is VALID [2022-04-27 13:17:23,847 INFO L290 TraceCheckUtils]: 122: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 100);havoc #t~post7; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:23,847 INFO L290 TraceCheckUtils]: 121: Hoare triple {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:23,848 INFO L290 TraceCheckUtils]: 120: Hoare triple {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64810#(or (<= (+ main_~u~0 main_~r~0) (+ (* main_~v~0 2) 2)) (not (< main_~r~0 0)))} is VALID [2022-04-27 13:17:23,849 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {64085#true} {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} #96#return; {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,849 INFO L290 TraceCheckUtils]: 118: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,849 INFO L290 TraceCheckUtils]: 117: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,849 INFO L290 TraceCheckUtils]: 116: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,849 INFO L272 TraceCheckUtils]: 115: Hoare triple {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:23,849 INFO L290 TraceCheckUtils]: 114: Hoare triple {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} assume !!(#t~post7 < 100);havoc #t~post7; {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,849 INFO L290 TraceCheckUtils]: 113: Hoare triple {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,850 INFO L290 TraceCheckUtils]: 112: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64859#(or (not (< 0 main_~r~0)) (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,851 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {64085#true} {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #96#return; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,851 INFO L290 TraceCheckUtils]: 110: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,851 INFO L290 TraceCheckUtils]: 109: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,851 INFO L290 TraceCheckUtils]: 108: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,851 INFO L272 TraceCheckUtils]: 107: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:23,851 INFO L290 TraceCheckUtils]: 106: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(#t~post7 < 100);havoc #t~post7; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,852 INFO L290 TraceCheckUtils]: 105: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,852 INFO L290 TraceCheckUtils]: 104: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(0 != ~r~0); {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,852 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {64085#true} {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #94#return; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,853 INFO L290 TraceCheckUtils]: 102: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,853 INFO L290 TraceCheckUtils]: 101: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,853 INFO L290 TraceCheckUtils]: 100: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,853 INFO L272 TraceCheckUtils]: 99: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:23,853 INFO L290 TraceCheckUtils]: 98: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(#t~post6 < 100);havoc #t~post6; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,853 INFO L290 TraceCheckUtils]: 97: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,854 INFO L290 TraceCheckUtils]: 96: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !(~r~0 < 0); {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,854 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {64085#true} {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #98#return; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,854 INFO L290 TraceCheckUtils]: 94: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,854 INFO L290 TraceCheckUtils]: 93: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,854 INFO L290 TraceCheckUtils]: 92: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,854 INFO L272 TraceCheckUtils]: 91: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:23,855 INFO L290 TraceCheckUtils]: 90: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} assume !!(#t~post8 < 100);havoc #t~post8; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,855 INFO L290 TraceCheckUtils]: 89: Hoare triple {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,857 INFO L290 TraceCheckUtils]: 88: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64884#(or (<= (div (+ (* (- 1) main_~u~0) 3) (- 2)) 4) (<= (+ (div (+ (* (- 1) main_~u~0) 3) (- 2)) main_~v~0) (+ main_~r~0 3)))} is VALID [2022-04-27 13:17:23,857 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {64085#true} {64957#(<= main_~v~0 (+ main_~r~0 8))} #98#return; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:17:23,857 INFO L290 TraceCheckUtils]: 86: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,857 INFO L272 TraceCheckUtils]: 83: Hoare triple {64957#(<= main_~v~0 (+ main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:23,858 INFO L290 TraceCheckUtils]: 82: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} assume !!(#t~post8 < 100);havoc #t~post8; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:17:23,858 INFO L290 TraceCheckUtils]: 81: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:17:23,858 INFO L290 TraceCheckUtils]: 80: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} assume !(~r~0 > 0); {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:17:23,859 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {64085#true} {64957#(<= main_~v~0 (+ main_~r~0 8))} #96#return; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:17:23,859 INFO L290 TraceCheckUtils]: 78: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,859 INFO L290 TraceCheckUtils]: 77: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,859 INFO L272 TraceCheckUtils]: 75: Hoare triple {64957#(<= main_~v~0 (+ main_~r~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)); {64085#true} is VALID [2022-04-27 13:17:23,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} assume !!(#t~post7 < 100);havoc #t~post7; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:17:23,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {64957#(<= main_~v~0 (+ main_~r~0 8))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:17:23,860 INFO L290 TraceCheckUtils]: 72: Hoare triple {64283#(<= main_~v~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64957#(<= main_~v~0 (+ main_~r~0 8))} is VALID [2022-04-27 13:17:23,860 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {64085#true} {64283#(<= main_~v~0 3)} #96#return; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:23,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,861 INFO L272 TraceCheckUtils]: 67: Hoare triple {64283#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:23,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {64283#(<= main_~v~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:23,861 INFO L290 TraceCheckUtils]: 65: Hoare triple {64283#(<= main_~v~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:23,862 INFO L290 TraceCheckUtils]: 64: Hoare triple {64138#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {64283#(<= main_~v~0 3)} is VALID [2022-04-27 13:17:23,862 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,862 INFO L290 TraceCheckUtils]: 62: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,862 INFO L290 TraceCheckUtils]: 60: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,862 INFO L272 TraceCheckUtils]: 59: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:23,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {64138#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,864 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,864 INFO L290 TraceCheckUtils]: 54: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,864 INFO L272 TraceCheckUtils]: 51: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:23,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {64138#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 < 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,865 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,865 INFO L272 TraceCheckUtils]: 43: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:23,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,866 INFO L290 TraceCheckUtils]: 41: Hoare triple {64138#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {64138#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,866 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,867 INFO L272 TraceCheckUtils]: 35: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:23,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {64138#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 > 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,868 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,868 INFO L272 TraceCheckUtils]: 27: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:23,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {64138#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,871 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,871 INFO L272 TraceCheckUtils]: 19: Hoare triple {64138#(<= 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)); {64085#true} is VALID [2022-04-27 13:17:23,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {64138#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {64138#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {64085#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {64138#(<= main_~v~0 1)} is VALID [2022-04-27 13:17:23,873 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {64085#true} {64085#true} #92#return; {64085#true} is VALID [2022-04-27 13:17:23,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L272 TraceCheckUtils]: 11: Hoare triple {64085#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)); {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {64085#true} {64085#true} #90#return; {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {64085#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {64085#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; {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {64085#true} call #t~ret9 := main(); {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64085#true} {64085#true} #102#return; {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {64085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {64085#true} is VALID [2022-04-27 13:17:23,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {64085#true} call ULTIMATE.init(); {64085#true} is VALID [2022-04-27 13:17:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 84 proven. 248 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2022-04-27 13:17:23,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:23,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087295068] [2022-04-27 13:17:23,875 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:23,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936626503] [2022-04-27 13:17:23,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936626503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:23,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:23,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-27 13:17:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772926534] [2022-04-27 13:17:23,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:23,876 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 187 [2022-04-27 13:17:23,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:23,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:17:24,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:24,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 13:17:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 13:17:24,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-27 13:17:24,038 INFO L87 Difference]: Start difference. First operand 1968 states and 2649 transitions. Second operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:17:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:39,309 INFO L93 Difference]: Finished difference Result 3252 states and 4395 transitions. [2022-04-27 13:17:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-27 13:17:39,309 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 187 [2022-04-27 13:17:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:17:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:17:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-27 13:17:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:17:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-27 13:17:39,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 746 transitions. [2022-04-27 13:17:40,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 746 edges. 746 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:40,454 INFO L225 Difference]: With dead ends: 3252 [2022-04-27 13:17:40,454 INFO L226 Difference]: Without dead ends: 2993 [2022-04-27 13:17:40,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=507, Invalid=2573, Unknown=0, NotChecked=0, Total=3080 [2022-04-27 13:17:40,456 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 276 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:17:40,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 2084 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 13:17:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2022-04-27 13:17:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2462. [2022-04-27 13:17:44,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:17:44,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2993 states. Second operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) [2022-04-27 13:17:44,443 INFO L74 IsIncluded]: Start isIncluded. First operand 2993 states. Second operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) [2022-04-27 13:17:44,444 INFO L87 Difference]: Start difference. First operand 2993 states. Second operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) [2022-04-27 13:17:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:44,711 INFO L93 Difference]: Finished difference Result 2993 states and 4017 transitions. [2022-04-27 13:17:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4017 transitions. [2022-04-27 13:17:44,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:44,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:44,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) Second operand 2993 states. [2022-04-27 13:17:44,722 INFO L87 Difference]: Start difference. First operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) Second operand 2993 states. [2022-04-27 13:17:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:17:44,985 INFO L93 Difference]: Finished difference Result 2993 states and 4017 transitions. [2022-04-27 13:17:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4017 transitions. [2022-04-27 13:17:45,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:17:45,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:17:45,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:17:45,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:17:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 1845 states have (on average 1.1718157181571816) internal successors, (2162), 1887 states have internal predecessors, (2162), 592 states have call successors, (592), 26 states have call predecessors, (592), 24 states have return successors, (590), 548 states have call predecessors, (590), 590 states have call successors, (590) [2022-04-27 13:17:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 3344 transitions. [2022-04-27 13:17:45,261 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 3344 transitions. Word has length 187 [2022-04-27 13:17:45,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:17:45,261 INFO L495 AbstractCegarLoop]: Abstraction has 2462 states and 3344 transitions. [2022-04-27 13:17:45,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.222222222222222) internal successors, (112), 18 states have internal predecessors, (112), 18 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2022-04-27 13:17:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 3344 transitions. [2022-04-27 13:17:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-27 13:17:45,265 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:17:45,266 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 11, 10, 10, 10, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:17:45,271 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:17:45,466 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:17:45,466 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:17:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:17:45,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2070462991, now seen corresponding path program 10 times [2022-04-27 13:17:45,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:17:45,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87474087] [2022-04-27 13:17:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:17:45,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:17:45,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:17:45,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79153615] [2022-04-27 13:17:45,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 13:17:45,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:17:45,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:17:45,491 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:17:45,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-27 13:17:45,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 13:17:45,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:17:45,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-27 13:17:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:17:45,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:17:46,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {79339#true} call ULTIMATE.init(); {79339#true} is VALID [2022-04-27 13:17:46,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {79339#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {79347#(<= ~counter~0 0)} assume true; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79347#(<= ~counter~0 0)} {79339#true} #102#return; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {79347#(<= ~counter~0 0)} call #t~ret9 := main(); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {79347#(<= ~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; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {79347#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {79347#(<= ~counter~0 0)} ~cond := #in~cond; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {79347#(<= ~counter~0 0)} assume !(0 == ~cond); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {79347#(<= ~counter~0 0)} assume true; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,835 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79347#(<= ~counter~0 0)} {79347#(<= ~counter~0 0)} #90#return; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,835 INFO L272 TraceCheckUtils]: 11: Hoare triple {79347#(<= ~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)); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {79347#(<= ~counter~0 0)} ~cond := #in~cond; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {79347#(<= ~counter~0 0)} assume !(0 == ~cond); {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {79347#(<= ~counter~0 0)} assume true; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,836 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79347#(<= ~counter~0 0)} {79347#(<= ~counter~0 0)} #92#return; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {79347#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {79347#(<= ~counter~0 0)} is VALID [2022-04-27 13:17:46,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {79347#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:46,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {79396#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:46,839 INFO L272 TraceCheckUtils]: 19: Hoare triple {79396#(<= ~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)); {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:46,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {79396#(<= ~counter~0 1)} ~cond := #in~cond; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:46,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {79396#(<= ~counter~0 1)} assume !(0 == ~cond); {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:46,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {79396#(<= ~counter~0 1)} assume true; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:46,840 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79396#(<= ~counter~0 1)} {79396#(<= ~counter~0 1)} #94#return; {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:46,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {79396#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79396#(<= ~counter~0 1)} is VALID [2022-04-27 13:17:46,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {79396#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:46,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {79421#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:46,842 INFO L272 TraceCheckUtils]: 27: Hoare triple {79421#(<= ~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)); {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:46,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {79421#(<= ~counter~0 2)} ~cond := #in~cond; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:46,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {79421#(<= ~counter~0 2)} assume !(0 == ~cond); {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:46,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {79421#(<= ~counter~0 2)} assume true; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:46,843 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79421#(<= ~counter~0 2)} {79421#(<= ~counter~0 2)} #96#return; {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:46,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {79421#(<= ~counter~0 2)} assume !(~r~0 > 0); {79421#(<= ~counter~0 2)} is VALID [2022-04-27 13:17:46,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {79421#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:46,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {79446#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:46,845 INFO L272 TraceCheckUtils]: 35: Hoare triple {79446#(<= ~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)); {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:46,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {79446#(<= ~counter~0 3)} ~cond := #in~cond; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:46,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {79446#(<= ~counter~0 3)} assume !(0 == ~cond); {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:46,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {79446#(<= ~counter~0 3)} assume true; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:46,846 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79446#(<= ~counter~0 3)} {79446#(<= ~counter~0 3)} #98#return; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:46,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {79446#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79446#(<= ~counter~0 3)} is VALID [2022-04-27 13:17:46,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {79446#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:46,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {79471#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:46,848 INFO L272 TraceCheckUtils]: 43: Hoare triple {79471#(<= ~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)); {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:46,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {79471#(<= ~counter~0 4)} ~cond := #in~cond; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:46,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {79471#(<= ~counter~0 4)} assume !(0 == ~cond); {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:46,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {79471#(<= ~counter~0 4)} assume true; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:46,849 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79471#(<= ~counter~0 4)} {79471#(<= ~counter~0 4)} #98#return; {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:46,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {79471#(<= ~counter~0 4)} assume !(~r~0 < 0); {79471#(<= ~counter~0 4)} is VALID [2022-04-27 13:17:46,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {79471#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:46,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {79496#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:46,851 INFO L272 TraceCheckUtils]: 51: Hoare triple {79496#(<= ~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)); {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:46,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {79496#(<= ~counter~0 5)} ~cond := #in~cond; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:46,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {79496#(<= ~counter~0 5)} assume !(0 == ~cond); {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:46,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {79496#(<= ~counter~0 5)} assume true; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:46,852 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79496#(<= ~counter~0 5)} {79496#(<= ~counter~0 5)} #94#return; {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:46,853 INFO L290 TraceCheckUtils]: 56: Hoare triple {79496#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79496#(<= ~counter~0 5)} is VALID [2022-04-27 13:17:46,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {79496#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:46,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {79521#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:46,855 INFO L272 TraceCheckUtils]: 59: Hoare triple {79521#(<= ~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)); {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:46,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {79521#(<= ~counter~0 6)} ~cond := #in~cond; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:46,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {79521#(<= ~counter~0 6)} assume !(0 == ~cond); {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:46,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {79521#(<= ~counter~0 6)} assume true; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:46,857 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79521#(<= ~counter~0 6)} {79521#(<= ~counter~0 6)} #96#return; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:46,858 INFO L290 TraceCheckUtils]: 64: Hoare triple {79521#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79521#(<= ~counter~0 6)} is VALID [2022-04-27 13:17:46,859 INFO L290 TraceCheckUtils]: 65: Hoare triple {79521#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:46,859 INFO L290 TraceCheckUtils]: 66: Hoare triple {79546#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:46,860 INFO L272 TraceCheckUtils]: 67: Hoare triple {79546#(<= ~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)); {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:46,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {79546#(<= ~counter~0 7)} ~cond := #in~cond; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:46,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {79546#(<= ~counter~0 7)} assume !(0 == ~cond); {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:46,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {79546#(<= ~counter~0 7)} assume true; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:46,862 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79546#(<= ~counter~0 7)} {79546#(<= ~counter~0 7)} #96#return; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:46,862 INFO L290 TraceCheckUtils]: 72: Hoare triple {79546#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79546#(<= ~counter~0 7)} is VALID [2022-04-27 13:17:46,863 INFO L290 TraceCheckUtils]: 73: Hoare triple {79546#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:46,864 INFO L290 TraceCheckUtils]: 74: Hoare triple {79571#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:46,864 INFO L272 TraceCheckUtils]: 75: Hoare triple {79571#(<= ~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)); {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:46,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {79571#(<= ~counter~0 8)} ~cond := #in~cond; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:46,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {79571#(<= ~counter~0 8)} assume !(0 == ~cond); {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:46,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {79571#(<= ~counter~0 8)} assume true; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:46,866 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79571#(<= ~counter~0 8)} {79571#(<= ~counter~0 8)} #96#return; {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:46,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {79571#(<= ~counter~0 8)} assume !(~r~0 > 0); {79571#(<= ~counter~0 8)} is VALID [2022-04-27 13:17:46,868 INFO L290 TraceCheckUtils]: 81: Hoare triple {79571#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:46,868 INFO L290 TraceCheckUtils]: 82: Hoare triple {79596#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:46,869 INFO L272 TraceCheckUtils]: 83: Hoare triple {79596#(<= ~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)); {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:46,869 INFO L290 TraceCheckUtils]: 84: Hoare triple {79596#(<= ~counter~0 9)} ~cond := #in~cond; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:46,870 INFO L290 TraceCheckUtils]: 85: Hoare triple {79596#(<= ~counter~0 9)} assume !(0 == ~cond); {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:46,870 INFO L290 TraceCheckUtils]: 86: Hoare triple {79596#(<= ~counter~0 9)} assume true; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:46,870 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79596#(<= ~counter~0 9)} {79596#(<= ~counter~0 9)} #98#return; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:46,871 INFO L290 TraceCheckUtils]: 88: Hoare triple {79596#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79596#(<= ~counter~0 9)} is VALID [2022-04-27 13:17:46,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {79596#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:46,873 INFO L290 TraceCheckUtils]: 90: Hoare triple {79621#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:46,873 INFO L272 TraceCheckUtils]: 91: Hoare triple {79621#(<= ~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)); {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:46,874 INFO L290 TraceCheckUtils]: 92: Hoare triple {79621#(<= ~counter~0 10)} ~cond := #in~cond; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:46,874 INFO L290 TraceCheckUtils]: 93: Hoare triple {79621#(<= ~counter~0 10)} assume !(0 == ~cond); {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:46,874 INFO L290 TraceCheckUtils]: 94: Hoare triple {79621#(<= ~counter~0 10)} assume true; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:46,875 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79621#(<= ~counter~0 10)} {79621#(<= ~counter~0 10)} #98#return; {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:46,875 INFO L290 TraceCheckUtils]: 96: Hoare triple {79621#(<= ~counter~0 10)} assume !(~r~0 < 0); {79621#(<= ~counter~0 10)} is VALID [2022-04-27 13:17:46,877 INFO L290 TraceCheckUtils]: 97: Hoare triple {79621#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:46,877 INFO L290 TraceCheckUtils]: 98: Hoare triple {79646#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:46,878 INFO L272 TraceCheckUtils]: 99: Hoare triple {79646#(<= ~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)); {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:46,878 INFO L290 TraceCheckUtils]: 100: Hoare triple {79646#(<= ~counter~0 11)} ~cond := #in~cond; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:46,878 INFO L290 TraceCheckUtils]: 101: Hoare triple {79646#(<= ~counter~0 11)} assume !(0 == ~cond); {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:46,879 INFO L290 TraceCheckUtils]: 102: Hoare triple {79646#(<= ~counter~0 11)} assume true; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:46,879 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79646#(<= ~counter~0 11)} {79646#(<= ~counter~0 11)} #94#return; {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:46,880 INFO L290 TraceCheckUtils]: 104: Hoare triple {79646#(<= ~counter~0 11)} assume !!(0 != ~r~0); {79646#(<= ~counter~0 11)} is VALID [2022-04-27 13:17:46,881 INFO L290 TraceCheckUtils]: 105: Hoare triple {79646#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:46,882 INFO L290 TraceCheckUtils]: 106: Hoare triple {79671#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:46,882 INFO L272 TraceCheckUtils]: 107: Hoare triple {79671#(<= ~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)); {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:46,883 INFO L290 TraceCheckUtils]: 108: Hoare triple {79671#(<= ~counter~0 12)} ~cond := #in~cond; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:46,883 INFO L290 TraceCheckUtils]: 109: Hoare triple {79671#(<= ~counter~0 12)} assume !(0 == ~cond); {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:46,883 INFO L290 TraceCheckUtils]: 110: Hoare triple {79671#(<= ~counter~0 12)} assume true; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:46,884 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79671#(<= ~counter~0 12)} {79671#(<= ~counter~0 12)} #96#return; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:46,884 INFO L290 TraceCheckUtils]: 112: Hoare triple {79671#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79671#(<= ~counter~0 12)} is VALID [2022-04-27 13:17:46,885 INFO L290 TraceCheckUtils]: 113: Hoare triple {79671#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:46,886 INFO L290 TraceCheckUtils]: 114: Hoare triple {79696#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:46,886 INFO L272 TraceCheckUtils]: 115: Hoare triple {79696#(<= ~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)); {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:46,887 INFO L290 TraceCheckUtils]: 116: Hoare triple {79696#(<= ~counter~0 13)} ~cond := #in~cond; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:46,887 INFO L290 TraceCheckUtils]: 117: Hoare triple {79696#(<= ~counter~0 13)} assume !(0 == ~cond); {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:46,887 INFO L290 TraceCheckUtils]: 118: Hoare triple {79696#(<= ~counter~0 13)} assume true; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:46,888 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {79696#(<= ~counter~0 13)} {79696#(<= ~counter~0 13)} #96#return; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:46,888 INFO L290 TraceCheckUtils]: 120: Hoare triple {79696#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79696#(<= ~counter~0 13)} is VALID [2022-04-27 13:17:46,889 INFO L290 TraceCheckUtils]: 121: Hoare triple {79696#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:46,890 INFO L290 TraceCheckUtils]: 122: Hoare triple {79721#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:46,890 INFO L272 TraceCheckUtils]: 123: Hoare triple {79721#(<= ~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)); {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:46,891 INFO L290 TraceCheckUtils]: 124: Hoare triple {79721#(<= ~counter~0 14)} ~cond := #in~cond; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:46,891 INFO L290 TraceCheckUtils]: 125: Hoare triple {79721#(<= ~counter~0 14)} assume !(0 == ~cond); {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:46,891 INFO L290 TraceCheckUtils]: 126: Hoare triple {79721#(<= ~counter~0 14)} assume true; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:46,892 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {79721#(<= ~counter~0 14)} {79721#(<= ~counter~0 14)} #96#return; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:46,893 INFO L290 TraceCheckUtils]: 128: Hoare triple {79721#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79721#(<= ~counter~0 14)} is VALID [2022-04-27 13:17:46,894 INFO L290 TraceCheckUtils]: 129: Hoare triple {79721#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:46,894 INFO L290 TraceCheckUtils]: 130: Hoare triple {79746#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:46,895 INFO L272 TraceCheckUtils]: 131: Hoare triple {79746#(<= ~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)); {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:46,895 INFO L290 TraceCheckUtils]: 132: Hoare triple {79746#(<= ~counter~0 15)} ~cond := #in~cond; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:46,895 INFO L290 TraceCheckUtils]: 133: Hoare triple {79746#(<= ~counter~0 15)} assume !(0 == ~cond); {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:46,896 INFO L290 TraceCheckUtils]: 134: Hoare triple {79746#(<= ~counter~0 15)} assume true; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:46,897 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {79746#(<= ~counter~0 15)} {79746#(<= ~counter~0 15)} #96#return; {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:46,897 INFO L290 TraceCheckUtils]: 136: Hoare triple {79746#(<= ~counter~0 15)} assume !(~r~0 > 0); {79746#(<= ~counter~0 15)} is VALID [2022-04-27 13:17:46,898 INFO L290 TraceCheckUtils]: 137: Hoare triple {79746#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:46,898 INFO L290 TraceCheckUtils]: 138: Hoare triple {79771#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:46,899 INFO L272 TraceCheckUtils]: 139: Hoare triple {79771#(<= ~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)); {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:46,900 INFO L290 TraceCheckUtils]: 140: Hoare triple {79771#(<= ~counter~0 16)} ~cond := #in~cond; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:46,900 INFO L290 TraceCheckUtils]: 141: Hoare triple {79771#(<= ~counter~0 16)} assume !(0 == ~cond); {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:46,900 INFO L290 TraceCheckUtils]: 142: Hoare triple {79771#(<= ~counter~0 16)} assume true; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:46,901 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {79771#(<= ~counter~0 16)} {79771#(<= ~counter~0 16)} #98#return; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:46,902 INFO L290 TraceCheckUtils]: 144: Hoare triple {79771#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {79771#(<= ~counter~0 16)} is VALID [2022-04-27 13:17:46,903 INFO L290 TraceCheckUtils]: 145: Hoare triple {79771#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:46,903 INFO L290 TraceCheckUtils]: 146: Hoare triple {79796#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:46,904 INFO L272 TraceCheckUtils]: 147: Hoare triple {79796#(<= ~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)); {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:46,905 INFO L290 TraceCheckUtils]: 148: Hoare triple {79796#(<= ~counter~0 17)} ~cond := #in~cond; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:46,905 INFO L290 TraceCheckUtils]: 149: Hoare triple {79796#(<= ~counter~0 17)} assume !(0 == ~cond); {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:46,905 INFO L290 TraceCheckUtils]: 150: Hoare triple {79796#(<= ~counter~0 17)} assume true; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:46,906 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {79796#(<= ~counter~0 17)} {79796#(<= ~counter~0 17)} #98#return; {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:46,906 INFO L290 TraceCheckUtils]: 152: Hoare triple {79796#(<= ~counter~0 17)} assume !(~r~0 < 0); {79796#(<= ~counter~0 17)} is VALID [2022-04-27 13:17:46,908 INFO L290 TraceCheckUtils]: 153: Hoare triple {79796#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:17:46,908 INFO L290 TraceCheckUtils]: 154: Hoare triple {79821#(<= ~counter~0 18)} assume !!(#t~post6 < 100);havoc #t~post6; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:17:46,909 INFO L272 TraceCheckUtils]: 155: Hoare triple {79821#(<= ~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)); {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:17:46,909 INFO L290 TraceCheckUtils]: 156: Hoare triple {79821#(<= ~counter~0 18)} ~cond := #in~cond; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:17:46,910 INFO L290 TraceCheckUtils]: 157: Hoare triple {79821#(<= ~counter~0 18)} assume !(0 == ~cond); {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:17:46,910 INFO L290 TraceCheckUtils]: 158: Hoare triple {79821#(<= ~counter~0 18)} assume true; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:17:46,911 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {79821#(<= ~counter~0 18)} {79821#(<= ~counter~0 18)} #94#return; {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:17:46,911 INFO L290 TraceCheckUtils]: 160: Hoare triple {79821#(<= ~counter~0 18)} assume !!(0 != ~r~0); {79821#(<= ~counter~0 18)} is VALID [2022-04-27 13:17:46,912 INFO L290 TraceCheckUtils]: 161: Hoare triple {79821#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:17:46,913 INFO L290 TraceCheckUtils]: 162: Hoare triple {79846#(<= ~counter~0 19)} assume !!(#t~post7 < 100);havoc #t~post7; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:17:46,914 INFO L272 TraceCheckUtils]: 163: Hoare triple {79846#(<= ~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)); {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:17:46,914 INFO L290 TraceCheckUtils]: 164: Hoare triple {79846#(<= ~counter~0 19)} ~cond := #in~cond; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:17:46,914 INFO L290 TraceCheckUtils]: 165: Hoare triple {79846#(<= ~counter~0 19)} assume !(0 == ~cond); {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:17:46,915 INFO L290 TraceCheckUtils]: 166: Hoare triple {79846#(<= ~counter~0 19)} assume true; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:17:46,916 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {79846#(<= ~counter~0 19)} {79846#(<= ~counter~0 19)} #96#return; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:17:46,916 INFO L290 TraceCheckUtils]: 168: Hoare triple {79846#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79846#(<= ~counter~0 19)} is VALID [2022-04-27 13:17:46,917 INFO L290 TraceCheckUtils]: 169: Hoare triple {79846#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:17:46,918 INFO L290 TraceCheckUtils]: 170: Hoare triple {79871#(<= ~counter~0 20)} assume !!(#t~post7 < 100);havoc #t~post7; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:17:46,918 INFO L272 TraceCheckUtils]: 171: Hoare triple {79871#(<= ~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)); {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:17:46,919 INFO L290 TraceCheckUtils]: 172: Hoare triple {79871#(<= ~counter~0 20)} ~cond := #in~cond; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:17:46,919 INFO L290 TraceCheckUtils]: 173: Hoare triple {79871#(<= ~counter~0 20)} assume !(0 == ~cond); {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:17:46,920 INFO L290 TraceCheckUtils]: 174: Hoare triple {79871#(<= ~counter~0 20)} assume true; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:17:46,920 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {79871#(<= ~counter~0 20)} {79871#(<= ~counter~0 20)} #96#return; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:17:46,921 INFO L290 TraceCheckUtils]: 176: Hoare triple {79871#(<= ~counter~0 20)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79871#(<= ~counter~0 20)} is VALID [2022-04-27 13:17:46,921 INFO L290 TraceCheckUtils]: 177: Hoare triple {79871#(<= ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79896#(<= |main_#t~post7| 20)} is VALID [2022-04-27 13:17:46,922 INFO L290 TraceCheckUtils]: 178: Hoare triple {79896#(<= |main_#t~post7| 20)} assume !(#t~post7 < 100);havoc #t~post7; {79340#false} is VALID [2022-04-27 13:17:46,922 INFO L290 TraceCheckUtils]: 179: Hoare triple {79340#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79340#false} is VALID [2022-04-27 13:17:46,922 INFO L290 TraceCheckUtils]: 180: Hoare triple {79340#false} assume !(#t~post8 < 100);havoc #t~post8; {79340#false} is VALID [2022-04-27 13:17:46,922 INFO L290 TraceCheckUtils]: 181: Hoare triple {79340#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79340#false} is VALID [2022-04-27 13:17:46,922 INFO L290 TraceCheckUtils]: 182: Hoare triple {79340#false} assume !(#t~post6 < 100);havoc #t~post6; {79340#false} is VALID [2022-04-27 13:17:46,922 INFO L272 TraceCheckUtils]: 183: Hoare triple {79340#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79340#false} is VALID [2022-04-27 13:17:46,922 INFO L290 TraceCheckUtils]: 184: Hoare triple {79340#false} ~cond := #in~cond; {79340#false} is VALID [2022-04-27 13:17:46,922 INFO L290 TraceCheckUtils]: 185: Hoare triple {79340#false} assume 0 == ~cond; {79340#false} is VALID [2022-04-27 13:17:46,922 INFO L290 TraceCheckUtils]: 186: Hoare triple {79340#false} assume !false; {79340#false} is VALID [2022-04-27 13:17:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 60 proven. 1044 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:17:46,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:17:48,301 INFO L290 TraceCheckUtils]: 186: Hoare triple {79340#false} assume !false; {79340#false} is VALID [2022-04-27 13:17:48,301 INFO L290 TraceCheckUtils]: 185: Hoare triple {79340#false} assume 0 == ~cond; {79340#false} is VALID [2022-04-27 13:17:48,301 INFO L290 TraceCheckUtils]: 184: Hoare triple {79340#false} ~cond := #in~cond; {79340#false} is VALID [2022-04-27 13:17:48,301 INFO L272 TraceCheckUtils]: 183: Hoare triple {79340#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79340#false} is VALID [2022-04-27 13:17:48,301 INFO L290 TraceCheckUtils]: 182: Hoare triple {79340#false} assume !(#t~post6 < 100);havoc #t~post6; {79340#false} is VALID [2022-04-27 13:17:48,301 INFO L290 TraceCheckUtils]: 181: Hoare triple {79340#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79340#false} is VALID [2022-04-27 13:17:48,301 INFO L290 TraceCheckUtils]: 180: Hoare triple {79340#false} assume !(#t~post8 < 100);havoc #t~post8; {79340#false} is VALID [2022-04-27 13:17:48,301 INFO L290 TraceCheckUtils]: 179: Hoare triple {79340#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79340#false} is VALID [2022-04-27 13:17:48,301 INFO L290 TraceCheckUtils]: 178: Hoare triple {79948#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {79340#false} is VALID [2022-04-27 13:17:48,302 INFO L290 TraceCheckUtils]: 177: Hoare triple {79952#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79948#(< |main_#t~post7| 100)} is VALID [2022-04-27 13:17:48,302 INFO L290 TraceCheckUtils]: 176: Hoare triple {79952#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79952#(< ~counter~0 100)} is VALID [2022-04-27 13:17:48,302 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {79339#true} {79952#(< ~counter~0 100)} #96#return; {79952#(< ~counter~0 100)} is VALID [2022-04-27 13:17:48,303 INFO L290 TraceCheckUtils]: 174: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,303 INFO L290 TraceCheckUtils]: 173: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,303 INFO L290 TraceCheckUtils]: 172: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,303 INFO L272 TraceCheckUtils]: 171: Hoare triple {79952#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,303 INFO L290 TraceCheckUtils]: 170: Hoare triple {79952#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {79952#(< ~counter~0 100)} is VALID [2022-04-27 13:17:48,304 INFO L290 TraceCheckUtils]: 169: Hoare triple {79977#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79952#(< ~counter~0 100)} is VALID [2022-04-27 13:17:48,305 INFO L290 TraceCheckUtils]: 168: Hoare triple {79977#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {79977#(< ~counter~0 99)} is VALID [2022-04-27 13:17:48,305 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {79339#true} {79977#(< ~counter~0 99)} #96#return; {79977#(< ~counter~0 99)} is VALID [2022-04-27 13:17:48,305 INFO L290 TraceCheckUtils]: 166: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,305 INFO L290 TraceCheckUtils]: 165: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,305 INFO L290 TraceCheckUtils]: 164: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,305 INFO L272 TraceCheckUtils]: 163: Hoare triple {79977#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,306 INFO L290 TraceCheckUtils]: 162: Hoare triple {79977#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {79977#(< ~counter~0 99)} is VALID [2022-04-27 13:17:48,306 INFO L290 TraceCheckUtils]: 161: Hoare triple {80002#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79977#(< ~counter~0 99)} is VALID [2022-04-27 13:17:48,307 INFO L290 TraceCheckUtils]: 160: Hoare triple {80002#(< ~counter~0 98)} assume !!(0 != ~r~0); {80002#(< ~counter~0 98)} is VALID [2022-04-27 13:17:48,307 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {79339#true} {80002#(< ~counter~0 98)} #94#return; {80002#(< ~counter~0 98)} is VALID [2022-04-27 13:17:48,307 INFO L290 TraceCheckUtils]: 158: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,307 INFO L290 TraceCheckUtils]: 157: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,307 INFO L290 TraceCheckUtils]: 156: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,307 INFO L272 TraceCheckUtils]: 155: Hoare triple {80002#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,308 INFO L290 TraceCheckUtils]: 154: Hoare triple {80002#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {80002#(< ~counter~0 98)} is VALID [2022-04-27 13:17:48,308 INFO L290 TraceCheckUtils]: 153: Hoare triple {80027#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80002#(< ~counter~0 98)} is VALID [2022-04-27 13:17:48,309 INFO L290 TraceCheckUtils]: 152: Hoare triple {80027#(< ~counter~0 97)} assume !(~r~0 < 0); {80027#(< ~counter~0 97)} is VALID [2022-04-27 13:17:48,309 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {79339#true} {80027#(< ~counter~0 97)} #98#return; {80027#(< ~counter~0 97)} is VALID [2022-04-27 13:17:48,309 INFO L290 TraceCheckUtils]: 150: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,309 INFO L290 TraceCheckUtils]: 149: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,309 INFO L290 TraceCheckUtils]: 148: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,309 INFO L272 TraceCheckUtils]: 147: Hoare triple {80027#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,310 INFO L290 TraceCheckUtils]: 146: Hoare triple {80027#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {80027#(< ~counter~0 97)} is VALID [2022-04-27 13:17:48,310 INFO L290 TraceCheckUtils]: 145: Hoare triple {80052#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80027#(< ~counter~0 97)} is VALID [2022-04-27 13:17:48,311 INFO L290 TraceCheckUtils]: 144: Hoare triple {80052#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80052#(< ~counter~0 96)} is VALID [2022-04-27 13:17:48,311 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {79339#true} {80052#(< ~counter~0 96)} #98#return; {80052#(< ~counter~0 96)} is VALID [2022-04-27 13:17:48,311 INFO L290 TraceCheckUtils]: 142: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,311 INFO L290 TraceCheckUtils]: 141: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,311 INFO L290 TraceCheckUtils]: 140: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,311 INFO L272 TraceCheckUtils]: 139: Hoare triple {80052#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,312 INFO L290 TraceCheckUtils]: 138: Hoare triple {80052#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {80052#(< ~counter~0 96)} is VALID [2022-04-27 13:17:48,312 INFO L290 TraceCheckUtils]: 137: Hoare triple {80077#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80052#(< ~counter~0 96)} is VALID [2022-04-27 13:17:48,313 INFO L290 TraceCheckUtils]: 136: Hoare triple {80077#(< ~counter~0 95)} assume !(~r~0 > 0); {80077#(< ~counter~0 95)} is VALID [2022-04-27 13:17:48,313 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {79339#true} {80077#(< ~counter~0 95)} #96#return; {80077#(< ~counter~0 95)} is VALID [2022-04-27 13:17:48,313 INFO L290 TraceCheckUtils]: 134: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,313 INFO L290 TraceCheckUtils]: 133: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,313 INFO L290 TraceCheckUtils]: 132: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,313 INFO L272 TraceCheckUtils]: 131: Hoare triple {80077#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,315 INFO L290 TraceCheckUtils]: 130: Hoare triple {80077#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {80077#(< ~counter~0 95)} is VALID [2022-04-27 13:17:48,317 INFO L290 TraceCheckUtils]: 129: Hoare triple {80102#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80077#(< ~counter~0 95)} is VALID [2022-04-27 13:17:48,317 INFO L290 TraceCheckUtils]: 128: Hoare triple {80102#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80102#(< ~counter~0 94)} is VALID [2022-04-27 13:17:48,318 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {79339#true} {80102#(< ~counter~0 94)} #96#return; {80102#(< ~counter~0 94)} is VALID [2022-04-27 13:17:48,318 INFO L290 TraceCheckUtils]: 126: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,318 INFO L290 TraceCheckUtils]: 125: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,318 INFO L290 TraceCheckUtils]: 124: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,318 INFO L272 TraceCheckUtils]: 123: Hoare triple {80102#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,319 INFO L290 TraceCheckUtils]: 122: Hoare triple {80102#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {80102#(< ~counter~0 94)} is VALID [2022-04-27 13:17:48,320 INFO L290 TraceCheckUtils]: 121: Hoare triple {80127#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80102#(< ~counter~0 94)} is VALID [2022-04-27 13:17:48,320 INFO L290 TraceCheckUtils]: 120: Hoare triple {80127#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80127#(< ~counter~0 93)} is VALID [2022-04-27 13:17:48,321 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {79339#true} {80127#(< ~counter~0 93)} #96#return; {80127#(< ~counter~0 93)} is VALID [2022-04-27 13:17:48,321 INFO L290 TraceCheckUtils]: 118: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,321 INFO L290 TraceCheckUtils]: 117: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,321 INFO L290 TraceCheckUtils]: 116: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,321 INFO L272 TraceCheckUtils]: 115: Hoare triple {80127#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,322 INFO L290 TraceCheckUtils]: 114: Hoare triple {80127#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {80127#(< ~counter~0 93)} is VALID [2022-04-27 13:17:48,323 INFO L290 TraceCheckUtils]: 113: Hoare triple {80152#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80127#(< ~counter~0 93)} is VALID [2022-04-27 13:17:48,323 INFO L290 TraceCheckUtils]: 112: Hoare triple {80152#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80152#(< ~counter~0 92)} is VALID [2022-04-27 13:17:48,324 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79339#true} {80152#(< ~counter~0 92)} #96#return; {80152#(< ~counter~0 92)} is VALID [2022-04-27 13:17:48,324 INFO L290 TraceCheckUtils]: 110: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,324 INFO L290 TraceCheckUtils]: 109: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,324 INFO L290 TraceCheckUtils]: 108: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,324 INFO L272 TraceCheckUtils]: 107: Hoare triple {80152#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,324 INFO L290 TraceCheckUtils]: 106: Hoare triple {80152#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {80152#(< ~counter~0 92)} is VALID [2022-04-27 13:17:48,325 INFO L290 TraceCheckUtils]: 105: Hoare triple {80177#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80152#(< ~counter~0 92)} is VALID [2022-04-27 13:17:48,325 INFO L290 TraceCheckUtils]: 104: Hoare triple {80177#(< ~counter~0 91)} assume !!(0 != ~r~0); {80177#(< ~counter~0 91)} is VALID [2022-04-27 13:17:48,326 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79339#true} {80177#(< ~counter~0 91)} #94#return; {80177#(< ~counter~0 91)} is VALID [2022-04-27 13:17:48,326 INFO L290 TraceCheckUtils]: 102: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,326 INFO L290 TraceCheckUtils]: 101: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,326 INFO L290 TraceCheckUtils]: 100: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,326 INFO L272 TraceCheckUtils]: 99: Hoare triple {80177#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,326 INFO L290 TraceCheckUtils]: 98: Hoare triple {80177#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {80177#(< ~counter~0 91)} is VALID [2022-04-27 13:17:48,327 INFO L290 TraceCheckUtils]: 97: Hoare triple {80202#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80177#(< ~counter~0 91)} is VALID [2022-04-27 13:17:48,327 INFO L290 TraceCheckUtils]: 96: Hoare triple {80202#(< ~counter~0 90)} assume !(~r~0 < 0); {80202#(< ~counter~0 90)} is VALID [2022-04-27 13:17:48,328 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79339#true} {80202#(< ~counter~0 90)} #98#return; {80202#(< ~counter~0 90)} is VALID [2022-04-27 13:17:48,328 INFO L290 TraceCheckUtils]: 94: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,328 INFO L290 TraceCheckUtils]: 93: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,328 INFO L290 TraceCheckUtils]: 92: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,328 INFO L272 TraceCheckUtils]: 91: Hoare triple {80202#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,328 INFO L290 TraceCheckUtils]: 90: Hoare triple {80202#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {80202#(< ~counter~0 90)} is VALID [2022-04-27 13:17:48,329 INFO L290 TraceCheckUtils]: 89: Hoare triple {80227#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80202#(< ~counter~0 90)} is VALID [2022-04-27 13:17:48,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {80227#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80227#(< ~counter~0 89)} is VALID [2022-04-27 13:17:48,330 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79339#true} {80227#(< ~counter~0 89)} #98#return; {80227#(< ~counter~0 89)} is VALID [2022-04-27 13:17:48,330 INFO L290 TraceCheckUtils]: 86: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,330 INFO L290 TraceCheckUtils]: 85: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,330 INFO L290 TraceCheckUtils]: 84: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,330 INFO L272 TraceCheckUtils]: 83: Hoare triple {80227#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,330 INFO L290 TraceCheckUtils]: 82: Hoare triple {80227#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {80227#(< ~counter~0 89)} is VALID [2022-04-27 13:17:48,331 INFO L290 TraceCheckUtils]: 81: Hoare triple {80252#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80227#(< ~counter~0 89)} is VALID [2022-04-27 13:17:48,332 INFO L290 TraceCheckUtils]: 80: Hoare triple {80252#(< ~counter~0 88)} assume !(~r~0 > 0); {80252#(< ~counter~0 88)} is VALID [2022-04-27 13:17:48,332 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79339#true} {80252#(< ~counter~0 88)} #96#return; {80252#(< ~counter~0 88)} is VALID [2022-04-27 13:17:48,332 INFO L290 TraceCheckUtils]: 78: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,332 INFO L290 TraceCheckUtils]: 77: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,332 INFO L272 TraceCheckUtils]: 75: Hoare triple {80252#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,333 INFO L290 TraceCheckUtils]: 74: Hoare triple {80252#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {80252#(< ~counter~0 88)} is VALID [2022-04-27 13:17:48,333 INFO L290 TraceCheckUtils]: 73: Hoare triple {80277#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80252#(< ~counter~0 88)} is VALID [2022-04-27 13:17:48,334 INFO L290 TraceCheckUtils]: 72: Hoare triple {80277#(< ~counter~0 87)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80277#(< ~counter~0 87)} is VALID [2022-04-27 13:17:48,334 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79339#true} {80277#(< ~counter~0 87)} #96#return; {80277#(< ~counter~0 87)} is VALID [2022-04-27 13:17:48,334 INFO L290 TraceCheckUtils]: 70: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,334 INFO L272 TraceCheckUtils]: 67: Hoare triple {80277#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,335 INFO L290 TraceCheckUtils]: 66: Hoare triple {80277#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {80277#(< ~counter~0 87)} is VALID [2022-04-27 13:17:48,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {80302#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80277#(< ~counter~0 87)} is VALID [2022-04-27 13:17:48,336 INFO L290 TraceCheckUtils]: 64: Hoare triple {80302#(< ~counter~0 86)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80302#(< ~counter~0 86)} is VALID [2022-04-27 13:17:48,336 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79339#true} {80302#(< ~counter~0 86)} #96#return; {80302#(< ~counter~0 86)} is VALID [2022-04-27 13:17:48,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,336 INFO L272 TraceCheckUtils]: 59: Hoare triple {80302#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {80302#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {80302#(< ~counter~0 86)} is VALID [2022-04-27 13:17:48,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {80327#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80302#(< ~counter~0 86)} is VALID [2022-04-27 13:17:48,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {80327#(< ~counter~0 85)} assume !!(0 != ~r~0); {80327#(< ~counter~0 85)} is VALID [2022-04-27 13:17:48,338 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79339#true} {80327#(< ~counter~0 85)} #94#return; {80327#(< ~counter~0 85)} is VALID [2022-04-27 13:17:48,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,339 INFO L272 TraceCheckUtils]: 51: Hoare triple {80327#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,339 INFO L290 TraceCheckUtils]: 50: Hoare triple {80327#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {80327#(< ~counter~0 85)} is VALID [2022-04-27 13:17:48,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {80352#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80327#(< ~counter~0 85)} is VALID [2022-04-27 13:17:48,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {80352#(< ~counter~0 84)} assume !(~r~0 < 0); {80352#(< ~counter~0 84)} is VALID [2022-04-27 13:17:48,341 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79339#true} {80352#(< ~counter~0 84)} #98#return; {80352#(< ~counter~0 84)} is VALID [2022-04-27 13:17:48,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,341 INFO L272 TraceCheckUtils]: 43: Hoare triple {80352#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {80352#(< ~counter~0 84)} assume !!(#t~post8 < 100);havoc #t~post8; {80352#(< ~counter~0 84)} is VALID [2022-04-27 13:17:48,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {80377#(< ~counter~0 83)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80352#(< ~counter~0 84)} is VALID [2022-04-27 13:17:48,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {80377#(< ~counter~0 83)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80377#(< ~counter~0 83)} is VALID [2022-04-27 13:17:48,343 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79339#true} {80377#(< ~counter~0 83)} #98#return; {80377#(< ~counter~0 83)} is VALID [2022-04-27 13:17:48,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,343 INFO L272 TraceCheckUtils]: 35: Hoare triple {80377#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {80377#(< ~counter~0 83)} assume !!(#t~post8 < 100);havoc #t~post8; {80377#(< ~counter~0 83)} is VALID [2022-04-27 13:17:48,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {80402#(< ~counter~0 82)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80377#(< ~counter~0 83)} is VALID [2022-04-27 13:17:48,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {80402#(< ~counter~0 82)} assume !(~r~0 > 0); {80402#(< ~counter~0 82)} is VALID [2022-04-27 13:17:48,345 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79339#true} {80402#(< ~counter~0 82)} #96#return; {80402#(< ~counter~0 82)} is VALID [2022-04-27 13:17:48,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,345 INFO L272 TraceCheckUtils]: 27: Hoare triple {80402#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {80402#(< ~counter~0 82)} assume !!(#t~post7 < 100);havoc #t~post7; {80402#(< ~counter~0 82)} is VALID [2022-04-27 13:17:48,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {80427#(< ~counter~0 81)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80402#(< ~counter~0 82)} is VALID [2022-04-27 13:17:48,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {80427#(< ~counter~0 81)} assume !!(0 != ~r~0); {80427#(< ~counter~0 81)} is VALID [2022-04-27 13:17:48,347 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79339#true} {80427#(< ~counter~0 81)} #94#return; {80427#(< ~counter~0 81)} is VALID [2022-04-27 13:17:48,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,347 INFO L272 TraceCheckUtils]: 19: Hoare triple {80427#(< ~counter~0 81)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {80427#(< ~counter~0 81)} assume !!(#t~post6 < 100);havoc #t~post6; {80427#(< ~counter~0 81)} is VALID [2022-04-27 13:17:48,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {80452#(< ~counter~0 80)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80427#(< ~counter~0 81)} is VALID [2022-04-27 13:17:48,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {80452#(< ~counter~0 80)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {80452#(< ~counter~0 80)} is VALID [2022-04-27 13:17:48,349 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79339#true} {80452#(< ~counter~0 80)} #92#return; {80452#(< ~counter~0 80)} is VALID [2022-04-27 13:17:48,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,349 INFO L272 TraceCheckUtils]: 11: Hoare triple {80452#(< ~counter~0 80)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,350 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79339#true} {80452#(< ~counter~0 80)} #90#return; {80452#(< ~counter~0 80)} is VALID [2022-04-27 13:17:48,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-27 13:17:48,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-27 13:17:48,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-27 13:17:48,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {80452#(< ~counter~0 80)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {79339#true} is VALID [2022-04-27 13:17:48,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {80452#(< ~counter~0 80)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {80452#(< ~counter~0 80)} is VALID [2022-04-27 13:17:48,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {80452#(< ~counter~0 80)} call #t~ret9 := main(); {80452#(< ~counter~0 80)} is VALID [2022-04-27 13:17:48,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80452#(< ~counter~0 80)} {79339#true} #102#return; {80452#(< ~counter~0 80)} is VALID [2022-04-27 13:17:48,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {80452#(< ~counter~0 80)} assume true; {80452#(< ~counter~0 80)} is VALID [2022-04-27 13:17:48,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {79339#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {80452#(< ~counter~0 80)} is VALID [2022-04-27 13:17:48,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {79339#true} call ULTIMATE.init(); {79339#true} is VALID [2022-04-27 13:17:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 60 proven. 284 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2022-04-27 13:17:48,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:17:48,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87474087] [2022-04-27 13:17:48,352 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:17:48,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79153615] [2022-04-27 13:17:48,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79153615] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:17:48,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:17:48,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-27 13:17:48,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793759480] [2022-04-27 13:17:48,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:17:48,353 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) Word has length 187 [2022-04-27 13:17:48,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:17:48,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:17:48,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:17:48,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-27 13:17:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:17:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-27 13:17:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-04-27 13:17:48,651 INFO L87 Difference]: Start difference. First operand 2462 states and 3344 transitions. Second operand has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:18:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:15,671 INFO L93 Difference]: Finished difference Result 9906 states and 14925 transitions. [2022-04-27 13:18:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-04-27 13:18:15,672 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) Word has length 187 [2022-04-27 13:18:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:18:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-27 13:18:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:18:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-27 13:18:15,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 956 transitions. [2022-04-27 13:18:16,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 956 edges. 956 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:20,342 INFO L225 Difference]: With dead ends: 9906 [2022-04-27 13:18:20,343 INFO L226 Difference]: Without dead ends: 9897 [2022-04-27 13:18:20,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2691, Invalid=4619, Unknown=0, NotChecked=0, Total=7310 [2022-04-27 13:18:20,346 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 1584 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 1053 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1053 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:20,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 1026 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1053 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 13:18:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9897 states. [2022-04-27 13:18:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9897 to 9645. [2022-04-27 13:18:36,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:36,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9897 states. Second operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) [2022-04-27 13:18:36,999 INFO L74 IsIncluded]: Start isIncluded. First operand 9897 states. Second operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) [2022-04-27 13:18:37,008 INFO L87 Difference]: Start difference. First operand 9897 states. Second operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) [2022-04-27 13:18:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:39,477 INFO L93 Difference]: Finished difference Result 9897 states and 14111 transitions. [2022-04-27 13:18:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 9897 states and 14111 transitions. [2022-04-27 13:18:39,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:39,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:39,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) Second operand 9897 states. [2022-04-27 13:18:39,506 INFO L87 Difference]: Start difference. First operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) Second operand 9897 states. [2022-04-27 13:18:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:42,163 INFO L93 Difference]: Finished difference Result 9897 states and 14111 transitions. [2022-04-27 13:18:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 9897 states and 14111 transitions. [2022-04-27 13:18:42,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:42,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:42,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:42,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9645 states, 7245 states have (on average 1.2641821946169771) internal successors, (9159), 7308 states have internal predecessors, (9159), 2355 states have call successors, (2355), 46 states have call predecessors, (2355), 44 states have return successors, (2353), 2290 states have call predecessors, (2353), 2353 states have call successors, (2353) [2022-04-27 13:18:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9645 states to 9645 states and 13867 transitions. [2022-04-27 13:18:45,661 INFO L78 Accepts]: Start accepts. Automaton has 9645 states and 13867 transitions. Word has length 187 [2022-04-27 13:18:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:45,661 INFO L495 AbstractCegarLoop]: Abstraction has 9645 states and 13867 transitions. [2022-04-27 13:18:45,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.521739130434782) internal successors, (208), 46 states have internal predecessors, (208), 44 states have call successors, (48), 24 states have call predecessors, (48), 23 states have return successors, (46), 42 states have call predecessors, (46), 43 states have call successors, (46) [2022-04-27 13:18:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 9645 states and 13867 transitions. [2022-04-27 13:18:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-27 13:18:45,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:45,668 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 10, 10, 10, 10, 8, 7, 7, 7, 6, 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, 1] [2022-04-27 13:18:45,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:45,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:45,892 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:45,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash 179284923, now seen corresponding path program 2 times [2022-04-27 13:18:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:45,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65678551] [2022-04-27 13:18:45,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:45,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:45,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478232941] [2022-04-27 13:18:45,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:18:45,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:45,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:45,916 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:18:45,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-27 13:18:45,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:18:45,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:18:45,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 13:18:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:46,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:47,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {127992#true} call ULTIMATE.init(); {127992#true} is VALID [2022-04-27 13:18:47,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {127992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {128000#(<= ~counter~0 0)} assume true; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128000#(<= ~counter~0 0)} {127992#true} #102#return; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {128000#(<= ~counter~0 0)} call #t~ret9 := main(); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {128000#(<= ~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; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,134 INFO L272 TraceCheckUtils]: 6: Hoare triple {128000#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {128000#(<= ~counter~0 0)} ~cond := #in~cond; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {128000#(<= ~counter~0 0)} assume !(0 == ~cond); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {128000#(<= ~counter~0 0)} assume true; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {128000#(<= ~counter~0 0)} {128000#(<= ~counter~0 0)} #90#return; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,140 INFO L272 TraceCheckUtils]: 11: Hoare triple {128000#(<= ~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)); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {128000#(<= ~counter~0 0)} ~cond := #in~cond; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {128000#(<= ~counter~0 0)} assume !(0 == ~cond); {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {128000#(<= ~counter~0 0)} assume true; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,142 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {128000#(<= ~counter~0 0)} {128000#(<= ~counter~0 0)} #92#return; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {128000#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {128000#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {128000#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {128049#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,145 INFO L272 TraceCheckUtils]: 19: Hoare triple {128049#(<= ~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)); {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {128049#(<= ~counter~0 1)} ~cond := #in~cond; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {128049#(<= ~counter~0 1)} assume !(0 == ~cond); {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {128049#(<= ~counter~0 1)} assume true; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,147 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {128049#(<= ~counter~0 1)} {128049#(<= ~counter~0 1)} #94#return; {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {128049#(<= ~counter~0 1)} assume !!(0 != ~r~0); {128049#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,149 INFO L290 TraceCheckUtils]: 25: Hoare triple {128049#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {128074#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,150 INFO L272 TraceCheckUtils]: 27: Hoare triple {128074#(<= ~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)); {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {128074#(<= ~counter~0 2)} ~cond := #in~cond; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {128074#(<= ~counter~0 2)} assume !(0 == ~cond); {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {128074#(<= ~counter~0 2)} assume true; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,151 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {128074#(<= ~counter~0 2)} {128074#(<= ~counter~0 2)} #96#return; {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,152 INFO L290 TraceCheckUtils]: 32: Hoare triple {128074#(<= ~counter~0 2)} assume !(~r~0 > 0); {128074#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {128074#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {128099#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,154 INFO L272 TraceCheckUtils]: 35: Hoare triple {128099#(<= ~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)); {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {128099#(<= ~counter~0 3)} ~cond := #in~cond; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {128099#(<= ~counter~0 3)} assume !(0 == ~cond); {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,155 INFO L290 TraceCheckUtils]: 38: Hoare triple {128099#(<= ~counter~0 3)} assume true; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,156 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {128099#(<= ~counter~0 3)} {128099#(<= ~counter~0 3)} #98#return; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {128099#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128099#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {128099#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {128124#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,158 INFO L272 TraceCheckUtils]: 43: Hoare triple {128124#(<= ~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)); {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,159 INFO L290 TraceCheckUtils]: 44: Hoare triple {128124#(<= ~counter~0 4)} ~cond := #in~cond; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,159 INFO L290 TraceCheckUtils]: 45: Hoare triple {128124#(<= ~counter~0 4)} assume !(0 == ~cond); {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {128124#(<= ~counter~0 4)} assume true; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,160 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {128124#(<= ~counter~0 4)} {128124#(<= ~counter~0 4)} #98#return; {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {128124#(<= ~counter~0 4)} assume !(~r~0 < 0); {128124#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {128124#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {128149#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,162 INFO L272 TraceCheckUtils]: 51: Hoare triple {128149#(<= ~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)); {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,163 INFO L290 TraceCheckUtils]: 52: Hoare triple {128149#(<= ~counter~0 5)} ~cond := #in~cond; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {128149#(<= ~counter~0 5)} assume !(0 == ~cond); {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {128149#(<= ~counter~0 5)} assume true; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,164 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {128149#(<= ~counter~0 5)} {128149#(<= ~counter~0 5)} #94#return; {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {128149#(<= ~counter~0 5)} assume !!(0 != ~r~0); {128149#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {128149#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {128174#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,167 INFO L272 TraceCheckUtils]: 59: Hoare triple {128174#(<= ~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)); {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {128174#(<= ~counter~0 6)} ~cond := #in~cond; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {128174#(<= ~counter~0 6)} assume !(0 == ~cond); {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {128174#(<= ~counter~0 6)} assume true; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,168 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {128174#(<= ~counter~0 6)} {128174#(<= ~counter~0 6)} #96#return; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,169 INFO L290 TraceCheckUtils]: 64: Hoare triple {128174#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128174#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {128174#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {128199#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,171 INFO L272 TraceCheckUtils]: 67: Hoare triple {128199#(<= ~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)); {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {128199#(<= ~counter~0 7)} ~cond := #in~cond; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,172 INFO L290 TraceCheckUtils]: 69: Hoare triple {128199#(<= ~counter~0 7)} assume !(0 == ~cond); {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,172 INFO L290 TraceCheckUtils]: 70: Hoare triple {128199#(<= ~counter~0 7)} assume true; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,173 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {128199#(<= ~counter~0 7)} {128199#(<= ~counter~0 7)} #96#return; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,173 INFO L290 TraceCheckUtils]: 72: Hoare triple {128199#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128199#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,174 INFO L290 TraceCheckUtils]: 73: Hoare triple {128199#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,175 INFO L290 TraceCheckUtils]: 74: Hoare triple {128224#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,175 INFO L272 TraceCheckUtils]: 75: Hoare triple {128224#(<= ~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)); {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,176 INFO L290 TraceCheckUtils]: 76: Hoare triple {128224#(<= ~counter~0 8)} ~cond := #in~cond; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,176 INFO L290 TraceCheckUtils]: 77: Hoare triple {128224#(<= ~counter~0 8)} assume !(0 == ~cond); {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,176 INFO L290 TraceCheckUtils]: 78: Hoare triple {128224#(<= ~counter~0 8)} assume true; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,177 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {128224#(<= ~counter~0 8)} {128224#(<= ~counter~0 8)} #96#return; {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {128224#(<= ~counter~0 8)} assume !(~r~0 > 0); {128224#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,179 INFO L290 TraceCheckUtils]: 81: Hoare triple {128224#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,179 INFO L290 TraceCheckUtils]: 82: Hoare triple {128249#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,180 INFO L272 TraceCheckUtils]: 83: Hoare triple {128249#(<= ~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)); {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,180 INFO L290 TraceCheckUtils]: 84: Hoare triple {128249#(<= ~counter~0 9)} ~cond := #in~cond; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,181 INFO L290 TraceCheckUtils]: 85: Hoare triple {128249#(<= ~counter~0 9)} assume !(0 == ~cond); {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,181 INFO L290 TraceCheckUtils]: 86: Hoare triple {128249#(<= ~counter~0 9)} assume true; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,182 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {128249#(<= ~counter~0 9)} {128249#(<= ~counter~0 9)} #98#return; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,182 INFO L290 TraceCheckUtils]: 88: Hoare triple {128249#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128249#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,184 INFO L290 TraceCheckUtils]: 89: Hoare triple {128249#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,184 INFO L290 TraceCheckUtils]: 90: Hoare triple {128274#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,185 INFO L272 TraceCheckUtils]: 91: Hoare triple {128274#(<= ~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)); {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,185 INFO L290 TraceCheckUtils]: 92: Hoare triple {128274#(<= ~counter~0 10)} ~cond := #in~cond; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,185 INFO L290 TraceCheckUtils]: 93: Hoare triple {128274#(<= ~counter~0 10)} assume !(0 == ~cond); {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,186 INFO L290 TraceCheckUtils]: 94: Hoare triple {128274#(<= ~counter~0 10)} assume true; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,186 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {128274#(<= ~counter~0 10)} {128274#(<= ~counter~0 10)} #98#return; {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,187 INFO L290 TraceCheckUtils]: 96: Hoare triple {128274#(<= ~counter~0 10)} assume !(~r~0 < 0); {128274#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,188 INFO L290 TraceCheckUtils]: 97: Hoare triple {128274#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,188 INFO L290 TraceCheckUtils]: 98: Hoare triple {128299#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,189 INFO L272 TraceCheckUtils]: 99: Hoare triple {128299#(<= ~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)); {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,189 INFO L290 TraceCheckUtils]: 100: Hoare triple {128299#(<= ~counter~0 11)} ~cond := #in~cond; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,190 INFO L290 TraceCheckUtils]: 101: Hoare triple {128299#(<= ~counter~0 11)} assume !(0 == ~cond); {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,190 INFO L290 TraceCheckUtils]: 102: Hoare triple {128299#(<= ~counter~0 11)} assume true; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,191 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {128299#(<= ~counter~0 11)} {128299#(<= ~counter~0 11)} #94#return; {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,191 INFO L290 TraceCheckUtils]: 104: Hoare triple {128299#(<= ~counter~0 11)} assume !!(0 != ~r~0); {128299#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,192 INFO L290 TraceCheckUtils]: 105: Hoare triple {128299#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,193 INFO L290 TraceCheckUtils]: 106: Hoare triple {128324#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,193 INFO L272 TraceCheckUtils]: 107: Hoare triple {128324#(<= ~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)); {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,194 INFO L290 TraceCheckUtils]: 108: Hoare triple {128324#(<= ~counter~0 12)} ~cond := #in~cond; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,194 INFO L290 TraceCheckUtils]: 109: Hoare triple {128324#(<= ~counter~0 12)} assume !(0 == ~cond); {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,194 INFO L290 TraceCheckUtils]: 110: Hoare triple {128324#(<= ~counter~0 12)} assume true; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,195 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {128324#(<= ~counter~0 12)} {128324#(<= ~counter~0 12)} #96#return; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,195 INFO L290 TraceCheckUtils]: 112: Hoare triple {128324#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128324#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,197 INFO L290 TraceCheckUtils]: 113: Hoare triple {128324#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,197 INFO L290 TraceCheckUtils]: 114: Hoare triple {128349#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,198 INFO L272 TraceCheckUtils]: 115: Hoare triple {128349#(<= ~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)); {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,198 INFO L290 TraceCheckUtils]: 116: Hoare triple {128349#(<= ~counter~0 13)} ~cond := #in~cond; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,198 INFO L290 TraceCheckUtils]: 117: Hoare triple {128349#(<= ~counter~0 13)} assume !(0 == ~cond); {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,199 INFO L290 TraceCheckUtils]: 118: Hoare triple {128349#(<= ~counter~0 13)} assume true; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,199 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {128349#(<= ~counter~0 13)} {128349#(<= ~counter~0 13)} #96#return; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,200 INFO L290 TraceCheckUtils]: 120: Hoare triple {128349#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128349#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,201 INFO L290 TraceCheckUtils]: 121: Hoare triple {128349#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,201 INFO L290 TraceCheckUtils]: 122: Hoare triple {128374#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,202 INFO L272 TraceCheckUtils]: 123: Hoare triple {128374#(<= ~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)); {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,202 INFO L290 TraceCheckUtils]: 124: Hoare triple {128374#(<= ~counter~0 14)} ~cond := #in~cond; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,203 INFO L290 TraceCheckUtils]: 125: Hoare triple {128374#(<= ~counter~0 14)} assume !(0 == ~cond); {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,203 INFO L290 TraceCheckUtils]: 126: Hoare triple {128374#(<= ~counter~0 14)} assume true; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,203 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {128374#(<= ~counter~0 14)} {128374#(<= ~counter~0 14)} #96#return; {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,204 INFO L290 TraceCheckUtils]: 128: Hoare triple {128374#(<= ~counter~0 14)} assume !(~r~0 > 0); {128374#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,205 INFO L290 TraceCheckUtils]: 129: Hoare triple {128374#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,206 INFO L290 TraceCheckUtils]: 130: Hoare triple {128399#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,206 INFO L272 TraceCheckUtils]: 131: Hoare triple {128399#(<= ~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)); {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,207 INFO L290 TraceCheckUtils]: 132: Hoare triple {128399#(<= ~counter~0 15)} ~cond := #in~cond; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,207 INFO L290 TraceCheckUtils]: 133: Hoare triple {128399#(<= ~counter~0 15)} assume !(0 == ~cond); {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,207 INFO L290 TraceCheckUtils]: 134: Hoare triple {128399#(<= ~counter~0 15)} assume true; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,208 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {128399#(<= ~counter~0 15)} {128399#(<= ~counter~0 15)} #98#return; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,208 INFO L290 TraceCheckUtils]: 136: Hoare triple {128399#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128399#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,209 INFO L290 TraceCheckUtils]: 137: Hoare triple {128399#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,210 INFO L290 TraceCheckUtils]: 138: Hoare triple {128424#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,210 INFO L272 TraceCheckUtils]: 139: Hoare triple {128424#(<= ~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)); {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,211 INFO L290 TraceCheckUtils]: 140: Hoare triple {128424#(<= ~counter~0 16)} ~cond := #in~cond; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,211 INFO L290 TraceCheckUtils]: 141: Hoare triple {128424#(<= ~counter~0 16)} assume !(0 == ~cond); {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,211 INFO L290 TraceCheckUtils]: 142: Hoare triple {128424#(<= ~counter~0 16)} assume true; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,212 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {128424#(<= ~counter~0 16)} {128424#(<= ~counter~0 16)} #98#return; {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,212 INFO L290 TraceCheckUtils]: 144: Hoare triple {128424#(<= ~counter~0 16)} assume !(~r~0 < 0); {128424#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,214 INFO L290 TraceCheckUtils]: 145: Hoare triple {128424#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,214 INFO L290 TraceCheckUtils]: 146: Hoare triple {128449#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,215 INFO L272 TraceCheckUtils]: 147: Hoare triple {128449#(<= ~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)); {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,215 INFO L290 TraceCheckUtils]: 148: Hoare triple {128449#(<= ~counter~0 17)} ~cond := #in~cond; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,215 INFO L290 TraceCheckUtils]: 149: Hoare triple {128449#(<= ~counter~0 17)} assume !(0 == ~cond); {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,216 INFO L290 TraceCheckUtils]: 150: Hoare triple {128449#(<= ~counter~0 17)} assume true; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,216 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {128449#(<= ~counter~0 17)} {128449#(<= ~counter~0 17)} #94#return; {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,217 INFO L290 TraceCheckUtils]: 152: Hoare triple {128449#(<= ~counter~0 17)} assume !!(0 != ~r~0); {128449#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,218 INFO L290 TraceCheckUtils]: 153: Hoare triple {128449#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,218 INFO L290 TraceCheckUtils]: 154: Hoare triple {128474#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,219 INFO L272 TraceCheckUtils]: 155: Hoare triple {128474#(<= ~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)); {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,219 INFO L290 TraceCheckUtils]: 156: Hoare triple {128474#(<= ~counter~0 18)} ~cond := #in~cond; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,220 INFO L290 TraceCheckUtils]: 157: Hoare triple {128474#(<= ~counter~0 18)} assume !(0 == ~cond); {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,220 INFO L290 TraceCheckUtils]: 158: Hoare triple {128474#(<= ~counter~0 18)} assume true; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,221 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {128474#(<= ~counter~0 18)} {128474#(<= ~counter~0 18)} #96#return; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,221 INFO L290 TraceCheckUtils]: 160: Hoare triple {128474#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128474#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,222 INFO L290 TraceCheckUtils]: 161: Hoare triple {128474#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,222 INFO L290 TraceCheckUtils]: 162: Hoare triple {128499#(<= ~counter~0 19)} assume !!(#t~post7 < 100);havoc #t~post7; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,223 INFO L272 TraceCheckUtils]: 163: Hoare triple {128499#(<= ~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)); {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,223 INFO L290 TraceCheckUtils]: 164: Hoare triple {128499#(<= ~counter~0 19)} ~cond := #in~cond; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,224 INFO L290 TraceCheckUtils]: 165: Hoare triple {128499#(<= ~counter~0 19)} assume !(0 == ~cond); {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,224 INFO L290 TraceCheckUtils]: 166: Hoare triple {128499#(<= ~counter~0 19)} assume true; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,225 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {128499#(<= ~counter~0 19)} {128499#(<= ~counter~0 19)} #96#return; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,225 INFO L290 TraceCheckUtils]: 168: Hoare triple {128499#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128499#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,226 INFO L290 TraceCheckUtils]: 169: Hoare triple {128499#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,226 INFO L290 TraceCheckUtils]: 170: Hoare triple {128524#(<= ~counter~0 20)} assume !!(#t~post7 < 100);havoc #t~post7; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,227 INFO L272 TraceCheckUtils]: 171: Hoare triple {128524#(<= ~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)); {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,227 INFO L290 TraceCheckUtils]: 172: Hoare triple {128524#(<= ~counter~0 20)} ~cond := #in~cond; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,228 INFO L290 TraceCheckUtils]: 173: Hoare triple {128524#(<= ~counter~0 20)} assume !(0 == ~cond); {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,228 INFO L290 TraceCheckUtils]: 174: Hoare triple {128524#(<= ~counter~0 20)} assume true; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,229 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {128524#(<= ~counter~0 20)} {128524#(<= ~counter~0 20)} #96#return; {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,229 INFO L290 TraceCheckUtils]: 176: Hoare triple {128524#(<= ~counter~0 20)} assume !(~r~0 > 0); {128524#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,230 INFO L290 TraceCheckUtils]: 177: Hoare triple {128524#(<= ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,230 INFO L290 TraceCheckUtils]: 178: Hoare triple {128549#(<= ~counter~0 21)} assume !!(#t~post8 < 100);havoc #t~post8; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,231 INFO L272 TraceCheckUtils]: 179: Hoare triple {128549#(<= ~counter~0 21)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,231 INFO L290 TraceCheckUtils]: 180: Hoare triple {128549#(<= ~counter~0 21)} ~cond := #in~cond; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,231 INFO L290 TraceCheckUtils]: 181: Hoare triple {128549#(<= ~counter~0 21)} assume !(0 == ~cond); {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,231 INFO L290 TraceCheckUtils]: 182: Hoare triple {128549#(<= ~counter~0 21)} assume true; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,232 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {128549#(<= ~counter~0 21)} {128549#(<= ~counter~0 21)} #98#return; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,232 INFO L290 TraceCheckUtils]: 184: Hoare triple {128549#(<= ~counter~0 21)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128549#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,232 INFO L290 TraceCheckUtils]: 185: Hoare triple {128549#(<= ~counter~0 21)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128574#(<= |main_#t~post8| 21)} is VALID [2022-04-27 13:18:47,233 INFO L290 TraceCheckUtils]: 186: Hoare triple {128574#(<= |main_#t~post8| 21)} assume !(#t~post8 < 100);havoc #t~post8; {127993#false} is VALID [2022-04-27 13:18:47,233 INFO L290 TraceCheckUtils]: 187: Hoare triple {127993#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127993#false} is VALID [2022-04-27 13:18:47,233 INFO L290 TraceCheckUtils]: 188: Hoare triple {127993#false} assume !(#t~post6 < 100);havoc #t~post6; {127993#false} is VALID [2022-04-27 13:18:47,233 INFO L272 TraceCheckUtils]: 189: Hoare triple {127993#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127993#false} is VALID [2022-04-27 13:18:47,233 INFO L290 TraceCheckUtils]: 190: Hoare triple {127993#false} ~cond := #in~cond; {127993#false} is VALID [2022-04-27 13:18:47,233 INFO L290 TraceCheckUtils]: 191: Hoare triple {127993#false} assume 0 == ~cond; {127993#false} is VALID [2022-04-27 13:18:47,233 INFO L290 TraceCheckUtils]: 192: Hoare triple {127993#false} assume !false; {127993#false} is VALID [2022-04-27 13:18:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 50 proven. 1142 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:47,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:48,759 INFO L290 TraceCheckUtils]: 192: Hoare triple {127993#false} assume !false; {127993#false} is VALID [2022-04-27 13:18:48,759 INFO L290 TraceCheckUtils]: 191: Hoare triple {127993#false} assume 0 == ~cond; {127993#false} is VALID [2022-04-27 13:18:48,759 INFO L290 TraceCheckUtils]: 190: Hoare triple {127993#false} ~cond := #in~cond; {127993#false} is VALID [2022-04-27 13:18:48,759 INFO L272 TraceCheckUtils]: 189: Hoare triple {127993#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127993#false} is VALID [2022-04-27 13:18:48,759 INFO L290 TraceCheckUtils]: 188: Hoare triple {127993#false} assume !(#t~post6 < 100);havoc #t~post6; {127993#false} is VALID [2022-04-27 13:18:48,759 INFO L290 TraceCheckUtils]: 187: Hoare triple {127993#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127993#false} is VALID [2022-04-27 13:18:48,759 INFO L290 TraceCheckUtils]: 186: Hoare triple {128614#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {127993#false} is VALID [2022-04-27 13:18:48,760 INFO L290 TraceCheckUtils]: 185: Hoare triple {128618#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128614#(< |main_#t~post8| 100)} is VALID [2022-04-27 13:18:48,760 INFO L290 TraceCheckUtils]: 184: Hoare triple {128618#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128618#(< ~counter~0 100)} is VALID [2022-04-27 13:18:48,760 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {127992#true} {128618#(< ~counter~0 100)} #98#return; {128618#(< ~counter~0 100)} is VALID [2022-04-27 13:18:48,760 INFO L290 TraceCheckUtils]: 182: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,761 INFO L290 TraceCheckUtils]: 181: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,761 INFO L290 TraceCheckUtils]: 180: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,761 INFO L272 TraceCheckUtils]: 179: Hoare triple {128618#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,761 INFO L290 TraceCheckUtils]: 178: Hoare triple {128618#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {128618#(< ~counter~0 100)} is VALID [2022-04-27 13:18:48,762 INFO L290 TraceCheckUtils]: 177: Hoare triple {128643#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128618#(< ~counter~0 100)} is VALID [2022-04-27 13:18:48,763 INFO L290 TraceCheckUtils]: 176: Hoare triple {128643#(< ~counter~0 99)} assume !(~r~0 > 0); {128643#(< ~counter~0 99)} is VALID [2022-04-27 13:18:48,763 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {127992#true} {128643#(< ~counter~0 99)} #96#return; {128643#(< ~counter~0 99)} is VALID [2022-04-27 13:18:48,763 INFO L290 TraceCheckUtils]: 174: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,763 INFO L290 TraceCheckUtils]: 173: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,763 INFO L290 TraceCheckUtils]: 172: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,764 INFO L272 TraceCheckUtils]: 171: Hoare triple {128643#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,764 INFO L290 TraceCheckUtils]: 170: Hoare triple {128643#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {128643#(< ~counter~0 99)} is VALID [2022-04-27 13:18:48,765 INFO L290 TraceCheckUtils]: 169: Hoare triple {128668#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128643#(< ~counter~0 99)} is VALID [2022-04-27 13:18:48,765 INFO L290 TraceCheckUtils]: 168: Hoare triple {128668#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128668#(< ~counter~0 98)} is VALID [2022-04-27 13:18:48,765 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {127992#true} {128668#(< ~counter~0 98)} #96#return; {128668#(< ~counter~0 98)} is VALID [2022-04-27 13:18:48,765 INFO L290 TraceCheckUtils]: 166: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,765 INFO L290 TraceCheckUtils]: 165: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,766 INFO L290 TraceCheckUtils]: 164: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,766 INFO L272 TraceCheckUtils]: 163: Hoare triple {128668#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,766 INFO L290 TraceCheckUtils]: 162: Hoare triple {128668#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {128668#(< ~counter~0 98)} is VALID [2022-04-27 13:18:48,767 INFO L290 TraceCheckUtils]: 161: Hoare triple {128693#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128668#(< ~counter~0 98)} is VALID [2022-04-27 13:18:48,767 INFO L290 TraceCheckUtils]: 160: Hoare triple {128693#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128693#(< ~counter~0 97)} is VALID [2022-04-27 13:18:48,767 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {127992#true} {128693#(< ~counter~0 97)} #96#return; {128693#(< ~counter~0 97)} is VALID [2022-04-27 13:18:48,767 INFO L290 TraceCheckUtils]: 158: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,768 INFO L290 TraceCheckUtils]: 157: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,768 INFO L290 TraceCheckUtils]: 156: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,768 INFO L272 TraceCheckUtils]: 155: Hoare triple {128693#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,768 INFO L290 TraceCheckUtils]: 154: Hoare triple {128693#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {128693#(< ~counter~0 97)} is VALID [2022-04-27 13:18:48,769 INFO L290 TraceCheckUtils]: 153: Hoare triple {128718#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128693#(< ~counter~0 97)} is VALID [2022-04-27 13:18:48,769 INFO L290 TraceCheckUtils]: 152: Hoare triple {128718#(< ~counter~0 96)} assume !!(0 != ~r~0); {128718#(< ~counter~0 96)} is VALID [2022-04-27 13:18:48,770 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {127992#true} {128718#(< ~counter~0 96)} #94#return; {128718#(< ~counter~0 96)} is VALID [2022-04-27 13:18:48,770 INFO L290 TraceCheckUtils]: 150: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,770 INFO L290 TraceCheckUtils]: 149: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,770 INFO L290 TraceCheckUtils]: 148: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,770 INFO L272 TraceCheckUtils]: 147: Hoare triple {128718#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,770 INFO L290 TraceCheckUtils]: 146: Hoare triple {128718#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {128718#(< ~counter~0 96)} is VALID [2022-04-27 13:18:48,771 INFO L290 TraceCheckUtils]: 145: Hoare triple {128743#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128718#(< ~counter~0 96)} is VALID [2022-04-27 13:18:48,771 INFO L290 TraceCheckUtils]: 144: Hoare triple {128743#(< ~counter~0 95)} assume !(~r~0 < 0); {128743#(< ~counter~0 95)} is VALID [2022-04-27 13:18:48,772 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {127992#true} {128743#(< ~counter~0 95)} #98#return; {128743#(< ~counter~0 95)} is VALID [2022-04-27 13:18:48,772 INFO L290 TraceCheckUtils]: 142: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,772 INFO L290 TraceCheckUtils]: 141: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,772 INFO L290 TraceCheckUtils]: 140: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,772 INFO L272 TraceCheckUtils]: 139: Hoare triple {128743#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,772 INFO L290 TraceCheckUtils]: 138: Hoare triple {128743#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {128743#(< ~counter~0 95)} is VALID [2022-04-27 13:18:48,773 INFO L290 TraceCheckUtils]: 137: Hoare triple {128768#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128743#(< ~counter~0 95)} is VALID [2022-04-27 13:18:48,773 INFO L290 TraceCheckUtils]: 136: Hoare triple {128768#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128768#(< ~counter~0 94)} is VALID [2022-04-27 13:18:48,774 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {127992#true} {128768#(< ~counter~0 94)} #98#return; {128768#(< ~counter~0 94)} is VALID [2022-04-27 13:18:48,774 INFO L290 TraceCheckUtils]: 134: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,774 INFO L290 TraceCheckUtils]: 133: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,774 INFO L290 TraceCheckUtils]: 132: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,774 INFO L272 TraceCheckUtils]: 131: Hoare triple {128768#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,774 INFO L290 TraceCheckUtils]: 130: Hoare triple {128768#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {128768#(< ~counter~0 94)} is VALID [2022-04-27 13:18:48,775 INFO L290 TraceCheckUtils]: 129: Hoare triple {128793#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128768#(< ~counter~0 94)} is VALID [2022-04-27 13:18:48,775 INFO L290 TraceCheckUtils]: 128: Hoare triple {128793#(< ~counter~0 93)} assume !(~r~0 > 0); {128793#(< ~counter~0 93)} is VALID [2022-04-27 13:18:48,776 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {127992#true} {128793#(< ~counter~0 93)} #96#return; {128793#(< ~counter~0 93)} is VALID [2022-04-27 13:18:48,776 INFO L290 TraceCheckUtils]: 126: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,776 INFO L290 TraceCheckUtils]: 125: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,776 INFO L290 TraceCheckUtils]: 124: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,776 INFO L272 TraceCheckUtils]: 123: Hoare triple {128793#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,776 INFO L290 TraceCheckUtils]: 122: Hoare triple {128793#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {128793#(< ~counter~0 93)} is VALID [2022-04-27 13:18:48,777 INFO L290 TraceCheckUtils]: 121: Hoare triple {128818#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128793#(< ~counter~0 93)} is VALID [2022-04-27 13:18:48,777 INFO L290 TraceCheckUtils]: 120: Hoare triple {128818#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128818#(< ~counter~0 92)} is VALID [2022-04-27 13:18:48,778 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {127992#true} {128818#(< ~counter~0 92)} #96#return; {128818#(< ~counter~0 92)} is VALID [2022-04-27 13:18:48,778 INFO L290 TraceCheckUtils]: 118: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,778 INFO L290 TraceCheckUtils]: 117: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,778 INFO L290 TraceCheckUtils]: 116: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,778 INFO L272 TraceCheckUtils]: 115: Hoare triple {128818#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,778 INFO L290 TraceCheckUtils]: 114: Hoare triple {128818#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {128818#(< ~counter~0 92)} is VALID [2022-04-27 13:18:48,779 INFO L290 TraceCheckUtils]: 113: Hoare triple {128843#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128818#(< ~counter~0 92)} is VALID [2022-04-27 13:18:48,779 INFO L290 TraceCheckUtils]: 112: Hoare triple {128843#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128843#(< ~counter~0 91)} is VALID [2022-04-27 13:18:48,780 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {127992#true} {128843#(< ~counter~0 91)} #96#return; {128843#(< ~counter~0 91)} is VALID [2022-04-27 13:18:48,780 INFO L290 TraceCheckUtils]: 110: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,780 INFO L290 TraceCheckUtils]: 109: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,780 INFO L290 TraceCheckUtils]: 108: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,780 INFO L272 TraceCheckUtils]: 107: Hoare triple {128843#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,780 INFO L290 TraceCheckUtils]: 106: Hoare triple {128843#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {128843#(< ~counter~0 91)} is VALID [2022-04-27 13:18:48,781 INFO L290 TraceCheckUtils]: 105: Hoare triple {128868#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128843#(< ~counter~0 91)} is VALID [2022-04-27 13:18:48,781 INFO L290 TraceCheckUtils]: 104: Hoare triple {128868#(< ~counter~0 90)} assume !!(0 != ~r~0); {128868#(< ~counter~0 90)} is VALID [2022-04-27 13:18:48,782 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {127992#true} {128868#(< ~counter~0 90)} #94#return; {128868#(< ~counter~0 90)} is VALID [2022-04-27 13:18:48,782 INFO L290 TraceCheckUtils]: 102: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,782 INFO L290 TraceCheckUtils]: 101: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,782 INFO L290 TraceCheckUtils]: 100: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,782 INFO L272 TraceCheckUtils]: 99: Hoare triple {128868#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,782 INFO L290 TraceCheckUtils]: 98: Hoare triple {128868#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {128868#(< ~counter~0 90)} is VALID [2022-04-27 13:18:48,783 INFO L290 TraceCheckUtils]: 97: Hoare triple {128893#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128868#(< ~counter~0 90)} is VALID [2022-04-27 13:18:48,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {128893#(< ~counter~0 89)} assume !(~r~0 < 0); {128893#(< ~counter~0 89)} is VALID [2022-04-27 13:18:48,784 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {127992#true} {128893#(< ~counter~0 89)} #98#return; {128893#(< ~counter~0 89)} is VALID [2022-04-27 13:18:48,784 INFO L290 TraceCheckUtils]: 94: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,784 INFO L290 TraceCheckUtils]: 93: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,784 INFO L290 TraceCheckUtils]: 92: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,784 INFO L272 TraceCheckUtils]: 91: Hoare triple {128893#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,784 INFO L290 TraceCheckUtils]: 90: Hoare triple {128893#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {128893#(< ~counter~0 89)} is VALID [2022-04-27 13:18:48,785 INFO L290 TraceCheckUtils]: 89: Hoare triple {128918#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128893#(< ~counter~0 89)} is VALID [2022-04-27 13:18:48,785 INFO L290 TraceCheckUtils]: 88: Hoare triple {128918#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128918#(< ~counter~0 88)} is VALID [2022-04-27 13:18:48,786 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {127992#true} {128918#(< ~counter~0 88)} #98#return; {128918#(< ~counter~0 88)} is VALID [2022-04-27 13:18:48,786 INFO L290 TraceCheckUtils]: 86: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,786 INFO L290 TraceCheckUtils]: 85: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,786 INFO L290 TraceCheckUtils]: 84: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,786 INFO L272 TraceCheckUtils]: 83: Hoare triple {128918#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,786 INFO L290 TraceCheckUtils]: 82: Hoare triple {128918#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {128918#(< ~counter~0 88)} is VALID [2022-04-27 13:18:48,787 INFO L290 TraceCheckUtils]: 81: Hoare triple {128943#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128918#(< ~counter~0 88)} is VALID [2022-04-27 13:18:48,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {128943#(< ~counter~0 87)} assume !(~r~0 > 0); {128943#(< ~counter~0 87)} is VALID [2022-04-27 13:18:48,788 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {127992#true} {128943#(< ~counter~0 87)} #96#return; {128943#(< ~counter~0 87)} is VALID [2022-04-27 13:18:48,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,788 INFO L290 TraceCheckUtils]: 77: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,788 INFO L290 TraceCheckUtils]: 76: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,788 INFO L272 TraceCheckUtils]: 75: Hoare triple {128943#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,788 INFO L290 TraceCheckUtils]: 74: Hoare triple {128943#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {128943#(< ~counter~0 87)} is VALID [2022-04-27 13:18:48,789 INFO L290 TraceCheckUtils]: 73: Hoare triple {128968#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128943#(< ~counter~0 87)} is VALID [2022-04-27 13:18:48,789 INFO L290 TraceCheckUtils]: 72: Hoare triple {128968#(< ~counter~0 86)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128968#(< ~counter~0 86)} is VALID [2022-04-27 13:18:48,790 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {127992#true} {128968#(< ~counter~0 86)} #96#return; {128968#(< ~counter~0 86)} is VALID [2022-04-27 13:18:48,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,790 INFO L272 TraceCheckUtils]: 67: Hoare triple {128968#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {128968#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {128968#(< ~counter~0 86)} is VALID [2022-04-27 13:18:48,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {128993#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128968#(< ~counter~0 86)} is VALID [2022-04-27 13:18:48,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {128993#(< ~counter~0 85)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128993#(< ~counter~0 85)} is VALID [2022-04-27 13:18:48,792 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {127992#true} {128993#(< ~counter~0 85)} #96#return; {128993#(< ~counter~0 85)} is VALID [2022-04-27 13:18:48,792 INFO L290 TraceCheckUtils]: 62: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,792 INFO L290 TraceCheckUtils]: 61: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,792 INFO L290 TraceCheckUtils]: 60: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,792 INFO L272 TraceCheckUtils]: 59: Hoare triple {128993#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,792 INFO L290 TraceCheckUtils]: 58: Hoare triple {128993#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {128993#(< ~counter~0 85)} is VALID [2022-04-27 13:18:48,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {129018#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128993#(< ~counter~0 85)} is VALID [2022-04-27 13:18:48,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {129018#(< ~counter~0 84)} assume !!(0 != ~r~0); {129018#(< ~counter~0 84)} is VALID [2022-04-27 13:18:48,794 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {127992#true} {129018#(< ~counter~0 84)} #94#return; {129018#(< ~counter~0 84)} is VALID [2022-04-27 13:18:48,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,794 INFO L290 TraceCheckUtils]: 52: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,794 INFO L272 TraceCheckUtils]: 51: Hoare triple {129018#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,794 INFO L290 TraceCheckUtils]: 50: Hoare triple {129018#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {129018#(< ~counter~0 84)} is VALID [2022-04-27 13:18:48,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {129043#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {129018#(< ~counter~0 84)} is VALID [2022-04-27 13:18:48,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {129043#(< ~counter~0 83)} assume !(~r~0 < 0); {129043#(< ~counter~0 83)} is VALID [2022-04-27 13:18:48,796 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {127992#true} {129043#(< ~counter~0 83)} #98#return; {129043#(< ~counter~0 83)} is VALID [2022-04-27 13:18:48,796 INFO L290 TraceCheckUtils]: 46: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,796 INFO L272 TraceCheckUtils]: 43: Hoare triple {129043#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {129043#(< ~counter~0 83)} assume !!(#t~post8 < 100);havoc #t~post8; {129043#(< ~counter~0 83)} is VALID [2022-04-27 13:18:48,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {129068#(< ~counter~0 82)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {129043#(< ~counter~0 83)} is VALID [2022-04-27 13:18:48,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {129068#(< ~counter~0 82)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {129068#(< ~counter~0 82)} is VALID [2022-04-27 13:18:48,798 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {127992#true} {129068#(< ~counter~0 82)} #98#return; {129068#(< ~counter~0 82)} is VALID [2022-04-27 13:18:48,798 INFO L290 TraceCheckUtils]: 38: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,798 INFO L290 TraceCheckUtils]: 36: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,798 INFO L272 TraceCheckUtils]: 35: Hoare triple {129068#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {129068#(< ~counter~0 82)} assume !!(#t~post8 < 100);havoc #t~post8; {129068#(< ~counter~0 82)} is VALID [2022-04-27 13:18:48,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {129093#(< ~counter~0 81)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {129068#(< ~counter~0 82)} is VALID [2022-04-27 13:18:48,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {129093#(< ~counter~0 81)} assume !(~r~0 > 0); {129093#(< ~counter~0 81)} is VALID [2022-04-27 13:18:48,800 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {127992#true} {129093#(< ~counter~0 81)} #96#return; {129093#(< ~counter~0 81)} is VALID [2022-04-27 13:18:48,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,800 INFO L272 TraceCheckUtils]: 27: Hoare triple {129093#(< ~counter~0 81)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {129093#(< ~counter~0 81)} assume !!(#t~post7 < 100);havoc #t~post7; {129093#(< ~counter~0 81)} is VALID [2022-04-27 13:18:48,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {129118#(< ~counter~0 80)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {129093#(< ~counter~0 81)} is VALID [2022-04-27 13:18:48,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {129118#(< ~counter~0 80)} assume !!(0 != ~r~0); {129118#(< ~counter~0 80)} is VALID [2022-04-27 13:18:48,802 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {127992#true} {129118#(< ~counter~0 80)} #94#return; {129118#(< ~counter~0 80)} is VALID [2022-04-27 13:18:48,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,802 INFO L272 TraceCheckUtils]: 19: Hoare triple {129118#(< ~counter~0 80)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {129118#(< ~counter~0 80)} assume !!(#t~post6 < 100);havoc #t~post6; {129118#(< ~counter~0 80)} is VALID [2022-04-27 13:18:48,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {129143#(< ~counter~0 79)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {129118#(< ~counter~0 80)} is VALID [2022-04-27 13:18:48,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {129143#(< ~counter~0 79)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {129143#(< ~counter~0 79)} is VALID [2022-04-27 13:18:48,804 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {127992#true} {129143#(< ~counter~0 79)} #92#return; {129143#(< ~counter~0 79)} is VALID [2022-04-27 13:18:48,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,804 INFO L272 TraceCheckUtils]: 11: Hoare triple {129143#(< ~counter~0 79)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,805 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {127992#true} {129143#(< ~counter~0 79)} #90#return; {129143#(< ~counter~0 79)} is VALID [2022-04-27 13:18:48,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-27 13:18:48,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-27 13:18:48,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-27 13:18:48,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {129143#(< ~counter~0 79)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {127992#true} is VALID [2022-04-27 13:18:48,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {129143#(< ~counter~0 79)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {129143#(< ~counter~0 79)} is VALID [2022-04-27 13:18:48,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {129143#(< ~counter~0 79)} call #t~ret9 := main(); {129143#(< ~counter~0 79)} is VALID [2022-04-27 13:18:48,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129143#(< ~counter~0 79)} {127992#true} #102#return; {129143#(< ~counter~0 79)} is VALID [2022-04-27 13:18:48,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {129143#(< ~counter~0 79)} assume true; {129143#(< ~counter~0 79)} is VALID [2022-04-27 13:18:48,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {127992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {129143#(< ~counter~0 79)} is VALID [2022-04-27 13:18:48,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {127992#true} call ULTIMATE.init(); {127992#true} is VALID [2022-04-27 13:18:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 50 proven. 302 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2022-04-27 13:18:48,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:48,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65678551] [2022-04-27 13:18:48,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:48,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478232941] [2022-04-27 13:18:48,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478232941] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:48,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:48,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-04-27 13:18:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544698612] [2022-04-27 13:18:48,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:48,808 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) Word has length 193 [2022-04-27 13:18:48,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:48,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:18:49,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:49,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-27 13:18:49,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:49,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-27 13:18:49,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 13:18:49,114 INFO L87 Difference]: Start difference. First operand 9645 states and 13867 transitions. Second operand has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:19:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:18,548 INFO L93 Difference]: Finished difference Result 14792 states and 21463 transitions. [2022-04-27 13:19:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-04-27 13:19:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) Word has length 193 [2022-04-27 13:19:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:19:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:19:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-27 13:19:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:19:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-27 13:19:18,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 1004 transitions. [2022-04-27 13:19:19,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1004 edges. 1004 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:19:21,973 INFO L225 Difference]: With dead ends: 14792 [2022-04-27 13:19:21,974 INFO L226 Difference]: Without dead ends: 7697 [2022-04-27 13:19:21,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2864, Invalid=4968, Unknown=0, NotChecked=0, Total=7832 [2022-04-27 13:19:21,993 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 1857 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 1237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1237 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:19:21,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 843 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1237 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 13:19:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2022-04-27 13:19:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 7470. [2022-04-27 13:19:35,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:19:35,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7697 states. Second operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) [2022-04-27 13:19:35,016 INFO L74 IsIncluded]: Start isIncluded. First operand 7697 states. Second operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) [2022-04-27 13:19:35,024 INFO L87 Difference]: Start difference. First operand 7697 states. Second operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) [2022-04-27 13:19:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:36,741 INFO L93 Difference]: Finished difference Result 7697 states and 10470 transitions. [2022-04-27 13:19:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 10470 transitions. [2022-04-27 13:19:36,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:19:36,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:19:36,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) Second operand 7697 states. [2022-04-27 13:19:36,767 INFO L87 Difference]: Start difference. First operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) Second operand 7697 states. [2022-04-27 13:19:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:19:38,551 INFO L93 Difference]: Finished difference Result 7697 states and 10470 transitions. [2022-04-27 13:19:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 10470 transitions. [2022-04-27 13:19:38,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:19:38,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:19:38,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:19:38,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:19:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7470 states, 5600 states have (on average 1.1821428571428572) internal successors, (6620), 5644 states have internal predecessors, (6620), 1823 states have call successors, (1823), 48 states have call predecessors, (1823), 46 states have return successors, (1821), 1777 states have call predecessors, (1821), 1821 states have call successors, (1821) [2022-04-27 13:19:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 10264 transitions. [2022-04-27 13:19:40,687 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 10264 transitions. Word has length 193 [2022-04-27 13:19:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:19:40,688 INFO L495 AbstractCegarLoop]: Abstraction has 7470 states and 10264 transitions. [2022-04-27 13:19:40,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.479166666666667) internal successors, (215), 48 states have internal predecessors, (215), 46 states have call successors, (50), 25 states have call predecessors, (50), 24 states have return successors, (48), 44 states have call predecessors, (48), 45 states have call successors, (48) [2022-04-27 13:19:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 10264 transitions. [2022-04-27 13:19:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-04-27 13:19:40,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:19:40,692 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 10, 10, 10, 10, 8, 8, 8, 8, 6, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:19:40,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-27 13:19:40,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:19:40,893 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:19:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:19:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1172412185, now seen corresponding path program 2 times [2022-04-27 13:19:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:19:40,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174480324] [2022-04-27 13:19:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:19:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:19:40,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:19:40,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826342833] [2022-04-27 13:19:40,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:19:40,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:19:40,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:19:40,926 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:19:40,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-27 13:19:41,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:19:41,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:19:41,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-27 13:19:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:19:41,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:19:42,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {176020#true} call ULTIMATE.init(); {176020#true} is VALID [2022-04-27 13:19:42,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {176020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {176028#(<= ~counter~0 0)} assume true; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176028#(<= ~counter~0 0)} {176020#true} #102#return; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {176028#(<= ~counter~0 0)} call #t~ret9 := main(); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {176028#(<= ~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; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {176028#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {176028#(<= ~counter~0 0)} ~cond := #in~cond; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {176028#(<= ~counter~0 0)} assume !(0 == ~cond); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {176028#(<= ~counter~0 0)} assume true; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176028#(<= ~counter~0 0)} {176028#(<= ~counter~0 0)} #90#return; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,230 INFO L272 TraceCheckUtils]: 11: Hoare triple {176028#(<= ~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)); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {176028#(<= ~counter~0 0)} ~cond := #in~cond; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {176028#(<= ~counter~0 0)} assume !(0 == ~cond); {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {176028#(<= ~counter~0 0)} assume true; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176028#(<= ~counter~0 0)} {176028#(<= ~counter~0 0)} #92#return; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {176028#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {176028#(<= ~counter~0 0)} is VALID [2022-04-27 13:19:42,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {176028#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:42,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {176077#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:42,235 INFO L272 TraceCheckUtils]: 19: Hoare triple {176077#(<= ~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)); {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:42,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {176077#(<= ~counter~0 1)} ~cond := #in~cond; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:42,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {176077#(<= ~counter~0 1)} assume !(0 == ~cond); {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:42,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {176077#(<= ~counter~0 1)} assume true; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:42,236 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176077#(<= ~counter~0 1)} {176077#(<= ~counter~0 1)} #94#return; {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:42,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {176077#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176077#(<= ~counter~0 1)} is VALID [2022-04-27 13:19:42,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {176077#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:42,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {176102#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:42,239 INFO L272 TraceCheckUtils]: 27: Hoare triple {176102#(<= ~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)); {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:42,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {176102#(<= ~counter~0 2)} ~cond := #in~cond; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:42,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {176102#(<= ~counter~0 2)} assume !(0 == ~cond); {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:42,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {176102#(<= ~counter~0 2)} assume true; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:42,240 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176102#(<= ~counter~0 2)} {176102#(<= ~counter~0 2)} #96#return; {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:42,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {176102#(<= ~counter~0 2)} assume !(~r~0 > 0); {176102#(<= ~counter~0 2)} is VALID [2022-04-27 13:19:42,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {176102#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:42,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {176127#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:42,243 INFO L272 TraceCheckUtils]: 35: Hoare triple {176127#(<= ~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)); {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:42,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {176127#(<= ~counter~0 3)} ~cond := #in~cond; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:42,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {176127#(<= ~counter~0 3)} assume !(0 == ~cond); {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:42,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {176127#(<= ~counter~0 3)} assume true; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:42,244 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176127#(<= ~counter~0 3)} {176127#(<= ~counter~0 3)} #98#return; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:42,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {176127#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176127#(<= ~counter~0 3)} is VALID [2022-04-27 13:19:42,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {176127#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:42,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {176152#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:42,246 INFO L272 TraceCheckUtils]: 43: Hoare triple {176152#(<= ~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)); {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:42,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {176152#(<= ~counter~0 4)} ~cond := #in~cond; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:42,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {176152#(<= ~counter~0 4)} assume !(0 == ~cond); {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:42,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {176152#(<= ~counter~0 4)} assume true; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:42,248 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176152#(<= ~counter~0 4)} {176152#(<= ~counter~0 4)} #98#return; {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:42,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {176152#(<= ~counter~0 4)} assume !(~r~0 < 0); {176152#(<= ~counter~0 4)} is VALID [2022-04-27 13:19:42,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {176152#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:42,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {176177#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:42,250 INFO L272 TraceCheckUtils]: 51: Hoare triple {176177#(<= ~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)); {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:42,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {176177#(<= ~counter~0 5)} ~cond := #in~cond; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:42,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {176177#(<= ~counter~0 5)} assume !(0 == ~cond); {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:42,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {176177#(<= ~counter~0 5)} assume true; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:42,251 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176177#(<= ~counter~0 5)} {176177#(<= ~counter~0 5)} #94#return; {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:42,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {176177#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176177#(<= ~counter~0 5)} is VALID [2022-04-27 13:19:42,253 INFO L290 TraceCheckUtils]: 57: Hoare triple {176177#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:42,253 INFO L290 TraceCheckUtils]: 58: Hoare triple {176202#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:42,253 INFO L272 TraceCheckUtils]: 59: Hoare triple {176202#(<= ~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)); {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:42,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {176202#(<= ~counter~0 6)} ~cond := #in~cond; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:42,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {176202#(<= ~counter~0 6)} assume !(0 == ~cond); {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:42,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {176202#(<= ~counter~0 6)} assume true; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:42,255 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176202#(<= ~counter~0 6)} {176202#(<= ~counter~0 6)} #96#return; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:42,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {176202#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176202#(<= ~counter~0 6)} is VALID [2022-04-27 13:19:42,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {176202#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:42,257 INFO L290 TraceCheckUtils]: 66: Hoare triple {176227#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:42,257 INFO L272 TraceCheckUtils]: 67: Hoare triple {176227#(<= ~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)); {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:42,257 INFO L290 TraceCheckUtils]: 68: Hoare triple {176227#(<= ~counter~0 7)} ~cond := #in~cond; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:42,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {176227#(<= ~counter~0 7)} assume !(0 == ~cond); {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:42,258 INFO L290 TraceCheckUtils]: 70: Hoare triple {176227#(<= ~counter~0 7)} assume true; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:42,258 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176227#(<= ~counter~0 7)} {176227#(<= ~counter~0 7)} #96#return; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:42,259 INFO L290 TraceCheckUtils]: 72: Hoare triple {176227#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176227#(<= ~counter~0 7)} is VALID [2022-04-27 13:19:42,260 INFO L290 TraceCheckUtils]: 73: Hoare triple {176227#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:42,260 INFO L290 TraceCheckUtils]: 74: Hoare triple {176252#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:42,261 INFO L272 TraceCheckUtils]: 75: Hoare triple {176252#(<= ~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)); {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:42,261 INFO L290 TraceCheckUtils]: 76: Hoare triple {176252#(<= ~counter~0 8)} ~cond := #in~cond; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:42,261 INFO L290 TraceCheckUtils]: 77: Hoare triple {176252#(<= ~counter~0 8)} assume !(0 == ~cond); {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:42,262 INFO L290 TraceCheckUtils]: 78: Hoare triple {176252#(<= ~counter~0 8)} assume true; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:42,262 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176252#(<= ~counter~0 8)} {176252#(<= ~counter~0 8)} #96#return; {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:42,262 INFO L290 TraceCheckUtils]: 80: Hoare triple {176252#(<= ~counter~0 8)} assume !(~r~0 > 0); {176252#(<= ~counter~0 8)} is VALID [2022-04-27 13:19:42,264 INFO L290 TraceCheckUtils]: 81: Hoare triple {176252#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:42,264 INFO L290 TraceCheckUtils]: 82: Hoare triple {176277#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:42,265 INFO L272 TraceCheckUtils]: 83: Hoare triple {176277#(<= ~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)); {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:42,265 INFO L290 TraceCheckUtils]: 84: Hoare triple {176277#(<= ~counter~0 9)} ~cond := #in~cond; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:42,265 INFO L290 TraceCheckUtils]: 85: Hoare triple {176277#(<= ~counter~0 9)} assume !(0 == ~cond); {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:42,265 INFO L290 TraceCheckUtils]: 86: Hoare triple {176277#(<= ~counter~0 9)} assume true; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:42,266 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176277#(<= ~counter~0 9)} {176277#(<= ~counter~0 9)} #98#return; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:42,266 INFO L290 TraceCheckUtils]: 88: Hoare triple {176277#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176277#(<= ~counter~0 9)} is VALID [2022-04-27 13:19:42,268 INFO L290 TraceCheckUtils]: 89: Hoare triple {176277#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:42,268 INFO L290 TraceCheckUtils]: 90: Hoare triple {176302#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:42,268 INFO L272 TraceCheckUtils]: 91: Hoare triple {176302#(<= ~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)); {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:42,269 INFO L290 TraceCheckUtils]: 92: Hoare triple {176302#(<= ~counter~0 10)} ~cond := #in~cond; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:42,269 INFO L290 TraceCheckUtils]: 93: Hoare triple {176302#(<= ~counter~0 10)} assume !(0 == ~cond); {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:42,269 INFO L290 TraceCheckUtils]: 94: Hoare triple {176302#(<= ~counter~0 10)} assume true; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:42,270 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176302#(<= ~counter~0 10)} {176302#(<= ~counter~0 10)} #98#return; {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:42,270 INFO L290 TraceCheckUtils]: 96: Hoare triple {176302#(<= ~counter~0 10)} assume !(~r~0 < 0); {176302#(<= ~counter~0 10)} is VALID [2022-04-27 13:19:42,271 INFO L290 TraceCheckUtils]: 97: Hoare triple {176302#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:42,271 INFO L290 TraceCheckUtils]: 98: Hoare triple {176327#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:42,272 INFO L272 TraceCheckUtils]: 99: Hoare triple {176327#(<= ~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)); {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:42,272 INFO L290 TraceCheckUtils]: 100: Hoare triple {176327#(<= ~counter~0 11)} ~cond := #in~cond; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:42,272 INFO L290 TraceCheckUtils]: 101: Hoare triple {176327#(<= ~counter~0 11)} assume !(0 == ~cond); {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:42,273 INFO L290 TraceCheckUtils]: 102: Hoare triple {176327#(<= ~counter~0 11)} assume true; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:42,273 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176327#(<= ~counter~0 11)} {176327#(<= ~counter~0 11)} #94#return; {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:42,273 INFO L290 TraceCheckUtils]: 104: Hoare triple {176327#(<= ~counter~0 11)} assume !!(0 != ~r~0); {176327#(<= ~counter~0 11)} is VALID [2022-04-27 13:19:42,275 INFO L290 TraceCheckUtils]: 105: Hoare triple {176327#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:42,275 INFO L290 TraceCheckUtils]: 106: Hoare triple {176352#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:42,276 INFO L272 TraceCheckUtils]: 107: Hoare triple {176352#(<= ~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)); {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:42,276 INFO L290 TraceCheckUtils]: 108: Hoare triple {176352#(<= ~counter~0 12)} ~cond := #in~cond; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:42,276 INFO L290 TraceCheckUtils]: 109: Hoare triple {176352#(<= ~counter~0 12)} assume !(0 == ~cond); {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:42,276 INFO L290 TraceCheckUtils]: 110: Hoare triple {176352#(<= ~counter~0 12)} assume true; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:42,277 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176352#(<= ~counter~0 12)} {176352#(<= ~counter~0 12)} #96#return; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:42,277 INFO L290 TraceCheckUtils]: 112: Hoare triple {176352#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176352#(<= ~counter~0 12)} is VALID [2022-04-27 13:19:42,279 INFO L290 TraceCheckUtils]: 113: Hoare triple {176352#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:42,279 INFO L290 TraceCheckUtils]: 114: Hoare triple {176377#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:42,279 INFO L272 TraceCheckUtils]: 115: Hoare triple {176377#(<= ~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)); {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:42,280 INFO L290 TraceCheckUtils]: 116: Hoare triple {176377#(<= ~counter~0 13)} ~cond := #in~cond; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:42,280 INFO L290 TraceCheckUtils]: 117: Hoare triple {176377#(<= ~counter~0 13)} assume !(0 == ~cond); {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:42,280 INFO L290 TraceCheckUtils]: 118: Hoare triple {176377#(<= ~counter~0 13)} assume true; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:42,281 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176377#(<= ~counter~0 13)} {176377#(<= ~counter~0 13)} #96#return; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:42,281 INFO L290 TraceCheckUtils]: 120: Hoare triple {176377#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176377#(<= ~counter~0 13)} is VALID [2022-04-27 13:19:42,282 INFO L290 TraceCheckUtils]: 121: Hoare triple {176377#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:42,283 INFO L290 TraceCheckUtils]: 122: Hoare triple {176402#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:42,283 INFO L272 TraceCheckUtils]: 123: Hoare triple {176402#(<= ~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)); {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:42,283 INFO L290 TraceCheckUtils]: 124: Hoare triple {176402#(<= ~counter~0 14)} ~cond := #in~cond; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:42,284 INFO L290 TraceCheckUtils]: 125: Hoare triple {176402#(<= ~counter~0 14)} assume !(0 == ~cond); {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:42,284 INFO L290 TraceCheckUtils]: 126: Hoare triple {176402#(<= ~counter~0 14)} assume true; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:42,284 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176402#(<= ~counter~0 14)} {176402#(<= ~counter~0 14)} #96#return; {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:42,285 INFO L290 TraceCheckUtils]: 128: Hoare triple {176402#(<= ~counter~0 14)} assume !(~r~0 > 0); {176402#(<= ~counter~0 14)} is VALID [2022-04-27 13:19:42,286 INFO L290 TraceCheckUtils]: 129: Hoare triple {176402#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:42,286 INFO L290 TraceCheckUtils]: 130: Hoare triple {176427#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:42,287 INFO L272 TraceCheckUtils]: 131: Hoare triple {176427#(<= ~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)); {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:42,287 INFO L290 TraceCheckUtils]: 132: Hoare triple {176427#(<= ~counter~0 15)} ~cond := #in~cond; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:42,287 INFO L290 TraceCheckUtils]: 133: Hoare triple {176427#(<= ~counter~0 15)} assume !(0 == ~cond); {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:42,288 INFO L290 TraceCheckUtils]: 134: Hoare triple {176427#(<= ~counter~0 15)} assume true; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:42,288 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176427#(<= ~counter~0 15)} {176427#(<= ~counter~0 15)} #98#return; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:42,288 INFO L290 TraceCheckUtils]: 136: Hoare triple {176427#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176427#(<= ~counter~0 15)} is VALID [2022-04-27 13:19:42,290 INFO L290 TraceCheckUtils]: 137: Hoare triple {176427#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:42,290 INFO L290 TraceCheckUtils]: 138: Hoare triple {176452#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:42,291 INFO L272 TraceCheckUtils]: 139: Hoare triple {176452#(<= ~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)); {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:42,291 INFO L290 TraceCheckUtils]: 140: Hoare triple {176452#(<= ~counter~0 16)} ~cond := #in~cond; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:42,291 INFO L290 TraceCheckUtils]: 141: Hoare triple {176452#(<= ~counter~0 16)} assume !(0 == ~cond); {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:42,292 INFO L290 TraceCheckUtils]: 142: Hoare triple {176452#(<= ~counter~0 16)} assume true; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:42,292 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176452#(<= ~counter~0 16)} {176452#(<= ~counter~0 16)} #98#return; {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:42,292 INFO L290 TraceCheckUtils]: 144: Hoare triple {176452#(<= ~counter~0 16)} assume !(~r~0 < 0); {176452#(<= ~counter~0 16)} is VALID [2022-04-27 13:19:42,294 INFO L290 TraceCheckUtils]: 145: Hoare triple {176452#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:42,294 INFO L290 TraceCheckUtils]: 146: Hoare triple {176477#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:42,295 INFO L272 TraceCheckUtils]: 147: Hoare triple {176477#(<= ~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)); {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:42,295 INFO L290 TraceCheckUtils]: 148: Hoare triple {176477#(<= ~counter~0 17)} ~cond := #in~cond; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:42,295 INFO L290 TraceCheckUtils]: 149: Hoare triple {176477#(<= ~counter~0 17)} assume !(0 == ~cond); {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:42,295 INFO L290 TraceCheckUtils]: 150: Hoare triple {176477#(<= ~counter~0 17)} assume true; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:42,296 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176477#(<= ~counter~0 17)} {176477#(<= ~counter~0 17)} #94#return; {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:42,296 INFO L290 TraceCheckUtils]: 152: Hoare triple {176477#(<= ~counter~0 17)} assume !!(0 != ~r~0); {176477#(<= ~counter~0 17)} is VALID [2022-04-27 13:19:42,298 INFO L290 TraceCheckUtils]: 153: Hoare triple {176477#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:42,298 INFO L290 TraceCheckUtils]: 154: Hoare triple {176502#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:42,298 INFO L272 TraceCheckUtils]: 155: Hoare triple {176502#(<= ~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)); {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:42,299 INFO L290 TraceCheckUtils]: 156: Hoare triple {176502#(<= ~counter~0 18)} ~cond := #in~cond; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:42,299 INFO L290 TraceCheckUtils]: 157: Hoare triple {176502#(<= ~counter~0 18)} assume !(0 == ~cond); {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:42,299 INFO L290 TraceCheckUtils]: 158: Hoare triple {176502#(<= ~counter~0 18)} assume true; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:42,300 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {176502#(<= ~counter~0 18)} {176502#(<= ~counter~0 18)} #96#return; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:42,300 INFO L290 TraceCheckUtils]: 160: Hoare triple {176502#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176502#(<= ~counter~0 18)} is VALID [2022-04-27 13:19:42,301 INFO L290 TraceCheckUtils]: 161: Hoare triple {176502#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:42,302 INFO L290 TraceCheckUtils]: 162: Hoare triple {176527#(<= ~counter~0 19)} assume !!(#t~post7 < 100);havoc #t~post7; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:42,302 INFO L272 TraceCheckUtils]: 163: Hoare triple {176527#(<= ~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)); {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:42,302 INFO L290 TraceCheckUtils]: 164: Hoare triple {176527#(<= ~counter~0 19)} ~cond := #in~cond; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:42,303 INFO L290 TraceCheckUtils]: 165: Hoare triple {176527#(<= ~counter~0 19)} assume !(0 == ~cond); {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:42,303 INFO L290 TraceCheckUtils]: 166: Hoare triple {176527#(<= ~counter~0 19)} assume true; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:42,303 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {176527#(<= ~counter~0 19)} {176527#(<= ~counter~0 19)} #96#return; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:42,304 INFO L290 TraceCheckUtils]: 168: Hoare triple {176527#(<= ~counter~0 19)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176527#(<= ~counter~0 19)} is VALID [2022-04-27 13:19:42,305 INFO L290 TraceCheckUtils]: 169: Hoare triple {176527#(<= ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:42,305 INFO L290 TraceCheckUtils]: 170: Hoare triple {176552#(<= ~counter~0 20)} assume !!(#t~post7 < 100);havoc #t~post7; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:42,306 INFO L272 TraceCheckUtils]: 171: Hoare triple {176552#(<= ~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)); {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:42,306 INFO L290 TraceCheckUtils]: 172: Hoare triple {176552#(<= ~counter~0 20)} ~cond := #in~cond; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:42,306 INFO L290 TraceCheckUtils]: 173: Hoare triple {176552#(<= ~counter~0 20)} assume !(0 == ~cond); {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:42,307 INFO L290 TraceCheckUtils]: 174: Hoare triple {176552#(<= ~counter~0 20)} assume true; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:42,307 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {176552#(<= ~counter~0 20)} {176552#(<= ~counter~0 20)} #96#return; {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:42,307 INFO L290 TraceCheckUtils]: 176: Hoare triple {176552#(<= ~counter~0 20)} assume !(~r~0 > 0); {176552#(<= ~counter~0 20)} is VALID [2022-04-27 13:19:42,309 INFO L290 TraceCheckUtils]: 177: Hoare triple {176552#(<= ~counter~0 20)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:42,309 INFO L290 TraceCheckUtils]: 178: Hoare triple {176577#(<= ~counter~0 21)} assume !!(#t~post8 < 100);havoc #t~post8; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:42,310 INFO L272 TraceCheckUtils]: 179: Hoare triple {176577#(<= ~counter~0 21)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:42,310 INFO L290 TraceCheckUtils]: 180: Hoare triple {176577#(<= ~counter~0 21)} ~cond := #in~cond; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:42,310 INFO L290 TraceCheckUtils]: 181: Hoare triple {176577#(<= ~counter~0 21)} assume !(0 == ~cond); {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:42,310 INFO L290 TraceCheckUtils]: 182: Hoare triple {176577#(<= ~counter~0 21)} assume true; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:42,311 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {176577#(<= ~counter~0 21)} {176577#(<= ~counter~0 21)} #98#return; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:42,311 INFO L290 TraceCheckUtils]: 184: Hoare triple {176577#(<= ~counter~0 21)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176577#(<= ~counter~0 21)} is VALID [2022-04-27 13:19:42,313 INFO L290 TraceCheckUtils]: 185: Hoare triple {176577#(<= ~counter~0 21)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:19:42,313 INFO L290 TraceCheckUtils]: 186: Hoare triple {176602#(<= ~counter~0 22)} assume !!(#t~post8 < 100);havoc #t~post8; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:19:42,314 INFO L272 TraceCheckUtils]: 187: Hoare triple {176602#(<= ~counter~0 22)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:19:42,314 INFO L290 TraceCheckUtils]: 188: Hoare triple {176602#(<= ~counter~0 22)} ~cond := #in~cond; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:19:42,314 INFO L290 TraceCheckUtils]: 189: Hoare triple {176602#(<= ~counter~0 22)} assume !(0 == ~cond); {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:19:42,314 INFO L290 TraceCheckUtils]: 190: Hoare triple {176602#(<= ~counter~0 22)} assume true; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:19:42,315 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {176602#(<= ~counter~0 22)} {176602#(<= ~counter~0 22)} #98#return; {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:19:42,315 INFO L290 TraceCheckUtils]: 192: Hoare triple {176602#(<= ~counter~0 22)} assume !(~r~0 < 0); {176602#(<= ~counter~0 22)} is VALID [2022-04-27 13:19:42,315 INFO L290 TraceCheckUtils]: 193: Hoare triple {176602#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176627#(<= |main_#t~post6| 22)} is VALID [2022-04-27 13:19:42,316 INFO L290 TraceCheckUtils]: 194: Hoare triple {176627#(<= |main_#t~post6| 22)} assume !(#t~post6 < 100);havoc #t~post6; {176021#false} is VALID [2022-04-27 13:19:42,316 INFO L272 TraceCheckUtils]: 195: Hoare triple {176021#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176021#false} is VALID [2022-04-27 13:19:42,316 INFO L290 TraceCheckUtils]: 196: Hoare triple {176021#false} ~cond := #in~cond; {176021#false} is VALID [2022-04-27 13:19:42,316 INFO L290 TraceCheckUtils]: 197: Hoare triple {176021#false} assume 0 == ~cond; {176021#false} is VALID [2022-04-27 13:19:42,316 INFO L290 TraceCheckUtils]: 198: Hoare triple {176021#false} assume !false; {176021#false} is VALID [2022-04-27 13:19:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 44 proven. 1248 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:19:42,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:19:43,827 INFO L290 TraceCheckUtils]: 198: Hoare triple {176021#false} assume !false; {176021#false} is VALID [2022-04-27 13:19:43,827 INFO L290 TraceCheckUtils]: 197: Hoare triple {176021#false} assume 0 == ~cond; {176021#false} is VALID [2022-04-27 13:19:43,827 INFO L290 TraceCheckUtils]: 196: Hoare triple {176021#false} ~cond := #in~cond; {176021#false} is VALID [2022-04-27 13:19:43,827 INFO L272 TraceCheckUtils]: 195: Hoare triple {176021#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176021#false} is VALID [2022-04-27 13:19:43,827 INFO L290 TraceCheckUtils]: 194: Hoare triple {176655#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {176021#false} is VALID [2022-04-27 13:19:43,828 INFO L290 TraceCheckUtils]: 193: Hoare triple {176659#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176655#(< |main_#t~post6| 100)} is VALID [2022-04-27 13:19:43,828 INFO L290 TraceCheckUtils]: 192: Hoare triple {176659#(< ~counter~0 100)} assume !(~r~0 < 0); {176659#(< ~counter~0 100)} is VALID [2022-04-27 13:19:43,828 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {176020#true} {176659#(< ~counter~0 100)} #98#return; {176659#(< ~counter~0 100)} is VALID [2022-04-27 13:19:43,829 INFO L290 TraceCheckUtils]: 190: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,829 INFO L290 TraceCheckUtils]: 189: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,829 INFO L290 TraceCheckUtils]: 188: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,829 INFO L272 TraceCheckUtils]: 187: Hoare triple {176659#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,829 INFO L290 TraceCheckUtils]: 186: Hoare triple {176659#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {176659#(< ~counter~0 100)} is VALID [2022-04-27 13:19:43,831 INFO L290 TraceCheckUtils]: 185: Hoare triple {176684#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176659#(< ~counter~0 100)} is VALID [2022-04-27 13:19:43,831 INFO L290 TraceCheckUtils]: 184: Hoare triple {176684#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176684#(< ~counter~0 99)} is VALID [2022-04-27 13:19:43,832 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {176020#true} {176684#(< ~counter~0 99)} #98#return; {176684#(< ~counter~0 99)} is VALID [2022-04-27 13:19:43,832 INFO L290 TraceCheckUtils]: 182: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,832 INFO L290 TraceCheckUtils]: 181: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,832 INFO L290 TraceCheckUtils]: 180: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,832 INFO L272 TraceCheckUtils]: 179: Hoare triple {176684#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,832 INFO L290 TraceCheckUtils]: 178: Hoare triple {176684#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {176684#(< ~counter~0 99)} is VALID [2022-04-27 13:19:43,834 INFO L290 TraceCheckUtils]: 177: Hoare triple {176709#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176684#(< ~counter~0 99)} is VALID [2022-04-27 13:19:43,834 INFO L290 TraceCheckUtils]: 176: Hoare triple {176709#(< ~counter~0 98)} assume !(~r~0 > 0); {176709#(< ~counter~0 98)} is VALID [2022-04-27 13:19:43,835 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {176020#true} {176709#(< ~counter~0 98)} #96#return; {176709#(< ~counter~0 98)} is VALID [2022-04-27 13:19:43,835 INFO L290 TraceCheckUtils]: 174: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,835 INFO L290 TraceCheckUtils]: 173: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,835 INFO L290 TraceCheckUtils]: 172: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,835 INFO L272 TraceCheckUtils]: 171: Hoare triple {176709#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,835 INFO L290 TraceCheckUtils]: 170: Hoare triple {176709#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {176709#(< ~counter~0 98)} is VALID [2022-04-27 13:19:43,837 INFO L290 TraceCheckUtils]: 169: Hoare triple {176734#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176709#(< ~counter~0 98)} is VALID [2022-04-27 13:19:43,837 INFO L290 TraceCheckUtils]: 168: Hoare triple {176734#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176734#(< ~counter~0 97)} is VALID [2022-04-27 13:19:43,838 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {176020#true} {176734#(< ~counter~0 97)} #96#return; {176734#(< ~counter~0 97)} is VALID [2022-04-27 13:19:43,838 INFO L290 TraceCheckUtils]: 166: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,838 INFO L290 TraceCheckUtils]: 165: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,838 INFO L290 TraceCheckUtils]: 164: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,838 INFO L272 TraceCheckUtils]: 163: Hoare triple {176734#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,838 INFO L290 TraceCheckUtils]: 162: Hoare triple {176734#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {176734#(< ~counter~0 97)} is VALID [2022-04-27 13:19:43,840 INFO L290 TraceCheckUtils]: 161: Hoare triple {176759#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176734#(< ~counter~0 97)} is VALID [2022-04-27 13:19:43,840 INFO L290 TraceCheckUtils]: 160: Hoare triple {176759#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176759#(< ~counter~0 96)} is VALID [2022-04-27 13:19:43,841 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {176020#true} {176759#(< ~counter~0 96)} #96#return; {176759#(< ~counter~0 96)} is VALID [2022-04-27 13:19:43,841 INFO L290 TraceCheckUtils]: 158: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,841 INFO L290 TraceCheckUtils]: 157: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,841 INFO L290 TraceCheckUtils]: 156: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,841 INFO L272 TraceCheckUtils]: 155: Hoare triple {176759#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,841 INFO L290 TraceCheckUtils]: 154: Hoare triple {176759#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {176759#(< ~counter~0 96)} is VALID [2022-04-27 13:19:43,843 INFO L290 TraceCheckUtils]: 153: Hoare triple {176784#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176759#(< ~counter~0 96)} is VALID [2022-04-27 13:19:43,843 INFO L290 TraceCheckUtils]: 152: Hoare triple {176784#(< ~counter~0 95)} assume !!(0 != ~r~0); {176784#(< ~counter~0 95)} is VALID [2022-04-27 13:19:43,844 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176020#true} {176784#(< ~counter~0 95)} #94#return; {176784#(< ~counter~0 95)} is VALID [2022-04-27 13:19:43,844 INFO L290 TraceCheckUtils]: 150: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,844 INFO L290 TraceCheckUtils]: 149: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,844 INFO L290 TraceCheckUtils]: 148: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,844 INFO L272 TraceCheckUtils]: 147: Hoare triple {176784#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,844 INFO L290 TraceCheckUtils]: 146: Hoare triple {176784#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {176784#(< ~counter~0 95)} is VALID [2022-04-27 13:19:43,846 INFO L290 TraceCheckUtils]: 145: Hoare triple {176809#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176784#(< ~counter~0 95)} is VALID [2022-04-27 13:19:43,846 INFO L290 TraceCheckUtils]: 144: Hoare triple {176809#(< ~counter~0 94)} assume !(~r~0 < 0); {176809#(< ~counter~0 94)} is VALID [2022-04-27 13:19:43,847 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176020#true} {176809#(< ~counter~0 94)} #98#return; {176809#(< ~counter~0 94)} is VALID [2022-04-27 13:19:43,847 INFO L290 TraceCheckUtils]: 142: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,847 INFO L290 TraceCheckUtils]: 141: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,847 INFO L290 TraceCheckUtils]: 140: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,847 INFO L272 TraceCheckUtils]: 139: Hoare triple {176809#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,847 INFO L290 TraceCheckUtils]: 138: Hoare triple {176809#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {176809#(< ~counter~0 94)} is VALID [2022-04-27 13:19:43,848 INFO L290 TraceCheckUtils]: 137: Hoare triple {176834#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176809#(< ~counter~0 94)} is VALID [2022-04-27 13:19:43,849 INFO L290 TraceCheckUtils]: 136: Hoare triple {176834#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176834#(< ~counter~0 93)} is VALID [2022-04-27 13:19:43,849 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176020#true} {176834#(< ~counter~0 93)} #98#return; {176834#(< ~counter~0 93)} is VALID [2022-04-27 13:19:43,850 INFO L290 TraceCheckUtils]: 134: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,850 INFO L290 TraceCheckUtils]: 133: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,850 INFO L290 TraceCheckUtils]: 132: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,850 INFO L272 TraceCheckUtils]: 131: Hoare triple {176834#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,850 INFO L290 TraceCheckUtils]: 130: Hoare triple {176834#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {176834#(< ~counter~0 93)} is VALID [2022-04-27 13:19:43,851 INFO L290 TraceCheckUtils]: 129: Hoare triple {176859#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176834#(< ~counter~0 93)} is VALID [2022-04-27 13:19:43,852 INFO L290 TraceCheckUtils]: 128: Hoare triple {176859#(< ~counter~0 92)} assume !(~r~0 > 0); {176859#(< ~counter~0 92)} is VALID [2022-04-27 13:19:43,852 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176020#true} {176859#(< ~counter~0 92)} #96#return; {176859#(< ~counter~0 92)} is VALID [2022-04-27 13:19:43,852 INFO L290 TraceCheckUtils]: 126: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,852 INFO L290 TraceCheckUtils]: 125: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,852 INFO L290 TraceCheckUtils]: 124: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,852 INFO L272 TraceCheckUtils]: 123: Hoare triple {176859#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,853 INFO L290 TraceCheckUtils]: 122: Hoare triple {176859#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {176859#(< ~counter~0 92)} is VALID [2022-04-27 13:19:43,854 INFO L290 TraceCheckUtils]: 121: Hoare triple {176884#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176859#(< ~counter~0 92)} is VALID [2022-04-27 13:19:43,854 INFO L290 TraceCheckUtils]: 120: Hoare triple {176884#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176884#(< ~counter~0 91)} is VALID [2022-04-27 13:19:43,855 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176020#true} {176884#(< ~counter~0 91)} #96#return; {176884#(< ~counter~0 91)} is VALID [2022-04-27 13:19:43,855 INFO L290 TraceCheckUtils]: 118: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,855 INFO L290 TraceCheckUtils]: 117: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,855 INFO L290 TraceCheckUtils]: 116: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,855 INFO L272 TraceCheckUtils]: 115: Hoare triple {176884#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,856 INFO L290 TraceCheckUtils]: 114: Hoare triple {176884#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {176884#(< ~counter~0 91)} is VALID [2022-04-27 13:19:43,857 INFO L290 TraceCheckUtils]: 113: Hoare triple {176909#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176884#(< ~counter~0 91)} is VALID [2022-04-27 13:19:43,857 INFO L290 TraceCheckUtils]: 112: Hoare triple {176909#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {176909#(< ~counter~0 90)} is VALID [2022-04-27 13:19:43,858 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176020#true} {176909#(< ~counter~0 90)} #96#return; {176909#(< ~counter~0 90)} is VALID [2022-04-27 13:19:43,858 INFO L290 TraceCheckUtils]: 110: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,858 INFO L290 TraceCheckUtils]: 109: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,858 INFO L290 TraceCheckUtils]: 108: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,858 INFO L272 TraceCheckUtils]: 107: Hoare triple {176909#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,858 INFO L290 TraceCheckUtils]: 106: Hoare triple {176909#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {176909#(< ~counter~0 90)} is VALID [2022-04-27 13:19:43,860 INFO L290 TraceCheckUtils]: 105: Hoare triple {176934#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {176909#(< ~counter~0 90)} is VALID [2022-04-27 13:19:43,860 INFO L290 TraceCheckUtils]: 104: Hoare triple {176934#(< ~counter~0 89)} assume !!(0 != ~r~0); {176934#(< ~counter~0 89)} is VALID [2022-04-27 13:19:43,861 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176020#true} {176934#(< ~counter~0 89)} #94#return; {176934#(< ~counter~0 89)} is VALID [2022-04-27 13:19:43,861 INFO L290 TraceCheckUtils]: 102: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,861 INFO L290 TraceCheckUtils]: 101: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,861 INFO L290 TraceCheckUtils]: 100: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,861 INFO L272 TraceCheckUtils]: 99: Hoare triple {176934#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,861 INFO L290 TraceCheckUtils]: 98: Hoare triple {176934#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {176934#(< ~counter~0 89)} is VALID [2022-04-27 13:19:43,863 INFO L290 TraceCheckUtils]: 97: Hoare triple {176959#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {176934#(< ~counter~0 89)} is VALID [2022-04-27 13:19:43,863 INFO L290 TraceCheckUtils]: 96: Hoare triple {176959#(< ~counter~0 88)} assume !(~r~0 < 0); {176959#(< ~counter~0 88)} is VALID [2022-04-27 13:19:43,863 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176020#true} {176959#(< ~counter~0 88)} #98#return; {176959#(< ~counter~0 88)} is VALID [2022-04-27 13:19:43,864 INFO L290 TraceCheckUtils]: 94: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,864 INFO L290 TraceCheckUtils]: 93: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,864 INFO L290 TraceCheckUtils]: 92: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,864 INFO L272 TraceCheckUtils]: 91: Hoare triple {176959#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,864 INFO L290 TraceCheckUtils]: 90: Hoare triple {176959#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {176959#(< ~counter~0 88)} is VALID [2022-04-27 13:19:43,865 INFO L290 TraceCheckUtils]: 89: Hoare triple {176984#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176959#(< ~counter~0 88)} is VALID [2022-04-27 13:19:43,866 INFO L290 TraceCheckUtils]: 88: Hoare triple {176984#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {176984#(< ~counter~0 87)} is VALID [2022-04-27 13:19:43,866 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176020#true} {176984#(< ~counter~0 87)} #98#return; {176984#(< ~counter~0 87)} is VALID [2022-04-27 13:19:43,866 INFO L290 TraceCheckUtils]: 86: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,866 INFO L290 TraceCheckUtils]: 85: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,866 INFO L290 TraceCheckUtils]: 84: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,867 INFO L272 TraceCheckUtils]: 83: Hoare triple {176984#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,867 INFO L290 TraceCheckUtils]: 82: Hoare triple {176984#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {176984#(< ~counter~0 87)} is VALID [2022-04-27 13:19:43,868 INFO L290 TraceCheckUtils]: 81: Hoare triple {177009#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {176984#(< ~counter~0 87)} is VALID [2022-04-27 13:19:43,869 INFO L290 TraceCheckUtils]: 80: Hoare triple {177009#(< ~counter~0 86)} assume !(~r~0 > 0); {177009#(< ~counter~0 86)} is VALID [2022-04-27 13:19:43,869 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176020#true} {177009#(< ~counter~0 86)} #96#return; {177009#(< ~counter~0 86)} is VALID [2022-04-27 13:19:43,869 INFO L290 TraceCheckUtils]: 78: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,869 INFO L290 TraceCheckUtils]: 77: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,869 INFO L290 TraceCheckUtils]: 76: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,869 INFO L272 TraceCheckUtils]: 75: Hoare triple {177009#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,870 INFO L290 TraceCheckUtils]: 74: Hoare triple {177009#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {177009#(< ~counter~0 86)} is VALID [2022-04-27 13:19:43,871 INFO L290 TraceCheckUtils]: 73: Hoare triple {177034#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177009#(< ~counter~0 86)} is VALID [2022-04-27 13:19:43,872 INFO L290 TraceCheckUtils]: 72: Hoare triple {177034#(< ~counter~0 85)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177034#(< ~counter~0 85)} is VALID [2022-04-27 13:19:43,872 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176020#true} {177034#(< ~counter~0 85)} #96#return; {177034#(< ~counter~0 85)} is VALID [2022-04-27 13:19:43,872 INFO L290 TraceCheckUtils]: 70: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,872 INFO L290 TraceCheckUtils]: 69: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,872 INFO L290 TraceCheckUtils]: 68: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,872 INFO L272 TraceCheckUtils]: 67: Hoare triple {177034#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {177034#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {177034#(< ~counter~0 85)} is VALID [2022-04-27 13:19:43,874 INFO L290 TraceCheckUtils]: 65: Hoare triple {177059#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177034#(< ~counter~0 85)} is VALID [2022-04-27 13:19:43,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {177059#(< ~counter~0 84)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {177059#(< ~counter~0 84)} is VALID [2022-04-27 13:19:43,875 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176020#true} {177059#(< ~counter~0 84)} #96#return; {177059#(< ~counter~0 84)} is VALID [2022-04-27 13:19:43,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,875 INFO L290 TraceCheckUtils]: 60: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,875 INFO L272 TraceCheckUtils]: 59: Hoare triple {177059#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {177059#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {177059#(< ~counter~0 84)} is VALID [2022-04-27 13:19:43,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {177084#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177059#(< ~counter~0 84)} is VALID [2022-04-27 13:19:43,878 INFO L290 TraceCheckUtils]: 56: Hoare triple {177084#(< ~counter~0 83)} assume !!(0 != ~r~0); {177084#(< ~counter~0 83)} is VALID [2022-04-27 13:19:43,878 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176020#true} {177084#(< ~counter~0 83)} #94#return; {177084#(< ~counter~0 83)} is VALID [2022-04-27 13:19:43,878 INFO L290 TraceCheckUtils]: 54: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,878 INFO L290 TraceCheckUtils]: 53: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,878 INFO L290 TraceCheckUtils]: 52: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,878 INFO L272 TraceCheckUtils]: 51: Hoare triple {177084#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,879 INFO L290 TraceCheckUtils]: 50: Hoare triple {177084#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {177084#(< ~counter~0 83)} is VALID [2022-04-27 13:19:43,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {177109#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177084#(< ~counter~0 83)} is VALID [2022-04-27 13:19:43,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {177109#(< ~counter~0 82)} assume !(~r~0 < 0); {177109#(< ~counter~0 82)} is VALID [2022-04-27 13:19:43,881 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176020#true} {177109#(< ~counter~0 82)} #98#return; {177109#(< ~counter~0 82)} is VALID [2022-04-27 13:19:43,881 INFO L290 TraceCheckUtils]: 46: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,881 INFO L290 TraceCheckUtils]: 45: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,881 INFO L290 TraceCheckUtils]: 44: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,881 INFO L272 TraceCheckUtils]: 43: Hoare triple {177109#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {177109#(< ~counter~0 82)} assume !!(#t~post8 < 100);havoc #t~post8; {177109#(< ~counter~0 82)} is VALID [2022-04-27 13:19:43,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {177134#(< ~counter~0 81)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177109#(< ~counter~0 82)} is VALID [2022-04-27 13:19:43,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {177134#(< ~counter~0 81)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {177134#(< ~counter~0 81)} is VALID [2022-04-27 13:19:43,884 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176020#true} {177134#(< ~counter~0 81)} #98#return; {177134#(< ~counter~0 81)} is VALID [2022-04-27 13:19:43,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,885 INFO L272 TraceCheckUtils]: 35: Hoare triple {177134#(< ~counter~0 81)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {177134#(< ~counter~0 81)} assume !!(#t~post8 < 100);havoc #t~post8; {177134#(< ~counter~0 81)} is VALID [2022-04-27 13:19:43,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {177159#(< ~counter~0 80)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {177134#(< ~counter~0 81)} is VALID [2022-04-27 13:19:43,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {177159#(< ~counter~0 80)} assume !(~r~0 > 0); {177159#(< ~counter~0 80)} is VALID [2022-04-27 13:19:43,887 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176020#true} {177159#(< ~counter~0 80)} #96#return; {177159#(< ~counter~0 80)} is VALID [2022-04-27 13:19:43,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,888 INFO L272 TraceCheckUtils]: 27: Hoare triple {177159#(< ~counter~0 80)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {177159#(< ~counter~0 80)} assume !!(#t~post7 < 100);havoc #t~post7; {177159#(< ~counter~0 80)} is VALID [2022-04-27 13:19:43,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {177184#(< ~counter~0 79)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {177159#(< ~counter~0 80)} is VALID [2022-04-27 13:19:43,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {177184#(< ~counter~0 79)} assume !!(0 != ~r~0); {177184#(< ~counter~0 79)} is VALID [2022-04-27 13:19:43,890 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176020#true} {177184#(< ~counter~0 79)} #94#return; {177184#(< ~counter~0 79)} is VALID [2022-04-27 13:19:43,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,891 INFO L272 TraceCheckUtils]: 19: Hoare triple {177184#(< ~counter~0 79)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {177184#(< ~counter~0 79)} assume !!(#t~post6 < 100);havoc #t~post6; {177184#(< ~counter~0 79)} is VALID [2022-04-27 13:19:43,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {177209#(< ~counter~0 78)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {177184#(< ~counter~0 79)} is VALID [2022-04-27 13:19:43,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {177209#(< ~counter~0 78)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {177209#(< ~counter~0 78)} is VALID [2022-04-27 13:19:43,893 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176020#true} {177209#(< ~counter~0 78)} #92#return; {177209#(< ~counter~0 78)} is VALID [2022-04-27 13:19:43,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,893 INFO L272 TraceCheckUtils]: 11: Hoare triple {177209#(< ~counter~0 78)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176020#true} {177209#(< ~counter~0 78)} #90#return; {177209#(< ~counter~0 78)} is VALID [2022-04-27 13:19:43,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-27 13:19:43,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-27 13:19:43,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-27 13:19:43,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {177209#(< ~counter~0 78)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {176020#true} is VALID [2022-04-27 13:19:43,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {177209#(< ~counter~0 78)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {177209#(< ~counter~0 78)} is VALID [2022-04-27 13:19:43,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {177209#(< ~counter~0 78)} call #t~ret9 := main(); {177209#(< ~counter~0 78)} is VALID [2022-04-27 13:19:43,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177209#(< ~counter~0 78)} {176020#true} #102#return; {177209#(< ~counter~0 78)} is VALID [2022-04-27 13:19:43,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {177209#(< ~counter~0 78)} assume true; {177209#(< ~counter~0 78)} is VALID [2022-04-27 13:19:43,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {176020#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {177209#(< ~counter~0 78)} is VALID [2022-04-27 13:19:43,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {176020#true} call ULTIMATE.init(); {176020#true} is VALID [2022-04-27 13:19:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 44 proven. 324 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-04-27 13:19:43,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:19:43,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174480324] [2022-04-27 13:19:43,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:19:43,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826342833] [2022-04-27 13:19:43,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826342833] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:19:43,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:19:43,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-27 13:19:43,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851795471] [2022-04-27 13:19:43,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:19:43,898 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 199 [2022-04-27 13:19:43,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:19:43,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:19:44,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:19:44,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 13:19:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:19:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 13:19:44,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 13:19:44,301 INFO L87 Difference]: Start difference. First operand 7470 states and 10264 transitions. Second operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:20:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:10,959 INFO L93 Difference]: Finished difference Result 8076 states and 11149 transitions. [2022-04-27 13:20:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-04-27 13:20:10,959 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 199 [2022-04-27 13:20:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:20:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:20:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-27 13:20:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:20:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-27 13:20:10,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 940 transitions. [2022-04-27 13:20:12,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 940 edges. 940 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:20:14,562 INFO L225 Difference]: With dead ends: 8076 [2022-04-27 13:20:14,562 INFO L226 Difference]: Without dead ends: 7927 [2022-04-27 13:20:14,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3046, Invalid=5326, Unknown=0, NotChecked=0, Total=8372 [2022-04-27 13:20:14,566 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1759 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 1378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1378 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:20:14,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 978 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1378 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 13:20:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2022-04-27 13:20:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 7220. [2022-04-27 13:20:28,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:20:28,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7927 states. Second operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) [2022-04-27 13:20:28,120 INFO L74 IsIncluded]: Start isIncluded. First operand 7927 states. Second operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) [2022-04-27 13:20:28,128 INFO L87 Difference]: Start difference. First operand 7927 states. Second operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) [2022-04-27 13:20:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:29,909 INFO L93 Difference]: Finished difference Result 7927 states and 10483 transitions. [2022-04-27 13:20:29,909 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 10483 transitions. [2022-04-27 13:20:29,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:29,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:29,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) Second operand 7927 states. [2022-04-27 13:20:29,942 INFO L87 Difference]: Start difference. First operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) Second operand 7927 states. [2022-04-27 13:20:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:20:31,587 INFO L93 Difference]: Finished difference Result 7927 states and 10483 transitions. [2022-04-27 13:20:31,587 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 10483 transitions. [2022-04-27 13:20:31,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:20:31,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:20:31,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:20:31,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:20:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7220 states, 5413 states have (on average 1.1211897284315537) internal successors, (6069), 5457 states have internal predecessors, (6069), 1758 states have call successors, (1758), 50 states have call predecessors, (1758), 48 states have return successors, (1756), 1712 states have call predecessors, (1756), 1756 states have call successors, (1756) [2022-04-27 13:20:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 9583 transitions. [2022-04-27 13:20:33,670 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 9583 transitions. Word has length 199 [2022-04-27 13:20:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:20:33,670 INFO L495 AbstractCegarLoop]: Abstraction has 7220 states and 9583 transitions. [2022-04-27 13:20:33,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.44) internal successors, (222), 50 states have internal predecessors, (222), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:20:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 9583 transitions. [2022-04-27 13:20:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-04-27 13:20:33,683 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:20:33,683 INFO L195 NwaCegarLoop]: trace histogram [45, 44, 44, 20, 19, 19, 19, 17, 16, 16, 16, 11, 10, 9, 9, 9, 9, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:20:33,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-27 13:20:33,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:33,884 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:20:33,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:20:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2044709741, now seen corresponding path program 11 times [2022-04-27 13:20:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:20:33,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563071903] [2022-04-27 13:20:33,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:20:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:20:33,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:20:33,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921552861] [2022-04-27 13:20:33,936 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 13:20:33,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:20:33,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:20:33,937 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:20:33,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-27 13:20:34,374 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-27 13:20:34,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:20:34,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-27 13:20:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:20:34,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:25:09,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {214713#true} call ULTIMATE.init(); {214713#true} is VALID [2022-04-27 13:25:09,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {214713#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {214713#true} is VALID [2022-04-27 13:25:09,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {214713#true} {214713#true} #102#return; {214713#true} is VALID [2022-04-27 13:25:09,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {214713#true} call #t~ret9 := main(); {214713#true} is VALID [2022-04-27 13:25:09,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {214713#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; {214713#true} is VALID [2022-04-27 13:25:09,577 INFO L272 TraceCheckUtils]: 6: Hoare triple {214713#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:09,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {214713#true} {214713#true} #90#return; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L272 TraceCheckUtils]: 11: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {214713#true} {214713#true} #92#return; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {214713#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {214713#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {214713#true} assume !!(#t~post6 < 100);havoc #t~post6; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L272 TraceCheckUtils]: 19: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {214713#true} {214713#true} #94#return; {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {214713#true} assume !!(0 != ~r~0); {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {214713#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {214713#true} assume !!(#t~post7 < 100);havoc #t~post7; {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L272 TraceCheckUtils]: 27: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 28: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {214713#true} {214713#true} #96#return; {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {214713#true} assume !(~r~0 > 0); {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 33: Hoare triple {214713#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214713#true} is VALID [2022-04-27 13:25:09,579 INFO L290 TraceCheckUtils]: 34: Hoare triple {214713#true} assume !!(#t~post8 < 100);havoc #t~post8; {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L272 TraceCheckUtils]: 35: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {214713#true} {214713#true} #98#return; {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {214713#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {214713#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {214713#true} assume !!(#t~post8 < 100);havoc #t~post8; {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L272 TraceCheckUtils]: 43: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L290 TraceCheckUtils]: 45: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,580 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {214713#true} {214713#true} #98#return; {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {214713#true} assume !(~r~0 < 0); {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {214713#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {214713#true} assume !!(#t~post6 < 100);havoc #t~post6; {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L272 TraceCheckUtils]: 51: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {214713#true} {214713#true} #94#return; {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L290 TraceCheckUtils]: 56: Hoare triple {214713#true} assume !!(0 != ~r~0); {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L290 TraceCheckUtils]: 57: Hoare triple {214713#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L290 TraceCheckUtils]: 58: Hoare triple {214713#true} assume !!(#t~post7 < 100);havoc #t~post7; {214713#true} is VALID [2022-04-27 13:25:09,581 INFO L272 TraceCheckUtils]: 59: Hoare triple {214713#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)); {214713#true} is VALID [2022-04-27 13:25:09,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,582 INFO L290 TraceCheckUtils]: 61: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,582 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {214713#true} {214713#true} #96#return; {214713#true} is VALID [2022-04-27 13:25:09,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {214713#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {214910#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-27 13:25:09,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {214910#(< 2 (+ main_~v~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214910#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-27 13:25:09,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {214910#(< 2 (+ main_~v~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {214910#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-27 13:25:09,585 INFO L272 TraceCheckUtils]: 67: Hoare triple {214910#(< 2 (+ 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)); {214713#true} is VALID [2022-04-27 13:25:09,585 INFO L290 TraceCheckUtils]: 68: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,585 INFO L290 TraceCheckUtils]: 69: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,585 INFO L290 TraceCheckUtils]: 70: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,586 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {214713#true} {214910#(< 2 (+ main_~v~0 main_~r~0))} #96#return; {214910#(< 2 (+ main_~v~0 main_~r~0))} is VALID [2022-04-27 13:25:09,587 INFO L290 TraceCheckUtils]: 72: Hoare triple {214910#(< 2 (+ main_~v~0 main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,588 INFO L272 TraceCheckUtils]: 75: Hoare triple {214935#(< 6 (+ (* main_~v~0 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)); {214713#true} is VALID [2022-04-27 13:25:09,588 INFO L290 TraceCheckUtils]: 76: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,588 INFO L290 TraceCheckUtils]: 77: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,588 INFO L290 TraceCheckUtils]: 78: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,589 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {214713#true} {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} #96#return; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,589 INFO L290 TraceCheckUtils]: 80: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !(~r~0 > 0); {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,590 INFO L290 TraceCheckUtils]: 81: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,590 INFO L290 TraceCheckUtils]: 82: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,590 INFO L272 TraceCheckUtils]: 83: Hoare triple {214935#(< 6 (+ (* main_~v~0 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)); {214713#true} is VALID [2022-04-27 13:25:09,590 INFO L290 TraceCheckUtils]: 84: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,590 INFO L290 TraceCheckUtils]: 85: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,590 INFO L290 TraceCheckUtils]: 86: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,591 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {214713#true} {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} #98#return; {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,594 INFO L290 TraceCheckUtils]: 88: Hoare triple {214935#(< 6 (+ (* main_~v~0 2) main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,595 INFO L290 TraceCheckUtils]: 89: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,595 INFO L290 TraceCheckUtils]: 90: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,595 INFO L272 TraceCheckUtils]: 91: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 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)); {214713#true} is VALID [2022-04-27 13:25:09,595 INFO L290 TraceCheckUtils]: 92: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,595 INFO L290 TraceCheckUtils]: 93: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,596 INFO L290 TraceCheckUtils]: 94: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,596 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {214713#true} {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #98#return; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,597 INFO L290 TraceCheckUtils]: 96: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !(~r~0 < 0); {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,597 INFO L290 TraceCheckUtils]: 97: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,597 INFO L290 TraceCheckUtils]: 98: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post6 < 100);havoc #t~post6; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,597 INFO L272 TraceCheckUtils]: 99: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 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)); {214713#true} is VALID [2022-04-27 13:25:09,598 INFO L290 TraceCheckUtils]: 100: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,598 INFO L290 TraceCheckUtils]: 101: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,598 INFO L290 TraceCheckUtils]: 102: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,598 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {214713#true} {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #94#return; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,599 INFO L290 TraceCheckUtils]: 104: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(0 != ~r~0); {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,599 INFO L290 TraceCheckUtils]: 105: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,599 INFO L290 TraceCheckUtils]: 106: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,600 INFO L272 TraceCheckUtils]: 107: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 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)); {214713#true} is VALID [2022-04-27 13:25:09,600 INFO L290 TraceCheckUtils]: 108: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,600 INFO L290 TraceCheckUtils]: 109: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,600 INFO L290 TraceCheckUtils]: 110: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,600 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {214713#true} {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} #96#return; {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} is VALID [2022-04-27 13:25:09,601 INFO L290 TraceCheckUtils]: 112: Hoare triple {214984#(< (+ main_~u~0 4) (+ (* main_~v~0 2) main_~r~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:09,602 INFO L290 TraceCheckUtils]: 113: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:09,602 INFO L290 TraceCheckUtils]: 114: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:09,602 INFO L272 TraceCheckUtils]: 115: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 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)); {214713#true} is VALID [2022-04-27 13:25:09,602 INFO L290 TraceCheckUtils]: 116: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,603 INFO L290 TraceCheckUtils]: 117: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,603 INFO L290 TraceCheckUtils]: 118: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,603 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {214713#true} {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #96#return; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:09,604 INFO L290 TraceCheckUtils]: 120: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !(~r~0 > 0); {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:09,604 INFO L290 TraceCheckUtils]: 121: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:09,604 INFO L290 TraceCheckUtils]: 122: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:09,605 INFO L272 TraceCheckUtils]: 123: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 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)); {214713#true} is VALID [2022-04-27 13:25:09,605 INFO L290 TraceCheckUtils]: 124: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,605 INFO L290 TraceCheckUtils]: 125: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,605 INFO L290 TraceCheckUtils]: 126: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,605 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {214713#true} {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} #98#return; {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} is VALID [2022-04-27 13:25:09,614 INFO L290 TraceCheckUtils]: 128: Hoare triple {215057#(< (+ (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) 1) main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,626 INFO L290 TraceCheckUtils]: 129: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,628 INFO L290 TraceCheckUtils]: 130: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,628 INFO L272 TraceCheckUtils]: 131: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 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)); {214713#true} is VALID [2022-04-27 13:25:09,628 INFO L290 TraceCheckUtils]: 132: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,628 INFO L290 TraceCheckUtils]: 133: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,628 INFO L290 TraceCheckUtils]: 134: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,629 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {214713#true} {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #98#return; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,631 INFO L290 TraceCheckUtils]: 136: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !(~r~0 < 0); {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,633 INFO L290 TraceCheckUtils]: 137: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,635 INFO L290 TraceCheckUtils]: 138: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,635 INFO L272 TraceCheckUtils]: 139: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 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)); {214713#true} is VALID [2022-04-27 13:25:09,635 INFO L290 TraceCheckUtils]: 140: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,635 INFO L290 TraceCheckUtils]: 141: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,635 INFO L290 TraceCheckUtils]: 142: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,636 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {214713#true} {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #94#return; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,638 INFO L290 TraceCheckUtils]: 144: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(0 != ~r~0); {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,639 INFO L290 TraceCheckUtils]: 145: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,641 INFO L290 TraceCheckUtils]: 146: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,641 INFO L272 TraceCheckUtils]: 147: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 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)); {214713#true} is VALID [2022-04-27 13:25:09,641 INFO L290 TraceCheckUtils]: 148: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,642 INFO L290 TraceCheckUtils]: 149: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,642 INFO L290 TraceCheckUtils]: 150: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,642 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {214713#true} {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} #96#return; {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} is VALID [2022-04-27 13:25:09,645 INFO L290 TraceCheckUtils]: 152: Hoare triple {215106#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~r~0 2)) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~r~0 8)) (< (+ aux_div_v_main_~u~0_75_62 1) main_~v~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:09,651 INFO L290 TraceCheckUtils]: 153: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:09,657 INFO L290 TraceCheckUtils]: 154: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} assume !!(#t~post7 < 100);havoc #t~post7; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:09,657 INFO L272 TraceCheckUtils]: 155: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:09,657 INFO L290 TraceCheckUtils]: 156: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,657 INFO L290 TraceCheckUtils]: 157: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,657 INFO L290 TraceCheckUtils]: 158: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,658 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {214713#true} {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} #96#return; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:09,664 INFO L290 TraceCheckUtils]: 160: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} assume !(~r~0 > 0); {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:09,669 INFO L290 TraceCheckUtils]: 161: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:09,675 INFO L290 TraceCheckUtils]: 162: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} assume !!(#t~post8 < 100);havoc #t~post8; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:09,675 INFO L272 TraceCheckUtils]: 163: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:09,675 INFO L290 TraceCheckUtils]: 164: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,675 INFO L290 TraceCheckUtils]: 165: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,676 INFO L290 TraceCheckUtils]: 166: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,676 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {214713#true} {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} #98#return; {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:09,704 INFO L290 TraceCheckUtils]: 168: Hoare triple {215179#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int)) (and (<= (+ main_~u~0 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ main_~u~0 v_main_~r~0_145) (+ main_~v~0 main_~r~0)) (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (< (+ (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,708 INFO L290 TraceCheckUtils]: 169: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,711 INFO L290 TraceCheckUtils]: 170: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(#t~post8 < 100);havoc #t~post8; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,711 INFO L272 TraceCheckUtils]: 171: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ 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)); {214713#true} is VALID [2022-04-27 13:25:09,711 INFO L290 TraceCheckUtils]: 172: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,711 INFO L290 TraceCheckUtils]: 173: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,711 INFO L290 TraceCheckUtils]: 174: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,712 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {214713#true} {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #98#return; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,714 INFO L290 TraceCheckUtils]: 176: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !(~r~0 < 0); {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,718 INFO L290 TraceCheckUtils]: 177: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,721 INFO L290 TraceCheckUtils]: 178: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(#t~post6 < 100);havoc #t~post6; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,722 INFO L272 TraceCheckUtils]: 179: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ 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)); {214713#true} is VALID [2022-04-27 13:25:09,722 INFO L290 TraceCheckUtils]: 180: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,722 INFO L290 TraceCheckUtils]: 181: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,722 INFO L290 TraceCheckUtils]: 182: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,723 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {214713#true} {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #94#return; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,725 INFO L290 TraceCheckUtils]: 184: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(0 != ~r~0); {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,729 INFO L290 TraceCheckUtils]: 185: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,731 INFO L290 TraceCheckUtils]: 186: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(#t~post7 < 100);havoc #t~post7; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,732 INFO L272 TraceCheckUtils]: 187: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ 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)); {214713#true} is VALID [2022-04-27 13:25:09,732 INFO L290 TraceCheckUtils]: 188: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,732 INFO L290 TraceCheckUtils]: 189: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,732 INFO L290 TraceCheckUtils]: 190: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,733 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {214713#true} {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} #96#return; {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} is VALID [2022-04-27 13:25:09,739 INFO L290 TraceCheckUtils]: 192: Hoare triple {215228#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 3 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ main_~v~0 main_~r~0 6)) (<= main_~u~0 (+ v_main_~u~0_76 2)) (<= (+ v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ main_~v~0 main_~r~0))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:09,748 INFO L290 TraceCheckUtils]: 193: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:09,756 INFO L290 TraceCheckUtils]: 194: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} assume !!(#t~post7 < 100);havoc #t~post7; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:09,757 INFO L272 TraceCheckUtils]: 195: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 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)); {214713#true} is VALID [2022-04-27 13:25:09,757 INFO L290 TraceCheckUtils]: 196: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,757 INFO L290 TraceCheckUtils]: 197: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,757 INFO L290 TraceCheckUtils]: 198: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,758 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {214713#true} {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} #96#return; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:09,765 INFO L290 TraceCheckUtils]: 200: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} assume !(~r~0 > 0); {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:09,773 INFO L290 TraceCheckUtils]: 201: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:09,780 INFO L290 TraceCheckUtils]: 202: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} assume !!(#t~post8 < 100);havoc #t~post8; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:09,781 INFO L272 TraceCheckUtils]: 203: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 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)); {214713#true} is VALID [2022-04-27 13:25:09,781 INFO L290 TraceCheckUtils]: 204: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,781 INFO L290 TraceCheckUtils]: 205: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,781 INFO L290 TraceCheckUtils]: 206: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,781 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {214713#true} {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} #98#return; {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} is VALID [2022-04-27 13:25:09,789 INFO L290 TraceCheckUtils]: 208: Hoare triple {215301#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 2))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,796 INFO L290 TraceCheckUtils]: 209: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,798 INFO L290 TraceCheckUtils]: 210: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(#t~post8 < 100);havoc #t~post8; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,798 INFO L272 TraceCheckUtils]: 211: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:09,798 INFO L290 TraceCheckUtils]: 212: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,798 INFO L290 TraceCheckUtils]: 213: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,798 INFO L290 TraceCheckUtils]: 214: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,799 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {214713#true} {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #98#return; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,801 INFO L290 TraceCheckUtils]: 216: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !(~r~0 < 0); {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,807 INFO L290 TraceCheckUtils]: 217: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,812 INFO L290 TraceCheckUtils]: 218: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(#t~post6 < 100);havoc #t~post6; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,812 INFO L272 TraceCheckUtils]: 219: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:09,812 INFO L290 TraceCheckUtils]: 220: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,812 INFO L290 TraceCheckUtils]: 221: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,812 INFO L290 TraceCheckUtils]: 222: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,813 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {214713#true} {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #94#return; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,819 INFO L290 TraceCheckUtils]: 224: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(0 != ~r~0); {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,825 INFO L290 TraceCheckUtils]: 225: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,827 INFO L290 TraceCheckUtils]: 226: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(#t~post7 < 100);havoc #t~post7; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,827 INFO L272 TraceCheckUtils]: 227: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:09,827 INFO L290 TraceCheckUtils]: 228: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:09,827 INFO L290 TraceCheckUtils]: 229: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:09,827 INFO L290 TraceCheckUtils]: 230: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:09,828 INFO L284 TraceCheckUtils]: 231: Hoare quadruple {214713#true} {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} #96#return; {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} is VALID [2022-04-27 13:25:09,836 INFO L290 TraceCheckUtils]: 232: Hoare triple {215350#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~u~0_76 Int)) (and (< (+ 5 aux_div_v_main_~u~0_75_62) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) main_~r~0)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) main_~r~0 4))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:11,867 WARN L290 TraceCheckUtils]: 233: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is UNKNOWN [2022-04-27 13:25:11,892 INFO L290 TraceCheckUtils]: 234: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} assume !!(#t~post7 < 100);havoc #t~post7; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:11,892 INFO L272 TraceCheckUtils]: 235: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:11,892 INFO L290 TraceCheckUtils]: 236: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:11,892 INFO L290 TraceCheckUtils]: 237: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:11,892 INFO L290 TraceCheckUtils]: 238: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:11,893 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {214713#true} {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} #96#return; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:11,902 INFO L290 TraceCheckUtils]: 240: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} assume !(~r~0 > 0); {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:11,943 INFO L290 TraceCheckUtils]: 241: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:11,975 INFO L290 TraceCheckUtils]: 242: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} assume !!(#t~post8 < 100);havoc #t~post8; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:11,975 INFO L272 TraceCheckUtils]: 243: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-27 13:25:11,975 INFO L290 TraceCheckUtils]: 244: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:11,975 INFO L290 TraceCheckUtils]: 245: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:11,975 INFO L290 TraceCheckUtils]: 246: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:11,976 INFO L284 TraceCheckUtils]: 247: Hoare quadruple {214713#true} {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} #98#return; {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} is VALID [2022-04-27 13:25:12,006 INFO L290 TraceCheckUtils]: 248: Hoare triple {215423#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ v_main_~u~0_76 main_~u~0 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~r~0 4)) (<= (+ v_main_~v~0_98 2) main_~v~0) (<= main_~u~0 (+ v_main_~u~0_76 4)) (<= (+ main_~u~0 2 v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,016 INFO L290 TraceCheckUtils]: 249: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,022 INFO L290 TraceCheckUtils]: 250: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(#t~post8 < 100);havoc #t~post8; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,022 INFO L272 TraceCheckUtils]: 251: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:12,022 INFO L290 TraceCheckUtils]: 252: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,022 INFO L290 TraceCheckUtils]: 253: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,023 INFO L290 TraceCheckUtils]: 254: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,023 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {214713#true} {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #98#return; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,141 INFO L290 TraceCheckUtils]: 256: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !(~r~0 < 0); {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,191 INFO L290 TraceCheckUtils]: 257: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,200 INFO L290 TraceCheckUtils]: 258: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(#t~post6 < 100);havoc #t~post6; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,201 INFO L272 TraceCheckUtils]: 259: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:12,201 INFO L290 TraceCheckUtils]: 260: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,201 INFO L290 TraceCheckUtils]: 261: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,201 INFO L290 TraceCheckUtils]: 262: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,201 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {214713#true} {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #94#return; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,210 INFO L290 TraceCheckUtils]: 264: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(0 != ~r~0); {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,220 INFO L290 TraceCheckUtils]: 265: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,229 INFO L290 TraceCheckUtils]: 266: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(#t~post7 < 100);havoc #t~post7; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,229 INFO L272 TraceCheckUtils]: 267: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:12,229 INFO L290 TraceCheckUtils]: 268: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,229 INFO L290 TraceCheckUtils]: 269: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,229 INFO L290 TraceCheckUtils]: 270: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,230 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {214713#true} {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} #96#return; {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} is VALID [2022-04-27 13:25:12,236 INFO L290 TraceCheckUtils]: 272: Hoare triple {215472#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 2) main_~v~0) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~r~0 8))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:12,242 INFO L290 TraceCheckUtils]: 273: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:12,245 INFO L290 TraceCheckUtils]: 274: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} assume !!(#t~post7 < 100);havoc #t~post7; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:12,245 INFO L272 TraceCheckUtils]: 275: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:12,245 INFO L290 TraceCheckUtils]: 276: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,245 INFO L290 TraceCheckUtils]: 277: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,245 INFO L290 TraceCheckUtils]: 278: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,245 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {214713#true} {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} #96#return; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:12,247 INFO L290 TraceCheckUtils]: 280: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} assume !(~r~0 > 0); {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:12,252 INFO L290 TraceCheckUtils]: 281: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:12,254 INFO L290 TraceCheckUtils]: 282: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} assume !!(#t~post8 < 100);havoc #t~post8; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:12,254 INFO L272 TraceCheckUtils]: 283: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~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)); {214713#true} is VALID [2022-04-27 13:25:12,255 INFO L290 TraceCheckUtils]: 284: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,255 INFO L290 TraceCheckUtils]: 285: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,255 INFO L290 TraceCheckUtils]: 286: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,255 INFO L284 TraceCheckUtils]: 287: Hoare quadruple {214713#true} {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} #98#return; {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} is VALID [2022-04-27 13:25:12,287 INFO L290 TraceCheckUtils]: 288: Hoare triple {215545#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int)) (and (<= main_~u~0 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ v_main_~r~0_145 (* main_~u~0 2) (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< (+ v_main_~u~0_76 (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62) (* main_~u~0 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,313 INFO L290 TraceCheckUtils]: 289: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,339 INFO L290 TraceCheckUtils]: 290: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(#t~post8 < 100);havoc #t~post8; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,340 INFO L272 TraceCheckUtils]: 291: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 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)); {214713#true} is VALID [2022-04-27 13:25:12,340 INFO L290 TraceCheckUtils]: 292: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,340 INFO L290 TraceCheckUtils]: 293: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,340 INFO L290 TraceCheckUtils]: 294: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,341 INFO L284 TraceCheckUtils]: 295: Hoare quadruple {214713#true} {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #98#return; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,366 INFO L290 TraceCheckUtils]: 296: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !(~r~0 < 0); {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,461 INFO L290 TraceCheckUtils]: 297: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,519 INFO L290 TraceCheckUtils]: 298: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(#t~post6 < 100);havoc #t~post6; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,520 INFO L272 TraceCheckUtils]: 299: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 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)); {214713#true} is VALID [2022-04-27 13:25:12,520 INFO L290 TraceCheckUtils]: 300: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,520 INFO L290 TraceCheckUtils]: 301: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,520 INFO L290 TraceCheckUtils]: 302: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,521 INFO L284 TraceCheckUtils]: 303: Hoare quadruple {214713#true} {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #94#return; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,550 INFO L290 TraceCheckUtils]: 304: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(0 != ~r~0); {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,642 INFO L290 TraceCheckUtils]: 305: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,672 INFO L290 TraceCheckUtils]: 306: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(#t~post7 < 100);havoc #t~post7; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,673 INFO L272 TraceCheckUtils]: 307: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 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)); {214713#true} is VALID [2022-04-27 13:25:12,673 INFO L290 TraceCheckUtils]: 308: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,673 INFO L290 TraceCheckUtils]: 309: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,673 INFO L290 TraceCheckUtils]: 310: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,674 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {214713#true} {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} #96#return; {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} is VALID [2022-04-27 13:25:12,686 INFO L290 TraceCheckUtils]: 312: Hoare triple {215594#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0 6)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) main_~v~0 main_~r~0)) (<= (+ v_main_~v~0_98 4) main_~v~0) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,702 INFO L290 TraceCheckUtils]: 313: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,715 INFO L290 TraceCheckUtils]: 314: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,715 INFO L272 TraceCheckUtils]: 315: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:12,715 INFO L290 TraceCheckUtils]: 316: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,715 INFO L290 TraceCheckUtils]: 317: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,715 INFO L290 TraceCheckUtils]: 318: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,716 INFO L284 TraceCheckUtils]: 319: Hoare quadruple {214713#true} {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #96#return; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,727 INFO L290 TraceCheckUtils]: 320: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !(~r~0 > 0); {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,741 INFO L290 TraceCheckUtils]: 321: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,757 INFO L290 TraceCheckUtils]: 322: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,757 INFO L272 TraceCheckUtils]: 323: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:12,757 INFO L290 TraceCheckUtils]: 324: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,757 INFO L290 TraceCheckUtils]: 325: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,757 INFO L290 TraceCheckUtils]: 326: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,758 INFO L284 TraceCheckUtils]: 327: Hoare quadruple {214713#true} {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #98#return; {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,781 INFO L290 TraceCheckUtils]: 328: Hoare triple {215667#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (<= (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= main_~u~0 (+ v_main_~u~0_79 2)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) main_~r~0 2)) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,795 INFO L290 TraceCheckUtils]: 329: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,810 INFO L290 TraceCheckUtils]: 330: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,810 INFO L272 TraceCheckUtils]: 331: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:12,810 INFO L290 TraceCheckUtils]: 332: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,810 INFO L290 TraceCheckUtils]: 333: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,810 INFO L290 TraceCheckUtils]: 334: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,811 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {214713#true} {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #98#return; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,823 INFO L290 TraceCheckUtils]: 336: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !(~r~0 < 0); {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,842 INFO L290 TraceCheckUtils]: 337: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,854 INFO L290 TraceCheckUtils]: 338: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,855 INFO L272 TraceCheckUtils]: 339: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:12,855 INFO L290 TraceCheckUtils]: 340: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,855 INFO L290 TraceCheckUtils]: 341: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,855 INFO L290 TraceCheckUtils]: 342: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,855 INFO L284 TraceCheckUtils]: 343: Hoare quadruple {214713#true} {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #94#return; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,871 INFO L290 TraceCheckUtils]: 344: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(0 != ~r~0); {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,883 INFO L290 TraceCheckUtils]: 345: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,899 INFO L290 TraceCheckUtils]: 346: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:12,899 INFO L272 TraceCheckUtils]: 347: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) 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)); {214713#true} is VALID [2022-04-27 13:25:12,899 INFO L290 TraceCheckUtils]: 348: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:12,899 INFO L290 TraceCheckUtils]: 349: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:12,899 INFO L290 TraceCheckUtils]: 350: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:12,900 INFO L284 TraceCheckUtils]: 351: Hoare quadruple {214713#true} {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} #96#return; {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} is VALID [2022-04-27 13:25:14,922 WARN L290 TraceCheckUtils]: 352: Hoare triple {215716#(exists ((v_main_~r~0_145 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3) 1)) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< main_~r~0 (+ v_main_~u~0_79 2)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* main_~v~0 2) (* v_main_~v~0_98 3))) (<= (+ v_main_~v~0_98 6) main_~v~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is UNKNOWN [2022-04-27 13:25:14,940 INFO L290 TraceCheckUtils]: 353: Hoare triple {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:16,960 WARN L290 TraceCheckUtils]: 354: Hoare triple {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} assume !!(#t~post7 < 100);havoc #t~post7; {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is UNKNOWN [2022-04-27 13:25:16,960 INFO L272 TraceCheckUtils]: 355: Hoare triple {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 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)); {214713#true} is VALID [2022-04-27 13:25:16,960 INFO L290 TraceCheckUtils]: 356: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:16,960 INFO L290 TraceCheckUtils]: 357: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:16,961 INFO L290 TraceCheckUtils]: 358: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:16,962 INFO L284 TraceCheckUtils]: 359: Hoare quadruple {214713#true} {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} #96#return; {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:17,122 INFO L290 TraceCheckUtils]: 360: Hoare triple {215789#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (<= (+ 2 v_main_~v~0_101) main_~v~0) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (< (+ main_~r~0 v_main_~v~0_101) (+ v_main_~u~0_79 2)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:17,123 INFO L290 TraceCheckUtils]: 361: Hoare triple {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:17,123 INFO L290 TraceCheckUtils]: 362: Hoare triple {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} assume !!(#t~post7 < 100);havoc #t~post7; {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:17,123 INFO L272 TraceCheckUtils]: 363: Hoare triple {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 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)); {214713#true} is VALID [2022-04-27 13:25:17,123 INFO L290 TraceCheckUtils]: 364: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-27 13:25:17,123 INFO L290 TraceCheckUtils]: 365: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-27 13:25:17,123 INFO L290 TraceCheckUtils]: 366: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-27 13:25:17,124 INFO L284 TraceCheckUtils]: 367: Hoare quadruple {214713#true} {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} #96#return; {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 368: Hoare triple {215814#(exists ((v_main_~r~0_145 Int) (v_main_~v~0_101 Int) (aux_div_v_main_~u~0_75_62 Int) (v_main_~v~0_98 Int) (v_main_~u~0_76 Int) (v_main_~u~0_79 Int)) (and (< (+ (* v_main_~u~0_79 3) v_main_~r~0_145 4 (* v_main_~u~0_76 2)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101))) (<= (+ v_main_~u~0_76 3) (+ (* 3 aux_div_v_main_~u~0_75_62) v_main_~r~0_145)) (< (+ (* 2 v_main_~v~0_101) main_~r~0) v_main_~u~0_79) (< (+ 5 aux_div_v_main_~u~0_75_62) v_main_~v~0_98) (< v_main_~v~0_101 (+ v_main_~u~0_79 1)) (<= v_main_~u~0_79 (+ v_main_~u~0_76 6)) (<= (+ v_main_~v~0_98 6) v_main_~v~0_101) (< (+ v_main_~u~0_76 (* v_main_~u~0_79 3) (* 2 v_main_~r~0_145) (* 3 aux_div_v_main_~u~0_75_62)) (+ (* v_main_~v~0_98 3) (* 2 v_main_~v~0_101) 1))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 369: Hoare triple {214714#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 370: Hoare triple {214714#false} assume !(#t~post7 < 100);havoc #t~post7; {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 371: Hoare triple {214714#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 372: Hoare triple {214714#false} assume !(#t~post8 < 100);havoc #t~post8; {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 373: Hoare triple {214714#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 374: Hoare triple {214714#false} assume !(#t~post6 < 100);havoc #t~post6; {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L272 TraceCheckUtils]: 375: Hoare triple {214714#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 376: Hoare triple {214714#false} ~cond := #in~cond; {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 377: Hoare triple {214714#false} assume 0 == ~cond; {214714#false} is VALID [2022-04-27 13:25:17,129 INFO L290 TraceCheckUtils]: 378: Hoare triple {214714#false} assume !false; {214714#false} is VALID [2022-04-27 13:25:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5272 backedges. 480 proven. 904 refuted. 88 times theorem prover too weak. 3800 trivial. 0 not checked. [2022-04-27 13:25:17,133 INFO L328 TraceCheckSpWp]: Computing backward predicates...