/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-34549b5 [2022-04-07 14:01:33,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 14:01:33,904 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 14:01:33,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 14:01:33,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 14:01:33,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 14:01:33,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 14:01:33,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 14:01:33,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 14:01:33,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 14:01:33,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 14:01:33,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 14:01:33,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 14:01:33,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 14:01:33,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 14:01:33,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 14:01:33,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 14:01:33,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 14:01:33,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 14:01:33,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 14:01:33,954 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 14:01:33,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 14:01:33,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 14:01:33,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 14:01:33,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 14:01:33,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 14:01:33,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 14:01:33,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 14:01:33,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 14:01:33,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 14:01:33,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 14:01:33,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 14:01:33,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 14:01:33,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 14:01:33,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 14:01:33,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 14:01:33,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 14:01:33,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 14:01:33,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 14:01:33,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 14:01:33,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 14:01:33,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 14:01:33,971 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-07 14:01:33,984 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 14:01:33,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 14:01:33,984 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 14:01:33,984 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 14:01:33,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 14:01:33,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 14:01:33,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 14:01:33,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 14:01:33,985 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 14:01:33,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 14:01:33,985 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 14:01:33,985 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 14:01:33,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 14:01:33,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 14:01:33,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 14:01:33,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 14:01:33,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 14:01:33,986 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 14:01:33,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 14:01:33,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 14:01:33,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 14:01:33,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 14:01:33,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 14:01:33,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 14:01:33,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:01:33,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 14:01:33,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 14:01:33,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 14:01:33,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 14:01:33,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 14:01:33,987 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 14:01:33,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 14:01:33,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 14:01:33,988 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-07 14:01:34,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 14:01:34,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 14:01:34,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 14:01:34,184 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 14:01:34,199 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 14:01:34,200 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-07 14:01:34,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b99fb68/6077b5d8facc4b81a98058bd35b7dc63/FLAGeeac2e55e [2022-04-07 14:01:34,596 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 14:01:34,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-07 14:01:34,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b99fb68/6077b5d8facc4b81a98058bd35b7dc63/FLAGeeac2e55e [2022-04-07 14:01:34,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b99fb68/6077b5d8facc4b81a98058bd35b7dc63 [2022-04-07 14:01:34,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 14:01:34,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 14:01:34,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 14:01:34,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 14:01:34,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 14:01:34,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf38fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34, skipping insertion in model container [2022-04-07 14:01:34,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 14:01:34,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 14:01:34,767 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-07 14:01:34,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:01:34,793 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 14:01:34,806 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-07 14:01:34,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 14:01:34,827 INFO L208 MainTranslator]: Completed translation [2022-04-07 14:01:34,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34 WrapperNode [2022-04-07 14:01:34,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 14:01:34,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 14:01:34,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 14:01:34,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 14:01:34,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 14:01:34,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 14:01:34,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 14:01:34,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 14:01:34,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34" (1/1) ... [2022-04-07 14:01:34,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 14:01:34,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:01:34,875 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-07 14:01:34,899 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-07 14:01:34,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 14:01:34,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 14:01:34,904 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 14:01:34,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 14:01:34,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 14:01:34,905 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 14:01:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 14:01:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 14:01:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 14:01:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 14:01:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 14:01:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 14:01:34,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 14:01:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 14:01:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 14:01:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 14:01:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 14:01:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 14:01:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 14:01:34,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 14:01:34,946 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 14:01:34,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 14:01:35,070 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 14:01:35,075 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 14:01:35,075 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 14:01:35,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:01:35 BoogieIcfgContainer [2022-04-07 14:01:35,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 14:01:35,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 14:01:35,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 14:01:35,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 14:01:35,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 02:01:34" (1/3) ... [2022-04-07 14:01:35,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b0a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:01:35, skipping insertion in model container [2022-04-07 14:01:35,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 02:01:34" (2/3) ... [2022-04-07 14:01:35,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b0a588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 02:01:35, skipping insertion in model container [2022-04-07 14:01:35,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 02:01:35" (3/3) ... [2022-04-07 14:01:35,096 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound100.c [2022-04-07 14:01:35,099 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 14:01:35,099 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 14:01:35,125 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 14:01:35,129 INFO L340 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 [2022-04-07 14:01:35,129 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 14:01:35,141 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-07 14:01:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 14:01:35,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:01:35,145 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:01:35,145 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:01:35,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:01:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-07 14:01:35,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:01:35,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972735690] [2022-04-07 14:01:35,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:35,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:01:35,221 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:01:35,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918902267] [2022-04-07 14:01:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:35,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:01:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:01:35,225 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-07 14:01:35,226 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-07 14:01:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:35,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-07 14:01:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:35,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:01:35,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-07 14:01:35,397 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-07 14:01:35,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-07 14:01:35,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-07 14:01:35,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-07 14:01:35,398 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-07 14:01:35,398 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-07 14:01:35,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-07 14:01:35,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-07 14:01:35,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-07 14:01:35,400 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #90#return; {41#false} is VALID [2022-04-07 14:01:35,400 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-07 14:01:35,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-07 14:01:35,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-07 14:01:35,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-07 14:01:35,400 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {41#false} #92#return; {41#false} is VALID [2022-04-07 14:01:35,400 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-07 14:01:35,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-07 14:01:35,401 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-07 14:01:35,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-07 14:01:35,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-07 14:01:35,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-07 14:01:35,403 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-07 14:01:35,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:01:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:01:35,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972735690] [2022-04-07 14:01:35,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:01:35,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918902267] [2022-04-07 14:01:35,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918902267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:01:35,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:01:35,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-07 14:01:35,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733915086] [2022-04-07 14:01:35,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:01:35,411 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-07 14:01:35,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:01:35,414 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-07 14:01:35,435 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-07 14:01:35,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-07 14:01:35,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:01:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-07 14:01:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-07 14:01:35,461 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-07 14:01:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:35,510 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-07 14:01:35,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-07 14:01:35,510 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-07 14:01:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:01:35,511 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-07 14:01:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-07 14:01:35,517 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-07 14:01:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-07 14:01:35,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-07 14:01:35,599 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-07 14:01:35,605 INFO L225 Difference]: With dead ends: 67 [2022-04-07 14:01:35,605 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 14:01:35,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-07 14:01:35,609 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:01:35,609 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:01:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 14:01:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 14:01:35,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:01:35,628 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-07 14:01:35,628 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-07 14:01:35,629 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-07 14:01:35,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:35,637 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 14:01:35,637 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:01:35,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:01:35,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:01:35,643 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-07 14:01:35,644 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-07 14:01:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:35,646 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-07 14:01:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:01:35,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:01:35,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:01:35,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:01:35,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:01:35,647 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-07 14:01:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-07 14:01:35,650 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-07 14:01:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:01:35,650 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-07 14:01:35,650 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 14:01:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-07 14:01:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 14:01:35,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:01:35,651 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:01:35,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 14:01:35,851 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-07 14:01:35,852 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:01:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:01:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-07 14:01:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:01:35,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540176230] [2022-04-07 14:01:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:01:35,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:01:35,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943184448] [2022-04-07 14:01:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:35,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:01:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:01:35,868 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-07 14:01:35,869 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-07 14:01:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:35,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 14:01:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:35,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:01:36,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {307#true} call ULTIMATE.init(); {307#true} is VALID [2022-04-07 14:01:36,082 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-07 14:01:36,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {315#(<= ~counter~0 0)} {307#true} #102#return; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {315#(<= ~counter~0 0)} call #t~ret9 := main(); {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,086 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-07 14:01:36,088 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-07 14:01:36,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,090 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #90#return; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,091 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-07 14:01:36,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#(<= ~counter~0 0)} ~cond := #in~cond; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#(<= ~counter~0 0)} assume !(0 == ~cond); {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#(<= ~counter~0 0)} assume true; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,093 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {315#(<= ~counter~0 0)} {315#(<= ~counter~0 0)} #92#return; {315#(<= ~counter~0 0)} is VALID [2022-04-07 14:01:36,093 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-07 14:01:36,094 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-07 14:01:36,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {364#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {308#false} is VALID [2022-04-07 14:01:36,095 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-07 14:01:36,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {308#false} ~cond := #in~cond; {308#false} is VALID [2022-04-07 14:01:36,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {308#false} assume 0 == ~cond; {308#false} is VALID [2022-04-07 14:01:36,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-04-07 14:01:36,095 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-07 14:01:36,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:01:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:01:36,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540176230] [2022-04-07 14:01:36,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:01:36,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943184448] [2022-04-07 14:01:36,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943184448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:01:36,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:01:36,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:01:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815079302] [2022-04-07 14:01:36,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:01:36,101 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-07 14:01:36,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:01:36,102 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-07 14:01:36,118 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-07 14:01:36,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:01:36,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:01:36,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:01:36,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:01:36,119 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-07 14:01:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:36,200 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-07 14:01:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 14:01:36,200 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-07 14:01:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:01:36,201 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-07 14:01:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-07 14:01:36,213 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-07 14:01:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-07 14:01:36,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-07 14:01:36,251 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-07 14:01:36,254 INFO L225 Difference]: With dead ends: 41 [2022-04-07 14:01:36,254 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 14:01:36,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:01:36,257 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:01:36,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:01:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 14:01:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-07 14:01:36,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:01:36,270 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-07 14:01:36,271 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-07 14:01:36,273 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-07 14:01:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:36,280 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 14:01:36,280 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 14:01:36,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:01:36,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:01:36,282 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-07 14:01:36,283 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-07 14:01:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:01:36,289 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-07 14:01:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 14:01:36,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:01:36,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:01:36,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:01:36,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:01:36,293 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-07 14:01:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-07 14:01:36,298 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-07 14:01:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:01:36,298 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-07 14:01:36,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 14:01:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-07 14:01:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 14:01:36,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:01:36,300 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:01:36,318 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-07 14:01:36,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-07 14:01:36,501 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:01:36,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:01:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-07 14:01:36,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:01:36,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078780235] [2022-04-07 14:01:36,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:36,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:01:36,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:01:36,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820453862] [2022-04-07 14:01:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:01:36,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:01:36,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:01:36,527 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-07 14:01:36,544 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-07 14:01:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:01:36,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:01:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-07 14:01:44,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:01:45,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-07 14:01:45,441 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-07 14:01:45,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-07 14:01:45,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #102#return; {554#true} is VALID [2022-04-07 14:01:45,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret9 := main(); {554#true} is VALID [2022-04-07 14:01:45,441 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-07 14:01:45,441 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-07 14:01:45,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-07 14:01:45,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-07 14:01:45,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-07 14:01:45,442 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #90#return; {554#true} is VALID [2022-04-07 14:01:45,442 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-07 14:01:45,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-07 14:01:45,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-07 14:01:45,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-07 14:01:45,443 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #92#return; {554#true} is VALID [2022-04-07 14:01:47,282 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-07 14:01:47,283 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-07 14:01:47,284 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-07 14:01:47,574 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-07 14:01:47,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:01:47,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-07 14:01:47,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-07 14:01:47,576 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-07 14:01:47,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:01:47,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:01:47,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078780235] [2022-04-07 14:01:47,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:01:47,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820453862] [2022-04-07 14:01:47,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820453862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:01:47,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:01:47,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:01:47,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79988969] [2022-04-07 14:01:47,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:01:47,577 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-07 14:01:47,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:01:47,577 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-07 14:01:49,919 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-07 14:01:49,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:01:49,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:01:49,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:01:49,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:01:49,920 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-07 14:01:51,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:01:55,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:01:57,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 14:02:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:03,277 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-07 14:02:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:02:03,277 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-07 14:02:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:03,277 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-07 14:02:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 14:02:03,279 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-07 14:02:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-07 14:02:03,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-07 14:02:09,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 66 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-07 14:02:09,216 INFO L225 Difference]: With dead ends: 53 [2022-04-07 14:02:09,216 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 14:02:09,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 14:02:09,217 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:09,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-07 14:02:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 14:02:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-07 14:02:09,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:09,235 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-07 14:02:09,235 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-07 14:02:09,236 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-07 14:02:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:09,238 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-07 14:02:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-07 14:02:09,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:09,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:09,238 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-07 14:02:09,238 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-07 14:02:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:09,240 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-07 14:02:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-07 14:02:09,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:09,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:09,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:09,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:09,241 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-07 14:02:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-07 14:02:09,243 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-07 14:02:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:09,243 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-07 14:02:09,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 14:02:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-07 14:02:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 14:02:09,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:09,244 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:09,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 14:02:09,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:09,453 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:09,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-07 14:02:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:09,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528278756] [2022-04-07 14:02:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:09,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:09,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2059092336] [2022-04-07 14:02:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:09,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:09,470 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-07 14:02:09,470 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-07 14:02:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:09,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 14:02:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:09,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:09,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-07 14:02:09,653 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-07 14:02:09,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:09,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-07 14:02:09,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-07 14:02:09,653 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-07 14:02:09,653 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-07 14:02:09,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:09,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:09,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:09,654 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-07 14:02:09,654 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-07 14:02:09,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:09,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:09,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:09,654 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-07 14:02:09,654 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-07 14:02:09,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-07 14:02:09,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 100);havoc #t~post6; {877#true} is VALID [2022-04-07 14:02:09,656 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-07 14:02:09,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {877#true} ~cond := #in~cond; {942#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:09,657 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-07 14:02:09,657 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-07 14:02:09,658 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-07 14:02:09,659 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-07 14:02:09,659 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-07 14:02:09,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:09,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-07 14:02:09,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-07 14:02:09,660 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-07 14:02:09,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:10,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {878#false} assume !false; {878#false} is VALID [2022-04-07 14:02:10,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {878#false} is VALID [2022-04-07 14:02:10,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 14:02:10,031 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-07 14:02:10,032 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-07 14:02:10,034 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-07 14:02:10,036 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-07 14:02:10,037 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-07 14:02:10,037 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-07 14:02:10,037 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-07 14:02:10,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {877#true} assume !!(#t~post6 < 100);havoc #t~post6; {877#true} is VALID [2022-04-07 14:02:10,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {877#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {877#true} is VALID [2022-04-07 14:02:10,038 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-07 14:02:10,038 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {877#true} #92#return; {877#true} is VALID [2022-04-07 14:02:10,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:10,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:10,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:10,039 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-07 14:02:10,039 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {877#true} {877#true} #90#return; {877#true} is VALID [2022-04-07 14:02:10,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:10,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {877#true} assume !(0 == ~cond); {877#true} is VALID [2022-04-07 14:02:10,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {877#true} ~cond := #in~cond; {877#true} is VALID [2022-04-07 14:02:10,046 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-07 14:02:10,047 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-07 14:02:10,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret9 := main(); {877#true} is VALID [2022-04-07 14:02:10,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #102#return; {877#true} is VALID [2022-04-07 14:02:10,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2022-04-07 14:02:10,047 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-07 14:02:10,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2022-04-07 14:02:10,047 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-07 14:02:10,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:10,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528278756] [2022-04-07 14:02:10,048 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:10,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059092336] [2022-04-07 14:02:10,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059092336] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:10,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:10,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-07 14:02:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504969110] [2022-04-07 14:02:10,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:10,048 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-07 14:02:10,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:10,049 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-07 14:02:10,070 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-07 14:02:10,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:02:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:10,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:02:10,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:10,071 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-07 14:02:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:10,470 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-07 14:02:10,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 14:02:10,470 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-07 14:02:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:10,471 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-07 14:02:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-07 14:02:10,472 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-07 14:02:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-07 14:02:10,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-07 14:02:10,516 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-07 14:02:10,517 INFO L225 Difference]: With dead ends: 57 [2022-04-07 14:02:10,517 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 14:02:10,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-07 14:02:10,518 INFO L913 BasicCegarLoop]: 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-07 14:02:10,518 INFO L914 BasicCegarLoop]: 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-07 14:02:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 14:02:10,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2022-04-07 14:02:10,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:10,529 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-07 14:02:10,529 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-07 14:02:10,529 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-07 14:02:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:10,533 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-07 14:02:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-07 14:02:10,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:10,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:10,533 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-07 14:02:10,534 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-07 14:02:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:10,538 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-07 14:02:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-07 14:02:10,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:10,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:10,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:10,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:10,539 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-07 14:02:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-07 14:02:10,540 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 29 [2022-04-07 14:02:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:10,542 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-07 14:02:10,542 INFO L479 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-07 14:02:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-07 14:02:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-07 14:02:10,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:10,543 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:10,561 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-07 14:02:10,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:10,760 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:10,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-07 14:02:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:10,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22690252] [2022-04-07 14:02:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:10,774 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:10,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789593698] [2022-04-07 14:02:10,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:10,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:10,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:10,775 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-07 14:02:10,776 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-07 14:02:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:10,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 14:02:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:10,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:10,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {1302#true} call ULTIMATE.init(); {1302#true} is VALID [2022-04-07 14:02:10,939 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-07 14:02:10,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1310#(<= ~counter~0 0)} {1302#true} #102#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {1310#(<= ~counter~0 0)} call #t~ret9 := main(); {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,941 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-07 14:02:10,941 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-07 14:02:10,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #90#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,943 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-07 14:02:10,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {1310#(<= ~counter~0 0)} ~cond := #in~cond; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {1310#(<= ~counter~0 0)} assume !(0 == ~cond); {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {1310#(<= ~counter~0 0)} assume true; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,944 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1310#(<= ~counter~0 0)} {1310#(<= ~counter~0 0)} #92#return; {1310#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:10,944 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-07 14:02:10,945 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-07 14:02:10,945 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-07 14:02:10,945 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-07 14:02:10,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {1359#(<= ~counter~0 1)} ~cond := #in~cond; {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:10,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {1359#(<= ~counter~0 1)} assume !(0 == ~cond); {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:10,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {1359#(<= ~counter~0 1)} assume true; {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:10,947 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1359#(<= ~counter~0 1)} {1359#(<= ~counter~0 1)} #94#return; {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:10,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {1359#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1359#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:10,947 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-07 14:02:10,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {1384#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1303#false} is VALID [2022-04-07 14:02:10,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {1303#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1303#false} is VALID [2022-04-07 14:02:10,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {1303#false} assume !(#t~post8 < 100);havoc #t~post8; {1303#false} is VALID [2022-04-07 14:02:10,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {1303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1303#false} is VALID [2022-04-07 14:02:10,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {1303#false} assume !(#t~post6 < 100);havoc #t~post6; {1303#false} is VALID [2022-04-07 14:02:10,948 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-07 14:02:10,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {1303#false} ~cond := #in~cond; {1303#false} is VALID [2022-04-07 14:02:10,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {1303#false} assume 0 == ~cond; {1303#false} is VALID [2022-04-07 14:02:10,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {1303#false} assume !false; {1303#false} is VALID [2022-04-07 14:02:10,949 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-07 14:02:10,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:10,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:10,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22690252] [2022-04-07 14:02:10,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:10,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789593698] [2022-04-07 14:02:10,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789593698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:10,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:10,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:02:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558053259] [2022-04-07 14:02:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:10,950 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-07 14:02:10,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:10,951 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-07 14:02:10,970 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-07 14:02:10,970 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:02:10,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:10,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:02:10,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:02:10,971 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-07 14:02:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:11,073 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-07 14:02:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:02:11,073 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-07 14:02:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:11,073 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-07 14:02:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 14:02:11,075 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-07 14:02:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 14:02:11,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-07 14:02:11,128 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-07 14:02:11,129 INFO L225 Difference]: With dead ends: 65 [2022-04-07 14:02:11,129 INFO L226 Difference]: Without dead ends: 44 [2022-04-07 14:02:11,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:02:11,130 INFO L913 BasicCegarLoop]: 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-07 14:02:11,130 INFO L914 BasicCegarLoop]: 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-07 14:02:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-07 14:02:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-07 14:02:11,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:11,147 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-07 14:02:11,147 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-07 14:02:11,147 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-07 14:02:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:11,148 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-07 14:02:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-07 14:02:11,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:11,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:11,149 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-07 14:02:11,149 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-07 14:02:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:11,150 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-07 14:02:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-07 14:02:11,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:11,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:11,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:11,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:11,150 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-07 14:02:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-07 14:02:11,151 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 35 [2022-04-07 14:02:11,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:11,152 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-07 14:02:11,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 14:02:11,152 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-07 14:02:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 14:02:11,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:11,152 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:11,173 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-07 14:02:11,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:11,363 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:11,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:11,364 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-07 14:02:11,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:11,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874581422] [2022-04-07 14:02:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:11,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:11,376 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:11,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677778546] [2022-04-07 14:02:11,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:11,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:11,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:11,378 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-07 14:02:11,380 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-07 14:02:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:11,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 14:02:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:11,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:11,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-07 14:02:11,612 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-07 14:02:11,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1662#(<= ~counter~0 0)} {1654#true} #102#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {1662#(<= ~counter~0 0)} call #t~ret9 := main(); {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,613 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-07 14:02:11,613 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-07 14:02:11,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #90#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,615 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-07 14:02:11,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {1662#(<= ~counter~0 0)} ~cond := #in~cond; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {1662#(<= ~counter~0 0)} assume !(0 == ~cond); {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {1662#(<= ~counter~0 0)} assume true; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,617 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1662#(<= ~counter~0 0)} {1662#(<= ~counter~0 0)} #92#return; {1662#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:11,617 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-07 14:02:11,618 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-07 14:02:11,618 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-07 14:02:11,618 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-07 14:02:11,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {1711#(<= ~counter~0 1)} ~cond := #in~cond; {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:11,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {1711#(<= ~counter~0 1)} assume !(0 == ~cond); {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:11,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {1711#(<= ~counter~0 1)} assume true; {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:11,620 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1711#(<= ~counter~0 1)} {1711#(<= ~counter~0 1)} #94#return; {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:11,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {1711#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1711#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:11,621 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-07 14:02:11,621 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-07 14:02:11,621 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-07 14:02:11,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {1736#(<= ~counter~0 2)} ~cond := #in~cond; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:11,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {1736#(<= ~counter~0 2)} assume !(0 == ~cond); {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:11,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {1736#(<= ~counter~0 2)} assume true; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:11,623 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1736#(<= ~counter~0 2)} {1736#(<= ~counter~0 2)} #96#return; {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:11,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {1736#(<= ~counter~0 2)} assume !(~r~0 > 0); {1736#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:11,624 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-07 14:02:11,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {1761#(<= |main_#t~post8| 2)} assume !(#t~post8 < 100);havoc #t~post8; {1655#false} is VALID [2022-04-07 14:02:11,624 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-07 14:02:11,624 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 100);havoc #t~post6; {1655#false} is VALID [2022-04-07 14:02:11,624 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-07 14:02:11,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-07 14:02:11,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-07 14:02:11,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-07 14:02:11,625 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-07 14:02:11,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:11,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {1655#false} assume !false; {1655#false} is VALID [2022-04-07 14:02:11,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {1655#false} assume 0 == ~cond; {1655#false} is VALID [2022-04-07 14:02:11,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {1655#false} ~cond := #in~cond; {1655#false} is VALID [2022-04-07 14:02:11,835 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-07 14:02:11,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {1655#false} assume !(#t~post6 < 100);havoc #t~post6; {1655#false} is VALID [2022-04-07 14:02:11,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {1655#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#false} is VALID [2022-04-07 14:02:11,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {1801#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {1655#false} is VALID [2022-04-07 14:02:11,836 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-07 14:02:11,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {1805#(< ~counter~0 100)} assume !(~r~0 > 0); {1805#(< ~counter~0 100)} is VALID [2022-04-07 14:02:11,837 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1654#true} {1805#(< ~counter~0 100)} #96#return; {1805#(< ~counter~0 100)} is VALID [2022-04-07 14:02:11,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-07 14:02:11,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-07 14:02:11,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-07 14:02:11,837 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-07 14:02:11,837 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-07 14:02:11,838 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-07 14:02:11,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {1830#(< ~counter~0 99)} assume !!(0 != ~r~0); {1830#(< ~counter~0 99)} is VALID [2022-04-07 14:02:11,839 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1654#true} {1830#(< ~counter~0 99)} #94#return; {1830#(< ~counter~0 99)} is VALID [2022-04-07 14:02:11,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-07 14:02:11,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-07 14:02:11,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-07 14:02:11,839 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-07 14:02:11,839 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-07 14:02:11,840 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-07 14:02:11,840 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-07 14:02:11,840 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1654#true} {1855#(< ~counter~0 98)} #92#return; {1855#(< ~counter~0 98)} is VALID [2022-04-07 14:02:11,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-07 14:02:11,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-07 14:02:11,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-07 14:02:11,841 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-07 14:02:11,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1654#true} {1855#(< ~counter~0 98)} #90#return; {1855#(< ~counter~0 98)} is VALID [2022-04-07 14:02:11,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {1654#true} assume true; {1654#true} is VALID [2022-04-07 14:02:11,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1654#true} assume !(0 == ~cond); {1654#true} is VALID [2022-04-07 14:02:11,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {1654#true} ~cond := #in~cond; {1654#true} is VALID [2022-04-07 14:02:11,842 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-07 14:02:11,842 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-07 14:02:11,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {1855#(< ~counter~0 98)} call #t~ret9 := main(); {1855#(< ~counter~0 98)} is VALID [2022-04-07 14:02:11,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1855#(< ~counter~0 98)} {1654#true} #102#return; {1855#(< ~counter~0 98)} is VALID [2022-04-07 14:02:11,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {1855#(< ~counter~0 98)} assume true; {1855#(< ~counter~0 98)} is VALID [2022-04-07 14:02:11,843 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-07 14:02:11,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {1654#true} call ULTIMATE.init(); {1654#true} is VALID [2022-04-07 14:02:11,849 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-07 14:02:11,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:11,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874581422] [2022-04-07 14:02:11,849 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:11,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677778546] [2022-04-07 14:02:11,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677778546] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 14:02:11,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 14:02:11,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-07 14:02:11,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987733490] [2022-04-07 14:02:11,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:11,850 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-07 14:02:11,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:11,850 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-07 14:02:11,875 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-07 14:02:11,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 14:02:11,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:11,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 14:02:11,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:11,876 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-07 14:02:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:11,996 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2022-04-07 14:02:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 14:02:11,997 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-07 14:02:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:11,997 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-07 14:02:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-07 14:02:11,998 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-07 14:02:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-07 14:02:11,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-07 14:02:12,053 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-07 14:02:12,054 INFO L225 Difference]: With dead ends: 74 [2022-04-07 14:02:12,055 INFO L226 Difference]: Without dead ends: 53 [2022-04-07 14:02:12,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:12,055 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:12,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 14:02:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-07 14:02:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-07 14:02:12,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:12,075 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-07 14:02:12,075 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-07 14:02:12,075 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-07 14:02:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:12,076 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-07 14:02:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-07 14:02:12,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:12,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:12,077 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-07 14:02:12,077 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-07 14:02:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:12,078 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-07 14:02:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-07 14:02:12,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:12,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:12,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:12,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:12,081 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-07 14:02:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-04-07 14:02:12,082 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 41 [2022-04-07 14:02:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:12,083 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-04-07 14:02:12,084 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 14:02:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-04-07 14:02:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 14:02:12,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:12,084 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:12,105 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-07 14:02:12,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:12,300 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-07 14:02:12,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:12,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763453892] [2022-04-07 14:02:12,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:12,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:12,313 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:12,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891784598] [2022-04-07 14:02:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:12,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:12,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:12,323 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-07 14:02:12,324 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-07 14:02:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:12,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 14:02:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:12,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:12,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2022-04-07 14:02:12,523 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-07 14:02:12,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2200#(<= ~counter~0 0)} {2192#true} #102#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {2200#(<= ~counter~0 0)} call #t~ret9 := main(); {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,528 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-07 14:02:12,529 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-07 14:02:12,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {2200#(<= ~counter~0 0)} ~cond := #in~cond; {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {2200#(<= ~counter~0 0)} assume !(0 == ~cond); {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2200#(<= ~counter~0 0)} {2200#(<= ~counter~0 0)} #90#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,532 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-07 14:02:12,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {2200#(<= ~counter~0 0)} ~cond := #in~cond; {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {2200#(<= ~counter~0 0)} assume !(0 == ~cond); {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {2200#(<= ~counter~0 0)} assume true; {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,535 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2200#(<= ~counter~0 0)} {2200#(<= ~counter~0 0)} #92#return; {2200#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:12,535 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-07 14:02:12,536 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-07 14:02:12,536 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-07 14:02:12,536 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-07 14:02:12,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {2249#(<= ~counter~0 1)} ~cond := #in~cond; {2249#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:12,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {2249#(<= ~counter~0 1)} assume !(0 == ~cond); {2249#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:12,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {2249#(<= ~counter~0 1)} assume true; {2249#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:12,538 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2249#(<= ~counter~0 1)} {2249#(<= ~counter~0 1)} #94#return; {2249#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:12,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {2249#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2249#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:12,538 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-07 14:02:12,539 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-07 14:02:12,539 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-07 14:02:12,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {2274#(<= ~counter~0 2)} ~cond := #in~cond; {2274#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:12,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {2274#(<= ~counter~0 2)} assume !(0 == ~cond); {2274#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:12,540 INFO L290 TraceCheckUtils]: 30: Hoare triple {2274#(<= ~counter~0 2)} assume true; {2274#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:12,541 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2274#(<= ~counter~0 2)} {2274#(<= ~counter~0 2)} #96#return; {2274#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:12,541 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-07 14:02:12,541 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-07 14:02:12,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {2299#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {2193#false} is VALID [2022-04-07 14:02:12,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {2193#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2193#false} is VALID [2022-04-07 14:02:12,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#false} assume !(#t~post8 < 100);havoc #t~post8; {2193#false} is VALID [2022-04-07 14:02:12,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {2193#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2193#false} is VALID [2022-04-07 14:02:12,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#false} assume !(#t~post6 < 100);havoc #t~post6; {2193#false} is VALID [2022-04-07 14:02:12,543 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-07 14:02:12,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#false} ~cond := #in~cond; {2193#false} is VALID [2022-04-07 14:02:12,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#false} assume 0 == ~cond; {2193#false} is VALID [2022-04-07 14:02:12,543 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2022-04-07 14:02:12,544 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-07 14:02:12,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:12,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2022-04-07 14:02:12,746 INFO L290 TraceCheckUtils]: 41: Hoare triple {2193#false} assume 0 == ~cond; {2193#false} is VALID [2022-04-07 14:02:12,746 INFO L290 TraceCheckUtils]: 40: Hoare triple {2193#false} ~cond := #in~cond; {2193#false} is VALID [2022-04-07 14:02:12,746 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-07 14:02:12,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {2193#false} assume !(#t~post6 < 100);havoc #t~post6; {2193#false} is VALID [2022-04-07 14:02:12,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {2193#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2193#false} is VALID [2022-04-07 14:02:12,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {2193#false} assume !(#t~post8 < 100);havoc #t~post8; {2193#false} is VALID [2022-04-07 14:02:12,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {2193#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2193#false} is VALID [2022-04-07 14:02:12,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {2351#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {2193#false} is VALID [2022-04-07 14:02:12,747 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-07 14:02:12,747 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-07 14:02:12,748 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2192#true} {2355#(< ~counter~0 100)} #96#return; {2355#(< ~counter~0 100)} is VALID [2022-04-07 14:02:12,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-07 14:02:12,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-07 14:02:12,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-07 14:02:12,748 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-07 14:02:12,749 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-07 14:02:12,749 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-07 14:02:12,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {2380#(< ~counter~0 99)} assume !!(0 != ~r~0); {2380#(< ~counter~0 99)} is VALID [2022-04-07 14:02:12,750 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2192#true} {2380#(< ~counter~0 99)} #94#return; {2380#(< ~counter~0 99)} is VALID [2022-04-07 14:02:12,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-07 14:02:12,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-07 14:02:12,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-07 14:02:12,750 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-07 14:02:12,751 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-07 14:02:12,751 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-07 14:02:12,752 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-07 14:02:12,752 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2192#true} {2405#(< ~counter~0 98)} #92#return; {2405#(< ~counter~0 98)} is VALID [2022-04-07 14:02:12,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-07 14:02:12,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-07 14:02:12,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-07 14:02:12,752 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-07 14:02:12,753 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2192#true} {2405#(< ~counter~0 98)} #90#return; {2405#(< ~counter~0 98)} is VALID [2022-04-07 14:02:12,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {2192#true} assume true; {2192#true} is VALID [2022-04-07 14:02:12,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {2192#true} assume !(0 == ~cond); {2192#true} is VALID [2022-04-07 14:02:12,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {2192#true} ~cond := #in~cond; {2192#true} is VALID [2022-04-07 14:02:12,753 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-07 14:02:12,753 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-07 14:02:12,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {2405#(< ~counter~0 98)} call #t~ret9 := main(); {2405#(< ~counter~0 98)} is VALID [2022-04-07 14:02:12,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2405#(< ~counter~0 98)} {2192#true} #102#return; {2405#(< ~counter~0 98)} is VALID [2022-04-07 14:02:12,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {2405#(< ~counter~0 98)} assume true; {2405#(< ~counter~0 98)} is VALID [2022-04-07 14:02:12,755 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-07 14:02:12,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2022-04-07 14:02:12,755 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-07 14:02:12,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:12,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763453892] [2022-04-07 14:02:12,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:12,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891784598] [2022-04-07 14:02:12,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891784598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:12,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:12,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-07 14:02:12,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102008179] [2022-04-07 14:02:12,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:12,756 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-07 14:02:12,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:12,756 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-07 14:02:12,806 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-07 14:02:12,806 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:02:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:12,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:02:12,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:12,807 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-07 14:02:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:13,205 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-04-07 14:02:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 14:02:13,205 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-07 14:02:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:13,206 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-07 14:02:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-07 14:02:13,208 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-07 14:02:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2022-04-07 14:02:13,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2022-04-07 14:02:13,319 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-07 14:02:13,320 INFO L225 Difference]: With dead ends: 129 [2022-04-07 14:02:13,320 INFO L226 Difference]: Without dead ends: 108 [2022-04-07 14:02:13,321 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-07 14:02:13,321 INFO L913 BasicCegarLoop]: 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-07 14:02:13,321 INFO L914 BasicCegarLoop]: 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-07 14:02:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-07 14:02:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2022-04-07 14:02:13,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:13,360 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-07 14:02:13,361 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-07 14:02:13,361 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-07 14:02:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:13,365 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-07 14:02:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-04-07 14:02:13,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:13,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:13,366 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-07 14:02:13,367 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-07 14:02:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:13,370 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-07 14:02:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2022-04-07 14:02:13,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:13,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:13,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:13,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:13,371 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-07 14:02:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2022-04-07 14:02:13,373 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 43 [2022-04-07 14:02:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:13,373 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2022-04-07 14:02:13,373 INFO L479 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-07 14:02:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2022-04-07 14:02:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-07 14:02:13,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:13,374 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:13,392 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-07 14:02:13,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:13,587 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:13,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-07 14:02:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:13,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192790437] [2022-04-07 14:02:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:13,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:13,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:13,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442723356] [2022-04-07 14:02:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:13,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:13,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:13,599 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-07 14:02:13,600 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-07 14:02:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:13,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 14:02:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:13,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:13,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {2996#true} call ULTIMATE.init(); {2996#true} is VALID [2022-04-07 14:02:13,798 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-07 14:02:13,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-07 14:02:13,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2996#true} {2996#true} #102#return; {2996#true} is VALID [2022-04-07 14:02:13,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {2996#true} call #t~ret9 := main(); {2996#true} is VALID [2022-04-07 14:02:13,798 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-07 14:02:13,798 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-07 14:02:13,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-07 14:02:13,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-07 14:02:13,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-07 14:02:13,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2996#true} {2996#true} #90#return; {2996#true} is VALID [2022-04-07 14:02:13,798 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-07 14:02:13,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-07 14:02:13,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-07 14:02:13,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-07 14:02:13,799 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2996#true} {2996#true} #92#return; {2996#true} is VALID [2022-04-07 14:02:13,799 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-07 14:02:13,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {2996#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2996#true} is VALID [2022-04-07 14:02:13,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {2996#true} assume !!(#t~post6 < 100);havoc #t~post6; {2996#true} is VALID [2022-04-07 14:02:13,799 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-07 14:02:13,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-07 14:02:13,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-07 14:02:13,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-07 14:02:13,799 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2996#true} {2996#true} #94#return; {2996#true} is VALID [2022-04-07 14:02:13,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {2996#true} assume !!(0 != ~r~0); {3073#(not (= main_~r~0 0))} is VALID [2022-04-07 14:02:13,803 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-07 14:02:13,804 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-07 14:02:13,804 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-07 14:02:13,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-07 14:02:13,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-07 14:02:13,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-07 14:02:13,804 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-07 14:02:13,805 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-07 14:02:13,805 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-07 14:02:13,805 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-07 14:02:13,805 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-07 14:02:13,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {2996#true} ~cond := #in~cond; {2996#true} is VALID [2022-04-07 14:02:13,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {2996#true} assume !(0 == ~cond); {2996#true} is VALID [2022-04-07 14:02:13,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {2996#true} assume true; {2996#true} is VALID [2022-04-07 14:02:13,810 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-07 14:02:13,810 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-07 14:02:13,810 INFO L290 TraceCheckUtils]: 41: Hoare triple {2997#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2997#false} is VALID [2022-04-07 14:02:13,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {2997#false} assume !(#t~post6 < 100);havoc #t~post6; {2997#false} is VALID [2022-04-07 14:02:13,810 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-07 14:02:13,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {2997#false} ~cond := #in~cond; {2997#false} is VALID [2022-04-07 14:02:13,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {2997#false} assume 0 == ~cond; {2997#false} is VALID [2022-04-07 14:02:13,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {2997#false} assume !false; {2997#false} is VALID [2022-04-07 14:02:13,811 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-07 14:02:13,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:13,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192790437] [2022-04-07 14:02:13,811 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442723356] [2022-04-07 14:02:13,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442723356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:13,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:13,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:02:13,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088688841] [2022-04-07 14:02:13,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:13,812 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-07 14:02:13,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:13,812 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-07 14:02:13,837 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-07 14:02:13,837 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:02:13,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:13,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:02:13,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:13,837 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-07 14:02:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:13,960 INFO L93 Difference]: Finished difference Result 158 states and 202 transitions. [2022-04-07 14:02:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 14:02:13,960 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-07 14:02:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:13,961 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-07 14:02:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-07 14:02:13,962 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-07 14:02:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-07 14:02:13,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-07 14:02:14,033 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-07 14:02:14,035 INFO L225 Difference]: With dead ends: 158 [2022-04-07 14:02:14,035 INFO L226 Difference]: Without dead ends: 119 [2022-04-07 14:02:14,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:14,036 INFO L913 BasicCegarLoop]: 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-07 14:02:14,036 INFO L914 BasicCegarLoop]: 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-07 14:02:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-07 14:02:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2022-04-07 14:02:14,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:14,080 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-07 14:02:14,080 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-07 14:02:14,081 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-07 14:02:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:14,083 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2022-04-07 14:02:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-07 14:02:14,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:14,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:14,084 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-07 14:02:14,084 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-07 14:02:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:14,087 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2022-04-07 14:02:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2022-04-07 14:02:14,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:14,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:14,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:14,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:14,087 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-07 14:02:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 137 transitions. [2022-04-07 14:02:14,089 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 137 transitions. Word has length 47 [2022-04-07 14:02:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:14,090 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 137 transitions. [2022-04-07 14:02:14,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 14:02:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2022-04-07 14:02:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-07 14:02:14,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:14,090 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:14,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 14:02:14,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-07 14:02:14,291 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-07 14:02:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:14,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477561901] [2022-04-07 14:02:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:14,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:14,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380871758] [2022-04-07 14:02:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:14,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:14,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:14,301 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-07 14:02:14,301 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-07 14:02:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:14,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 14:02:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:14,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:14,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {3753#true} call ULTIMATE.init(); {3753#true} is VALID [2022-04-07 14:02:14,575 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-07 14:02:14,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3761#(<= ~counter~0 0)} {3753#true} #102#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {3761#(<= ~counter~0 0)} call #t~ret9 := main(); {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,577 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-07 14:02:14,577 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-07 14:02:14,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {3761#(<= ~counter~0 0)} ~cond := #in~cond; {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {3761#(<= ~counter~0 0)} assume !(0 == ~cond); {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,579 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3761#(<= ~counter~0 0)} {3761#(<= ~counter~0 0)} #90#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,579 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-07 14:02:14,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {3761#(<= ~counter~0 0)} ~cond := #in~cond; {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {3761#(<= ~counter~0 0)} assume !(0 == ~cond); {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {3761#(<= ~counter~0 0)} assume true; {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,581 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3761#(<= ~counter~0 0)} {3761#(<= ~counter~0 0)} #92#return; {3761#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:14,581 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-07 14:02:14,581 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-07 14:02:14,582 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-07 14:02:14,582 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-07 14:02:14,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {3810#(<= ~counter~0 1)} ~cond := #in~cond; {3810#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:14,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {3810#(<= ~counter~0 1)} assume !(0 == ~cond); {3810#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:14,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {3810#(<= ~counter~0 1)} assume true; {3810#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:14,584 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3810#(<= ~counter~0 1)} {3810#(<= ~counter~0 1)} #94#return; {3810#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:14,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {3810#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3810#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:14,585 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-07 14:02:14,585 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-07 14:02:14,585 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-07 14:02:14,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {3835#(<= ~counter~0 2)} ~cond := #in~cond; {3835#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:14,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {3835#(<= ~counter~0 2)} assume !(0 == ~cond); {3835#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:14,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {3835#(<= ~counter~0 2)} assume true; {3835#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:14,587 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3835#(<= ~counter~0 2)} {3835#(<= ~counter~0 2)} #96#return; {3835#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:14,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {3835#(<= ~counter~0 2)} assume !(~r~0 > 0); {3835#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:14,588 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-07 14:02:14,588 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-07 14:02:14,589 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-07 14:02:14,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {3860#(<= ~counter~0 3)} ~cond := #in~cond; {3860#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:14,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {3860#(<= ~counter~0 3)} assume !(0 == ~cond); {3860#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:14,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {3860#(<= ~counter~0 3)} assume true; {3860#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:14,590 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3860#(<= ~counter~0 3)} {3860#(<= ~counter~0 3)} #98#return; {3860#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:14,590 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-07 14:02:14,591 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-07 14:02:14,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {3885#(<= |main_#t~post8| 3)} assume !(#t~post8 < 100);havoc #t~post8; {3754#false} is VALID [2022-04-07 14:02:14,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {3754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3754#false} is VALID [2022-04-07 14:02:14,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#false} assume !(#t~post6 < 100);havoc #t~post6; {3754#false} is VALID [2022-04-07 14:02:14,591 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-07 14:02:14,591 INFO L290 TraceCheckUtils]: 46: Hoare triple {3754#false} ~cond := #in~cond; {3754#false} is VALID [2022-04-07 14:02:14,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {3754#false} assume 0 == ~cond; {3754#false} is VALID [2022-04-07 14:02:14,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {3754#false} assume !false; {3754#false} is VALID [2022-04-07 14:02:14,592 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-07 14:02:14,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:14,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {3754#false} assume !false; {3754#false} is VALID [2022-04-07 14:02:14,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {3754#false} assume 0 == ~cond; {3754#false} is VALID [2022-04-07 14:02:14,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {3754#false} ~cond := #in~cond; {3754#false} is VALID [2022-04-07 14:02:14,828 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-07 14:02:14,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {3754#false} assume !(#t~post6 < 100);havoc #t~post6; {3754#false} is VALID [2022-04-07 14:02:14,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {3754#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3754#false} is VALID [2022-04-07 14:02:14,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {3925#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {3754#false} is VALID [2022-04-07 14:02:14,828 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-07 14:02:14,829 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-07 14:02:14,829 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3753#true} {3929#(< ~counter~0 100)} #98#return; {3929#(< ~counter~0 100)} is VALID [2022-04-07 14:02:14,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-07 14:02:14,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-07 14:02:14,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-07 14:02:14,829 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-07 14:02:14,830 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-07 14:02:14,830 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-07 14:02:14,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {3954#(< ~counter~0 99)} assume !(~r~0 > 0); {3954#(< ~counter~0 99)} is VALID [2022-04-07 14:02:14,831 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3753#true} {3954#(< ~counter~0 99)} #96#return; {3954#(< ~counter~0 99)} is VALID [2022-04-07 14:02:14,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-07 14:02:14,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-07 14:02:14,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-07 14:02:14,831 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-07 14:02:14,831 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-07 14:02:14,832 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-07 14:02:14,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {3979#(< ~counter~0 98)} assume !!(0 != ~r~0); {3979#(< ~counter~0 98)} is VALID [2022-04-07 14:02:14,832 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3753#true} {3979#(< ~counter~0 98)} #94#return; {3979#(< ~counter~0 98)} is VALID [2022-04-07 14:02:14,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-07 14:02:14,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-07 14:02:14,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-07 14:02:14,833 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-07 14:02:14,833 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-07 14:02:14,833 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-07 14:02:14,833 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-07 14:02:14,834 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3753#true} {4004#(< ~counter~0 97)} #92#return; {4004#(< ~counter~0 97)} is VALID [2022-04-07 14:02:14,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-07 14:02:14,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-07 14:02:14,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-07 14:02:14,834 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-07 14:02:14,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3753#true} {4004#(< ~counter~0 97)} #90#return; {4004#(< ~counter~0 97)} is VALID [2022-04-07 14:02:14,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {3753#true} assume true; {3753#true} is VALID [2022-04-07 14:02:14,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {3753#true} assume !(0 == ~cond); {3753#true} is VALID [2022-04-07 14:02:14,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#true} ~cond := #in~cond; {3753#true} is VALID [2022-04-07 14:02:14,835 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-07 14:02:14,835 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-07 14:02:14,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {4004#(< ~counter~0 97)} call #t~ret9 := main(); {4004#(< ~counter~0 97)} is VALID [2022-04-07 14:02:14,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4004#(< ~counter~0 97)} {3753#true} #102#return; {4004#(< ~counter~0 97)} is VALID [2022-04-07 14:02:14,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {4004#(< ~counter~0 97)} assume true; {4004#(< ~counter~0 97)} is VALID [2022-04-07 14:02:14,836 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-07 14:02:14,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {3753#true} call ULTIMATE.init(); {3753#true} is VALID [2022-04-07 14:02:14,836 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-07 14:02:14,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:14,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477561901] [2022-04-07 14:02:14,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:14,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380871758] [2022-04-07 14:02:14,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380871758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:14,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:14,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-07 14:02:14,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740060754] [2022-04-07 14:02:14,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:14,838 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-07 14:02:14,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:14,838 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-07 14:02:14,899 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-07 14:02:14,899 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 14:02:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 14:02:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-07 14:02:14,900 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-07 14:02:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:15,420 INFO L93 Difference]: Finished difference Result 219 states and 283 transitions. [2022-04-07 14:02:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-07 14:02:15,420 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-07 14:02:15,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:15,421 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-07 14:02:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-07 14:02:15,423 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-07 14:02:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-04-07 14:02:15,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 194 transitions. [2022-04-07 14:02:15,554 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-07 14:02:15,557 INFO L225 Difference]: With dead ends: 219 [2022-04-07 14:02:15,557 INFO L226 Difference]: Without dead ends: 172 [2022-04-07 14:02:15,557 INFO L912 BasicCegarLoop]: 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-07 14:02:15,558 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 180 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:15,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 200 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 14:02:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-07 14:02:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 153. [2022-04-07 14:02:15,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:15,609 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-07 14:02:15,609 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-07 14:02:15,609 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-07 14:02:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:15,632 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-07 14:02:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-07 14:02:15,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:15,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:15,633 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-07 14:02:15,634 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-07 14:02:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:15,636 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-07 14:02:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 213 transitions. [2022-04-07 14:02:15,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:15,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:15,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:15,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:15,637 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-07 14:02:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2022-04-07 14:02:15,640 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 49 [2022-04-07 14:02:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:15,640 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2022-04-07 14:02:15,640 INFO L479 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-07 14:02:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2022-04-07 14:02:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 14:02:15,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:15,641 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:15,658 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-07 14:02:15,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:15,847 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-07 14:02:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:15,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808447539] [2022-04-07 14:02:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:15,857 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:15,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1840808561] [2022-04-07 14:02:15,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:15,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:15,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:15,858 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-07 14:02:15,859 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-07 14:02:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:15,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:02:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:15,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:16,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {4930#true} call ULTIMATE.init(); {4930#true} is VALID [2022-04-07 14:02:16,164 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-07 14:02:16,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4938#(<= ~counter~0 0)} {4930#true} #102#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {4938#(<= ~counter~0 0)} call #t~ret9 := main(); {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,165 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-07 14:02:16,165 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-07 14:02:16,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {4938#(<= ~counter~0 0)} ~cond := #in~cond; {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {4938#(<= ~counter~0 0)} assume !(0 == ~cond); {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4938#(<= ~counter~0 0)} {4938#(<= ~counter~0 0)} #90#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,167 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-07 14:02:16,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {4938#(<= ~counter~0 0)} ~cond := #in~cond; {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {4938#(<= ~counter~0 0)} assume !(0 == ~cond); {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {4938#(<= ~counter~0 0)} assume true; {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,168 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4938#(<= ~counter~0 0)} {4938#(<= ~counter~0 0)} #92#return; {4938#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:16,168 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-07 14:02:16,168 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-07 14:02:16,169 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-07 14:02:16,169 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-07 14:02:16,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {4987#(<= ~counter~0 1)} ~cond := #in~cond; {4987#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:16,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {4987#(<= ~counter~0 1)} assume !(0 == ~cond); {4987#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:16,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {4987#(<= ~counter~0 1)} assume true; {4987#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:16,170 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4987#(<= ~counter~0 1)} {4987#(<= ~counter~0 1)} #94#return; {4987#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:16,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {4987#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4987#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:16,171 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-07 14:02:16,171 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-07 14:02:16,172 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-07 14:02:16,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {5012#(<= ~counter~0 2)} ~cond := #in~cond; {5012#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:16,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {5012#(<= ~counter~0 2)} assume !(0 == ~cond); {5012#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:16,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {5012#(<= ~counter~0 2)} assume true; {5012#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:16,173 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5012#(<= ~counter~0 2)} {5012#(<= ~counter~0 2)} #96#return; {5012#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:16,173 INFO L290 TraceCheckUtils]: 32: Hoare triple {5012#(<= ~counter~0 2)} assume !(~r~0 > 0); {5012#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:16,173 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-07 14:02:16,174 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-07 14:02:16,174 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-07 14:02:16,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {5037#(<= ~counter~0 3)} ~cond := #in~cond; {5037#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:16,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {5037#(<= ~counter~0 3)} assume !(0 == ~cond); {5037#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:16,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {5037#(<= ~counter~0 3)} assume true; {5037#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:16,175 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5037#(<= ~counter~0 3)} {5037#(<= ~counter~0 3)} #98#return; {5037#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:16,176 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-07 14:02:16,176 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-07 14:02:16,176 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-07 14:02:16,177 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-07 14:02:16,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {5062#(<= ~counter~0 4)} ~cond := #in~cond; {5062#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:16,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {5062#(<= ~counter~0 4)} assume !(0 == ~cond); {5062#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:16,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {5062#(<= ~counter~0 4)} assume true; {5062#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:16,178 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {5062#(<= ~counter~0 4)} {5062#(<= ~counter~0 4)} #98#return; {5062#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:16,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {5062#(<= ~counter~0 4)} assume !(~r~0 < 0); {5062#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:16,178 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-07 14:02:16,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {5087#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {4931#false} is VALID [2022-04-07 14:02:16,179 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-07 14:02:16,179 INFO L290 TraceCheckUtils]: 52: Hoare triple {4931#false} ~cond := #in~cond; {4931#false} is VALID [2022-04-07 14:02:16,179 INFO L290 TraceCheckUtils]: 53: Hoare triple {4931#false} assume 0 == ~cond; {4931#false} is VALID [2022-04-07 14:02:16,179 INFO L290 TraceCheckUtils]: 54: Hoare triple {4931#false} assume !false; {4931#false} is VALID [2022-04-07 14:02:16,179 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-07 14:02:16,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:16,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {4931#false} assume !false; {4931#false} is VALID [2022-04-07 14:02:16,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {4931#false} assume 0 == ~cond; {4931#false} is VALID [2022-04-07 14:02:16,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {4931#false} ~cond := #in~cond; {4931#false} is VALID [2022-04-07 14:02:16,447 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-07 14:02:16,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {5115#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {4931#false} is VALID [2022-04-07 14:02:16,447 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-07 14:02:16,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {5119#(< ~counter~0 100)} assume !(~r~0 < 0); {5119#(< ~counter~0 100)} is VALID [2022-04-07 14:02:16,448 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {4930#true} {5119#(< ~counter~0 100)} #98#return; {5119#(< ~counter~0 100)} is VALID [2022-04-07 14:02:16,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-07 14:02:16,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-07 14:02:16,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-07 14:02:16,448 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-07 14:02:16,460 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-07 14:02:16,460 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-07 14:02:16,461 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-07 14:02:16,461 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4930#true} {5144#(< ~counter~0 99)} #98#return; {5144#(< ~counter~0 99)} is VALID [2022-04-07 14:02:16,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-07 14:02:16,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-07 14:02:16,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-07 14:02:16,461 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-07 14:02:16,462 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-07 14:02:16,463 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-07 14:02:16,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {5169#(< ~counter~0 98)} assume !(~r~0 > 0); {5169#(< ~counter~0 98)} is VALID [2022-04-07 14:02:16,464 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4930#true} {5169#(< ~counter~0 98)} #96#return; {5169#(< ~counter~0 98)} is VALID [2022-04-07 14:02:16,464 INFO L290 TraceCheckUtils]: 30: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-07 14:02:16,464 INFO L290 TraceCheckUtils]: 29: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-07 14:02:16,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-07 14:02:16,464 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-07 14:02:16,464 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-07 14:02:16,465 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-07 14:02:16,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {5194#(< ~counter~0 97)} assume !!(0 != ~r~0); {5194#(< ~counter~0 97)} is VALID [2022-04-07 14:02:16,465 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4930#true} {5194#(< ~counter~0 97)} #94#return; {5194#(< ~counter~0 97)} is VALID [2022-04-07 14:02:16,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-07 14:02:16,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-07 14:02:16,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-07 14:02:16,466 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-07 14:02:16,466 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-07 14:02:16,466 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-07 14:02:16,466 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-07 14:02:16,467 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4930#true} {5219#(< ~counter~0 96)} #92#return; {5219#(< ~counter~0 96)} is VALID [2022-04-07 14:02:16,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-07 14:02:16,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-07 14:02:16,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-07 14:02:16,467 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-07 14:02:16,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4930#true} {5219#(< ~counter~0 96)} #90#return; {5219#(< ~counter~0 96)} is VALID [2022-04-07 14:02:16,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {4930#true} assume true; {4930#true} is VALID [2022-04-07 14:02:16,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {4930#true} assume !(0 == ~cond); {4930#true} is VALID [2022-04-07 14:02:16,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {4930#true} ~cond := #in~cond; {4930#true} is VALID [2022-04-07 14:02:16,468 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-07 14:02:16,468 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-07 14:02:16,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#(< ~counter~0 96)} call #t~ret9 := main(); {5219#(< ~counter~0 96)} is VALID [2022-04-07 14:02:16,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#(< ~counter~0 96)} {4930#true} #102#return; {5219#(< ~counter~0 96)} is VALID [2022-04-07 14:02:16,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#(< ~counter~0 96)} assume true; {5219#(< ~counter~0 96)} is VALID [2022-04-07 14:02:16,469 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-07 14:02:16,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {4930#true} call ULTIMATE.init(); {4930#true} is VALID [2022-04-07 14:02:16,470 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-07 14:02:16,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:16,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808447539] [2022-04-07 14:02:16,470 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:16,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840808561] [2022-04-07 14:02:16,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840808561] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:16,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:16,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 14:02:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72979255] [2022-04-07 14:02:16,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:16,471 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-07 14:02:16,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:16,471 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-07 14:02:16,530 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-07 14:02:16,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 14:02:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:16,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 14:02:16,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 14:02:16,531 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-07 14:02:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:17,200 INFO L93 Difference]: Finished difference Result 211 states and 278 transitions. [2022-04-07 14:02:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-07 14:02:17,200 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-07 14:02:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:17,200 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-07 14:02:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-07 14:02:17,202 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-07 14:02:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 204 transitions. [2022-04-07 14:02:17,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 204 transitions. [2022-04-07 14:02:17,337 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-07 14:02:17,340 INFO L225 Difference]: With dead ends: 211 [2022-04-07 14:02:17,340 INFO L226 Difference]: Without dead ends: 206 [2022-04-07 14:02:17,340 INFO L912 BasicCegarLoop]: 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-07 14:02:17,340 INFO L913 BasicCegarLoop]: 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-07 14:02:17,341 INFO L914 BasicCegarLoop]: 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-07 14:02:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-07 14:02:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 198. [2022-04-07 14:02:17,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:17,424 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-07 14:02:17,425 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-07 14:02:17,425 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-07 14:02:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:17,432 INFO L93 Difference]: Finished difference Result 206 states and 267 transitions. [2022-04-07 14:02:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2022-04-07 14:02:17,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:17,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:17,434 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-07 14:02:17,434 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-07 14:02:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:17,439 INFO L93 Difference]: Finished difference Result 206 states and 267 transitions. [2022-04-07 14:02:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2022-04-07 14:02:17,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:17,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:17,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:17,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:17,440 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-07 14:02:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 257 transitions. [2022-04-07 14:02:17,443 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 257 transitions. Word has length 55 [2022-04-07 14:02:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:17,443 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 257 transitions. [2022-04-07 14:02:17,443 INFO L479 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-07 14:02:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 257 transitions. [2022-04-07 14:02:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-07 14:02:17,444 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:17,444 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:17,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-07 14:02:17,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 14:02:17,645 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:17,645 INFO L85 PathProgramCache]: Analyzing trace with hash -304792209, now seen corresponding path program 1 times [2022-04-07 14:02:17,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:17,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613949368] [2022-04-07 14:02:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:17,657 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:17,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140287605] [2022-04-07 14:02:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:17,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:17,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:17,668 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-07 14:02:17,669 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-07 14:02:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:17,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 14:02:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:17,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:17,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-07 14:02:17,946 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-07 14:02:17,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6268#true} {6268#true} #102#return; {6268#true} is VALID [2022-04-07 14:02:17,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {6268#true} call #t~ret9 := main(); {6268#true} is VALID [2022-04-07 14:02:17,946 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-07 14:02:17,947 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-07 14:02:17,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:17,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:17,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6268#true} {6268#true} #90#return; {6268#true} is VALID [2022-04-07 14:02:17,947 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-07 14:02:17,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:17,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:17,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,947 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6268#true} {6268#true} #92#return; {6268#true} is VALID [2022-04-07 14:02:17,947 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-07 14:02:17,948 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-07 14:02:17,948 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-07 14:02:17,948 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-07 14:02:17,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:17,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:17,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,949 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,949 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-07 14:02:17,949 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-07 14:02:17,949 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-07 14:02:17,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:17,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:17,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,950 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 > 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,951 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-07 14:02:17,951 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-07 14:02:17,951 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-07 14:02:17,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:17,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:17,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,952 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,952 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-07 14:02:17,952 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-07 14:02:17,952 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-07 14:02:17,952 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-07 14:02:17,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:17,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:17,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,953 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 < 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,957 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-07 14:02:17,958 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-07 14:02:17,958 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-07 14:02:17,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:17,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:17,958 INFO L290 TraceCheckUtils]: 54: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,958 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,959 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-07 14:02:17,959 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-07 14:02:17,959 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-07 14:02:17,959 INFO L290 TraceCheckUtils]: 60: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:17,959 INFO L290 TraceCheckUtils]: 61: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:17,959 INFO L290 TraceCheckUtils]: 62: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,960 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:17,960 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-07 14:02:17,960 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-07 14:02:17,961 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-07 14:02:17,961 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-07 14:02:17,961 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-07 14:02:17,961 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-07 14:02:17,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:17,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:17,961 INFO L290 TraceCheckUtils]: 72: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:17,962 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-07 14:02:17,962 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-07 14:02:17,962 INFO L290 TraceCheckUtils]: 75: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-07 14:02:17,965 INFO L290 TraceCheckUtils]: 76: Hoare triple {6269#false} assume !!(#t~post8 < 100);havoc #t~post8; {6269#false} is VALID [2022-04-07 14:02:17,965 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-07 14:02:17,965 INFO L290 TraceCheckUtils]: 78: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-07 14:02:17,965 INFO L290 TraceCheckUtils]: 79: Hoare triple {6269#false} assume !(0 == ~cond); {6269#false} is VALID [2022-04-07 14:02:17,965 INFO L290 TraceCheckUtils]: 80: Hoare triple {6269#false} assume true; {6269#false} is VALID [2022-04-07 14:02:17,965 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6269#false} {6269#false} #98#return; {6269#false} is VALID [2022-04-07 14:02:17,965 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-07 14:02:17,965 INFO L290 TraceCheckUtils]: 83: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-07 14:02:17,965 INFO L290 TraceCheckUtils]: 84: Hoare triple {6269#false} assume !(#t~post8 < 100);havoc #t~post8; {6269#false} is VALID [2022-04-07 14:02:17,965 INFO L290 TraceCheckUtils]: 85: Hoare triple {6269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6269#false} is VALID [2022-04-07 14:02:17,965 INFO L290 TraceCheckUtils]: 86: Hoare triple {6269#false} assume !(#t~post6 < 100);havoc #t~post6; {6269#false} is VALID [2022-04-07 14:02:17,965 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-07 14:02:17,965 INFO L290 TraceCheckUtils]: 88: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-07 14:02:17,965 INFO L290 TraceCheckUtils]: 89: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-07 14:02:17,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-07 14:02:17,966 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-07 14:02:17,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:18,215 INFO L290 TraceCheckUtils]: 90: Hoare triple {6269#false} assume !false; {6269#false} is VALID [2022-04-07 14:02:18,215 INFO L290 TraceCheckUtils]: 89: Hoare triple {6269#false} assume 0 == ~cond; {6269#false} is VALID [2022-04-07 14:02:18,215 INFO L290 TraceCheckUtils]: 88: Hoare triple {6269#false} ~cond := #in~cond; {6269#false} is VALID [2022-04-07 14:02:18,215 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-07 14:02:18,215 INFO L290 TraceCheckUtils]: 86: Hoare triple {6269#false} assume !(#t~post6 < 100);havoc #t~post6; {6269#false} is VALID [2022-04-07 14:02:18,215 INFO L290 TraceCheckUtils]: 85: Hoare triple {6269#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6269#false} is VALID [2022-04-07 14:02:18,215 INFO L290 TraceCheckUtils]: 84: Hoare triple {6269#false} assume !(#t~post8 < 100);havoc #t~post8; {6269#false} is VALID [2022-04-07 14:02:18,215 INFO L290 TraceCheckUtils]: 83: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-07 14:02:18,215 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-07 14:02:18,215 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {6268#true} {6269#false} #98#return; {6269#false} is VALID [2022-04-07 14:02:18,215 INFO L290 TraceCheckUtils]: 80: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,216 INFO L290 TraceCheckUtils]: 79: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,216 INFO L290 TraceCheckUtils]: 78: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,216 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-07 14:02:18,216 INFO L290 TraceCheckUtils]: 76: Hoare triple {6269#false} assume !!(#t~post8 < 100);havoc #t~post8; {6269#false} is VALID [2022-04-07 14:02:18,216 INFO L290 TraceCheckUtils]: 75: Hoare triple {6269#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#false} is VALID [2022-04-07 14:02:18,225 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-07 14:02:18,225 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-07 14:02:18,225 INFO L290 TraceCheckUtils]: 72: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,225 INFO L290 TraceCheckUtils]: 71: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,226 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-07 14:02:18,226 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-07 14:02:18,226 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-07 14:02:18,226 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-07 14:02:18,226 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-07 14:02:18,227 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-07 14:02:18,227 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,227 INFO L290 TraceCheckUtils]: 61: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,228 INFO L290 TraceCheckUtils]: 60: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,228 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-07 14:02:18,239 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-07 14:02:18,239 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-07 14:02:18,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,239 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,240 INFO L290 TraceCheckUtils]: 54: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,240 INFO L290 TraceCheckUtils]: 53: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,240 INFO L290 TraceCheckUtils]: 52: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,240 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-07 14:02:18,240 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-07 14:02:18,240 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-07 14:02:18,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 < 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,241 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,241 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-07 14:02:18,241 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-07 14:02:18,242 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-07 14:02:18,242 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-07 14:02:18,242 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #98#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,243 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-07 14:02:18,243 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-07 14:02:18,243 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-07 14:02:18,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {6321#(<= main_~v~0 1)} assume !(~r~0 > 0); {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,244 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #96#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,244 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-07 14:02:18,244 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-07 14:02:18,244 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-07 14:02:18,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {6321#(<= main_~v~0 1)} assume !!(0 != ~r~0); {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,245 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6268#true} {6321#(<= main_~v~0 1)} #94#return; {6321#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:18,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,245 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-07 14:02:18,246 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-07 14:02:18,246 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-07 14:02:18,246 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-07 14:02:18,246 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6268#true} {6268#true} #92#return; {6268#true} is VALID [2022-04-07 14:02:18,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,246 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-07 14:02:18,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6268#true} {6268#true} #90#return; {6268#true} is VALID [2022-04-07 14:02:18,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {6268#true} assume !(0 == ~cond); {6268#true} is VALID [2022-04-07 14:02:18,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#true} ~cond := #in~cond; {6268#true} is VALID [2022-04-07 14:02:18,256 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-07 14:02:18,256 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-07 14:02:18,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {6268#true} call #t~ret9 := main(); {6268#true} is VALID [2022-04-07 14:02:18,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6268#true} {6268#true} #102#return; {6268#true} is VALID [2022-04-07 14:02:18,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {6268#true} assume true; {6268#true} is VALID [2022-04-07 14:02:18,256 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-07 14:02:18,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {6268#true} call ULTIMATE.init(); {6268#true} is VALID [2022-04-07 14:02:18,257 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-07 14:02:18,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:18,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613949368] [2022-04-07 14:02:18,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:18,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140287605] [2022-04-07 14:02:18,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140287605] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:18,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:18,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-07 14:02:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140319685] [2022-04-07 14:02:18,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:18,258 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-07 14:02:18,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:18,258 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-07 14:02:18,300 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-07 14:02:18,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:02:18,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:18,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:02:18,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:18,305 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-07 14:02:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:18,683 INFO L93 Difference]: Finished difference Result 502 states and 697 transitions. [2022-04-07 14:02:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:02:18,683 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-07 14:02:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:18,683 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-07 14:02:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-07 14:02:18,684 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-07 14:02:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-07 14:02:18,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-07 14:02:18,766 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-07 14:02:18,772 INFO L225 Difference]: With dead ends: 502 [2022-04-07 14:02:18,773 INFO L226 Difference]: Without dead ends: 359 [2022-04-07 14:02:18,773 INFO L912 BasicCegarLoop]: 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-07 14:02:18,774 INFO L913 BasicCegarLoop]: 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-07 14:02:18,774 INFO L914 BasicCegarLoop]: 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-07 14:02:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-07 14:02:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 342. [2022-04-07 14:02:18,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:18,934 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-07 14:02:18,934 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-07 14:02:18,934 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-07 14:02:18,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:18,942 INFO L93 Difference]: Finished difference Result 359 states and 490 transitions. [2022-04-07 14:02:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 490 transitions. [2022-04-07 14:02:18,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:18,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:18,943 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-07 14:02:18,943 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-07 14:02:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:18,951 INFO L93 Difference]: Finished difference Result 359 states and 490 transitions. [2022-04-07 14:02:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 490 transitions. [2022-04-07 14:02:18,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:18,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:18,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:18,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:18,952 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-07 14:02:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 469 transitions. [2022-04-07 14:02:18,960 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 469 transitions. Word has length 91 [2022-04-07 14:02:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:18,960 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 469 transitions. [2022-04-07 14:02:18,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (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-07 14:02:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 469 transitions. [2022-04-07 14:02:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-07 14:02:18,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:18,961 INFO L499 BasicCegarLoop]: 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-07 14:02:18,977 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-07 14:02:19,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-07 14:02:19,176 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1103092705, now seen corresponding path program 2 times [2022-04-07 14:02:19,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:19,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774546674] [2022-04-07 14:02:19,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:19,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:19,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:19,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048122970] [2022-04-07 14:02:19,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:02:19,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:19,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:19,191 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-07 14:02:19,192 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-07 14:02:19,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:02:19,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:02:19,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 14:02:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:19,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:19,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {8722#true} call ULTIMATE.init(); {8722#true} is VALID [2022-04-07 14:02:19,661 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-07 14:02:19,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#(<= ~counter~0 0)} {8722#true} #102#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {8730#(<= ~counter~0 0)} call #t~ret9 := main(); {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,662 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-07 14:02:19,662 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-07 14:02:19,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {8730#(<= ~counter~0 0)} ~cond := #in~cond; {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {8730#(<= ~counter~0 0)} assume !(0 == ~cond); {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8730#(<= ~counter~0 0)} {8730#(<= ~counter~0 0)} #90#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,664 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-07 14:02:19,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {8730#(<= ~counter~0 0)} ~cond := #in~cond; {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {8730#(<= ~counter~0 0)} assume !(0 == ~cond); {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {8730#(<= ~counter~0 0)} assume true; {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,665 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8730#(<= ~counter~0 0)} {8730#(<= ~counter~0 0)} #92#return; {8730#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:19,665 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-07 14:02:19,666 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-07 14:02:19,666 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-07 14:02:19,666 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-07 14:02:19,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {8779#(<= ~counter~0 1)} ~cond := #in~cond; {8779#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:19,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {8779#(<= ~counter~0 1)} assume !(0 == ~cond); {8779#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:19,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {8779#(<= ~counter~0 1)} assume true; {8779#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:19,668 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8779#(<= ~counter~0 1)} {8779#(<= ~counter~0 1)} #94#return; {8779#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:19,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {8779#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8779#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:19,668 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-07 14:02:19,669 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-07 14:02:19,669 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-07 14:02:19,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {8804#(<= ~counter~0 2)} ~cond := #in~cond; {8804#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:19,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {8804#(<= ~counter~0 2)} assume !(0 == ~cond); {8804#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:19,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {8804#(<= ~counter~0 2)} assume true; {8804#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:19,670 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8804#(<= ~counter~0 2)} {8804#(<= ~counter~0 2)} #96#return; {8804#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:19,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {8804#(<= ~counter~0 2)} assume !(~r~0 > 0); {8804#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:19,671 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-07 14:02:19,671 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-07 14:02:19,672 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-07 14:02:19,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {8829#(<= ~counter~0 3)} ~cond := #in~cond; {8829#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:19,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {8829#(<= ~counter~0 3)} assume !(0 == ~cond); {8829#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:19,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {8829#(<= ~counter~0 3)} assume true; {8829#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:19,673 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8829#(<= ~counter~0 3)} {8829#(<= ~counter~0 3)} #98#return; {8829#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:19,673 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-07 14:02:19,674 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-07 14:02:19,674 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-07 14:02:19,675 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-07 14:02:19,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {8854#(<= ~counter~0 4)} ~cond := #in~cond; {8854#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:19,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {8854#(<= ~counter~0 4)} assume !(0 == ~cond); {8854#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:19,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {8854#(<= ~counter~0 4)} assume true; {8854#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:19,676 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8854#(<= ~counter~0 4)} {8854#(<= ~counter~0 4)} #98#return; {8854#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:19,676 INFO L290 TraceCheckUtils]: 48: Hoare triple {8854#(<= ~counter~0 4)} assume !(~r~0 < 0); {8854#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:19,677 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-07 14:02:19,677 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-07 14:02:19,677 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-07 14:02:19,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {8879#(<= ~counter~0 5)} ~cond := #in~cond; {8879#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:19,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {8879#(<= ~counter~0 5)} assume !(0 == ~cond); {8879#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:19,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {8879#(<= ~counter~0 5)} assume true; {8879#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:19,679 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8879#(<= ~counter~0 5)} {8879#(<= ~counter~0 5)} #94#return; {8879#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:19,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {8879#(<= ~counter~0 5)} assume !!(0 != ~r~0); {8879#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:19,679 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-07 14:02:19,679 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-07 14:02:19,680 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-07 14:02:19,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {8904#(<= ~counter~0 6)} ~cond := #in~cond; {8904#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:19,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {8904#(<= ~counter~0 6)} assume !(0 == ~cond); {8904#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:19,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {8904#(<= ~counter~0 6)} assume true; {8904#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:19,681 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8904#(<= ~counter~0 6)} {8904#(<= ~counter~0 6)} #96#return; {8904#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:19,681 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-07 14:02:19,682 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-07 14:02:19,682 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-07 14:02:19,683 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-07 14:02:19,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {8929#(<= ~counter~0 7)} ~cond := #in~cond; {8929#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:19,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {8929#(<= ~counter~0 7)} assume !(0 == ~cond); {8929#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:19,683 INFO L290 TraceCheckUtils]: 70: Hoare triple {8929#(<= ~counter~0 7)} assume true; {8929#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:19,684 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8929#(<= ~counter~0 7)} {8929#(<= ~counter~0 7)} #96#return; {8929#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:19,684 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-07 14:02:19,684 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-07 14:02:19,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {8954#(<= |main_#t~post7| 7)} assume !(#t~post7 < 100);havoc #t~post7; {8723#false} is VALID [2022-04-07 14:02:19,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-07 14:02:19,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {8723#false} assume !!(#t~post8 < 100);havoc #t~post8; {8723#false} is VALID [2022-04-07 14:02:19,685 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-07 14:02:19,685 INFO L290 TraceCheckUtils]: 78: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-07 14:02:19,685 INFO L290 TraceCheckUtils]: 79: Hoare triple {8723#false} assume !(0 == ~cond); {8723#false} is VALID [2022-04-07 14:02:19,685 INFO L290 TraceCheckUtils]: 80: Hoare triple {8723#false} assume true; {8723#false} is VALID [2022-04-07 14:02:19,685 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8723#false} {8723#false} #98#return; {8723#false} is VALID [2022-04-07 14:02:19,685 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-07 14:02:19,685 INFO L290 TraceCheckUtils]: 83: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-07 14:02:19,685 INFO L290 TraceCheckUtils]: 84: Hoare triple {8723#false} assume !(#t~post8 < 100);havoc #t~post8; {8723#false} is VALID [2022-04-07 14:02:19,685 INFO L290 TraceCheckUtils]: 85: Hoare triple {8723#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8723#false} is VALID [2022-04-07 14:02:19,685 INFO L290 TraceCheckUtils]: 86: Hoare triple {8723#false} assume !(#t~post6 < 100);havoc #t~post6; {8723#false} is VALID [2022-04-07 14:02:19,685 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-07 14:02:19,685 INFO L290 TraceCheckUtils]: 88: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-07 14:02:19,686 INFO L290 TraceCheckUtils]: 89: Hoare triple {8723#false} assume 0 == ~cond; {8723#false} is VALID [2022-04-07 14:02:19,686 INFO L290 TraceCheckUtils]: 90: Hoare triple {8723#false} assume !false; {8723#false} is VALID [2022-04-07 14:02:19,686 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-07 14:02:19,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:20,093 INFO L290 TraceCheckUtils]: 90: Hoare triple {8723#false} assume !false; {8723#false} is VALID [2022-04-07 14:02:20,093 INFO L290 TraceCheckUtils]: 89: Hoare triple {8723#false} assume 0 == ~cond; {8723#false} is VALID [2022-04-07 14:02:20,093 INFO L290 TraceCheckUtils]: 88: Hoare triple {8723#false} ~cond := #in~cond; {8723#false} is VALID [2022-04-07 14:02:20,093 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-07 14:02:20,093 INFO L290 TraceCheckUtils]: 86: Hoare triple {8723#false} assume !(#t~post6 < 100);havoc #t~post6; {8723#false} is VALID [2022-04-07 14:02:20,093 INFO L290 TraceCheckUtils]: 85: Hoare triple {8723#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8723#false} is VALID [2022-04-07 14:02:20,093 INFO L290 TraceCheckUtils]: 84: Hoare triple {8723#false} assume !(#t~post8 < 100);havoc #t~post8; {8723#false} is VALID [2022-04-07 14:02:20,094 INFO L290 TraceCheckUtils]: 83: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-07 14:02:20,094 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-07 14:02:20,094 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8722#true} {8723#false} #98#return; {8723#false} is VALID [2022-04-07 14:02:20,094 INFO L290 TraceCheckUtils]: 80: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,094 INFO L290 TraceCheckUtils]: 79: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,094 INFO L290 TraceCheckUtils]: 78: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,094 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-07 14:02:20,094 INFO L290 TraceCheckUtils]: 76: Hoare triple {8723#false} assume !!(#t~post8 < 100);havoc #t~post8; {8723#false} is VALID [2022-04-07 14:02:20,094 INFO L290 TraceCheckUtils]: 75: Hoare triple {8723#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8723#false} is VALID [2022-04-07 14:02:20,095 INFO L290 TraceCheckUtils]: 74: Hoare triple {9054#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {8723#false} is VALID [2022-04-07 14:02:20,095 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-07 14:02:20,095 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-07 14:02:20,096 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8722#true} {9058#(< ~counter~0 100)} #96#return; {9058#(< ~counter~0 100)} is VALID [2022-04-07 14:02:20,096 INFO L290 TraceCheckUtils]: 70: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,096 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-07 14:02:20,096 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-07 14:02:20,097 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-07 14:02:20,097 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-07 14:02:20,098 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8722#true} {9083#(< ~counter~0 99)} #96#return; {9083#(< ~counter~0 99)} is VALID [2022-04-07 14:02:20,098 INFO L290 TraceCheckUtils]: 62: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,098 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-07 14:02:20,098 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-07 14:02:20,099 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-07 14:02:20,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {9108#(< ~counter~0 98)} assume !!(0 != ~r~0); {9108#(< ~counter~0 98)} is VALID [2022-04-07 14:02:20,099 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8722#true} {9108#(< ~counter~0 98)} #94#return; {9108#(< ~counter~0 98)} is VALID [2022-04-07 14:02:20,099 INFO L290 TraceCheckUtils]: 54: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,100 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-07 14:02:20,100 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-07 14:02:20,100 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-07 14:02:20,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {9133#(< ~counter~0 97)} assume !(~r~0 < 0); {9133#(< ~counter~0 97)} is VALID [2022-04-07 14:02:20,101 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8722#true} {9133#(< ~counter~0 97)} #98#return; {9133#(< ~counter~0 97)} is VALID [2022-04-07 14:02:20,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,101 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-07 14:02:20,102 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-07 14:02:20,102 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-07 14:02:20,102 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-07 14:02:20,103 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8722#true} {9158#(< ~counter~0 96)} #98#return; {9158#(< ~counter~0 96)} is VALID [2022-04-07 14:02:20,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,103 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-07 14:02:20,103 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-07 14:02:20,103 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-07 14:02:20,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {9183#(< ~counter~0 95)} assume !(~r~0 > 0); {9183#(< ~counter~0 95)} is VALID [2022-04-07 14:02:20,104 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8722#true} {9183#(< ~counter~0 95)} #96#return; {9183#(< ~counter~0 95)} is VALID [2022-04-07 14:02:20,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,104 INFO L290 TraceCheckUtils]: 28: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,104 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-07 14:02:20,105 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-07 14:02:20,105 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-07 14:02:20,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {9208#(< ~counter~0 94)} assume !!(0 != ~r~0); {9208#(< ~counter~0 94)} is VALID [2022-04-07 14:02:20,106 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8722#true} {9208#(< ~counter~0 94)} #94#return; {9208#(< ~counter~0 94)} is VALID [2022-04-07 14:02:20,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,106 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-07 14:02:20,106 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-07 14:02:20,106 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-07 14:02:20,107 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-07 14:02:20,107 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8722#true} {9233#(< ~counter~0 93)} #92#return; {9233#(< ~counter~0 93)} is VALID [2022-04-07 14:02:20,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,107 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-07 14:02:20,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8722#true} {9233#(< ~counter~0 93)} #90#return; {9233#(< ~counter~0 93)} is VALID [2022-04-07 14:02:20,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {8722#true} assume true; {8722#true} is VALID [2022-04-07 14:02:20,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {8722#true} assume !(0 == ~cond); {8722#true} is VALID [2022-04-07 14:02:20,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {8722#true} ~cond := #in~cond; {8722#true} is VALID [2022-04-07 14:02:20,108 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-07 14:02:20,108 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-07 14:02:20,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {9233#(< ~counter~0 93)} call #t~ret9 := main(); {9233#(< ~counter~0 93)} is VALID [2022-04-07 14:02:20,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9233#(< ~counter~0 93)} {8722#true} #102#return; {9233#(< ~counter~0 93)} is VALID [2022-04-07 14:02:20,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {9233#(< ~counter~0 93)} assume true; {9233#(< ~counter~0 93)} is VALID [2022-04-07 14:02:20,109 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-07 14:02:20,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {8722#true} call ULTIMATE.init(); {8722#true} is VALID [2022-04-07 14:02:20,110 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-07 14:02:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:20,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774546674] [2022-04-07 14:02:20,110 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:20,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048122970] [2022-04-07 14:02:20,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048122970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:20,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:20,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-07 14:02:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326944297] [2022-04-07 14:02:20,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:20,111 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-07 14:02:20,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:20,111 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-07 14:02:20,203 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-07 14:02:20,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-07 14:02:20,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:20,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-07 14:02:20,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-07 14:02:20,204 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-07 14:02:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:21,786 INFO L93 Difference]: Finished difference Result 985 states and 1423 transitions. [2022-04-07 14:02:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-07 14:02:21,786 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-07 14:02:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:21,787 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-07 14:02:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-07 14:02:21,790 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-07 14:02:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 373 transitions. [2022-04-07 14:02:21,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 373 transitions. [2022-04-07 14:02:22,024 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-07 14:02:22,054 INFO L225 Difference]: With dead ends: 985 [2022-04-07 14:02:22,054 INFO L226 Difference]: Without dead ends: 842 [2022-04-07 14:02:22,055 INFO L912 BasicCegarLoop]: 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-07 14:02:22,055 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 352 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:22,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 364 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 14:02:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-04-07 14:02:22,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 793. [2022-04-07 14:02:22,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:22,525 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-07 14:02:22,526 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-07 14:02:22,527 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-07 14:02:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:22,554 INFO L93 Difference]: Finished difference Result 842 states and 1155 transitions. [2022-04-07 14:02:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2022-04-07 14:02:22,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:22,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:22,562 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-07 14:02:22,563 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-07 14:02:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:22,589 INFO L93 Difference]: Finished difference Result 842 states and 1155 transitions. [2022-04-07 14:02:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1155 transitions. [2022-04-07 14:02:22,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:22,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:22,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:22,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:22,595 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-07 14:02:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1109 transitions. [2022-04-07 14:02:22,624 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1109 transitions. Word has length 91 [2022-04-07 14:02:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:22,624 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 1109 transitions. [2022-04-07 14:02:22,624 INFO L479 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-07 14:02:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1109 transitions. [2022-04-07 14:02:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-07 14:02:22,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:22,626 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:22,645 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-07 14:02:22,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-07 14:02:22,843 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 1 times [2022-04-07 14:02:22,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:22,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487834481] [2022-04-07 14:02:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:22,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:22,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [592347070] [2022-04-07 14:02:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:22,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:22,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:22,862 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-07 14:02:22,863 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-07 14:02:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:22,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 14:02:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:22,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:23,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {13512#true} call ULTIMATE.init(); {13512#true} is VALID [2022-04-07 14:02:23,412 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-07 14:02:23,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13520#(<= ~counter~0 0)} {13512#true} #102#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {13520#(<= ~counter~0 0)} call #t~ret9 := main(); {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,413 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-07 14:02:23,413 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-07 14:02:23,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {13520#(<= ~counter~0 0)} ~cond := #in~cond; {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {13520#(<= ~counter~0 0)} assume !(0 == ~cond); {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,414 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13520#(<= ~counter~0 0)} {13520#(<= ~counter~0 0)} #90#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,415 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-07 14:02:23,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {13520#(<= ~counter~0 0)} ~cond := #in~cond; {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {13520#(<= ~counter~0 0)} assume !(0 == ~cond); {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {13520#(<= ~counter~0 0)} assume true; {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,416 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13520#(<= ~counter~0 0)} {13520#(<= ~counter~0 0)} #92#return; {13520#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:23,417 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-07 14:02:23,417 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-07 14:02:23,417 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-07 14:02:23,418 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-07 14:02:23,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {13569#(<= ~counter~0 1)} ~cond := #in~cond; {13569#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {13569#(<= ~counter~0 1)} assume !(0 == ~cond); {13569#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {13569#(<= ~counter~0 1)} assume true; {13569#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,419 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13569#(<= ~counter~0 1)} {13569#(<= ~counter~0 1)} #94#return; {13569#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {13569#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13569#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:23,420 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-07 14:02:23,420 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-07 14:02:23,422 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-07 14:02:23,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {13594#(<= ~counter~0 2)} ~cond := #in~cond; {13594#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {13594#(<= ~counter~0 2)} assume !(0 == ~cond); {13594#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {13594#(<= ~counter~0 2)} assume true; {13594#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,423 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13594#(<= ~counter~0 2)} {13594#(<= ~counter~0 2)} #96#return; {13594#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {13594#(<= ~counter~0 2)} assume !(~r~0 > 0); {13594#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:23,423 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-07 14:02:23,424 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-07 14:02:23,424 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-07 14:02:23,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {13619#(<= ~counter~0 3)} ~cond := #in~cond; {13619#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:23,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {13619#(<= ~counter~0 3)} assume !(0 == ~cond); {13619#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:23,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {13619#(<= ~counter~0 3)} assume true; {13619#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:23,425 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13619#(<= ~counter~0 3)} {13619#(<= ~counter~0 3)} #98#return; {13619#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:23,426 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-07 14:02:23,426 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-07 14:02:23,426 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-07 14:02:23,427 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-07 14:02:23,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {13644#(<= ~counter~0 4)} ~cond := #in~cond; {13644#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:23,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {13644#(<= ~counter~0 4)} assume !(0 == ~cond); {13644#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:23,427 INFO L290 TraceCheckUtils]: 46: Hoare triple {13644#(<= ~counter~0 4)} assume true; {13644#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:23,428 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13644#(<= ~counter~0 4)} {13644#(<= ~counter~0 4)} #98#return; {13644#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:23,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {13644#(<= ~counter~0 4)} assume !(~r~0 < 0); {13644#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:23,428 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-07 14:02:23,429 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-07 14:02:23,429 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-07 14:02:23,429 INFO L290 TraceCheckUtils]: 52: Hoare triple {13669#(<= ~counter~0 5)} ~cond := #in~cond; {13669#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:23,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {13669#(<= ~counter~0 5)} assume !(0 == ~cond); {13669#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:23,430 INFO L290 TraceCheckUtils]: 54: Hoare triple {13669#(<= ~counter~0 5)} assume true; {13669#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:23,430 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13669#(<= ~counter~0 5)} {13669#(<= ~counter~0 5)} #94#return; {13669#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:23,430 INFO L290 TraceCheckUtils]: 56: Hoare triple {13669#(<= ~counter~0 5)} assume !!(0 != ~r~0); {13669#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:23,431 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-07 14:02:23,431 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-07 14:02:23,432 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-07 14:02:23,432 INFO L290 TraceCheckUtils]: 60: Hoare triple {13694#(<= ~counter~0 6)} ~cond := #in~cond; {13694#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:23,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {13694#(<= ~counter~0 6)} assume !(0 == ~cond); {13694#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:23,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {13694#(<= ~counter~0 6)} assume true; {13694#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:23,433 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13694#(<= ~counter~0 6)} {13694#(<= ~counter~0 6)} #96#return; {13694#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:23,441 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-07 14:02:23,441 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-07 14:02:23,442 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-07 14:02:23,443 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-07 14:02:23,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {13719#(<= ~counter~0 7)} ~cond := #in~cond; {13719#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:23,445 INFO L290 TraceCheckUtils]: 69: Hoare triple {13719#(<= ~counter~0 7)} assume !(0 == ~cond); {13719#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:23,445 INFO L290 TraceCheckUtils]: 70: Hoare triple {13719#(<= ~counter~0 7)} assume true; {13719#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:23,446 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13719#(<= ~counter~0 7)} {13719#(<= ~counter~0 7)} #96#return; {13719#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:23,446 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-07 14:02:23,447 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-07 14:02:23,447 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-07 14:02:23,447 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-07 14:02:23,448 INFO L290 TraceCheckUtils]: 76: Hoare triple {13744#(<= ~counter~0 8)} ~cond := #in~cond; {13744#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:23,448 INFO L290 TraceCheckUtils]: 77: Hoare triple {13744#(<= ~counter~0 8)} assume !(0 == ~cond); {13744#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:23,448 INFO L290 TraceCheckUtils]: 78: Hoare triple {13744#(<= ~counter~0 8)} assume true; {13744#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:23,448 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13744#(<= ~counter~0 8)} {13744#(<= ~counter~0 8)} #96#return; {13744#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:23,449 INFO L290 TraceCheckUtils]: 80: Hoare triple {13744#(<= ~counter~0 8)} assume !(~r~0 > 0); {13744#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:23,449 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-07 14:02:23,449 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-07 14:02:23,450 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-07 14:02:23,450 INFO L290 TraceCheckUtils]: 84: Hoare triple {13769#(<= ~counter~0 9)} ~cond := #in~cond; {13769#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:23,450 INFO L290 TraceCheckUtils]: 85: Hoare triple {13769#(<= ~counter~0 9)} assume !(0 == ~cond); {13769#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:23,450 INFO L290 TraceCheckUtils]: 86: Hoare triple {13769#(<= ~counter~0 9)} assume true; {13769#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:23,451 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13769#(<= ~counter~0 9)} {13769#(<= ~counter~0 9)} #98#return; {13769#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:23,451 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-07 14:02:23,451 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-07 14:02:23,452 INFO L290 TraceCheckUtils]: 90: Hoare triple {13794#(<= |main_#t~post8| 9)} assume !(#t~post8 < 100);havoc #t~post8; {13513#false} is VALID [2022-04-07 14:02:23,452 INFO L290 TraceCheckUtils]: 91: Hoare triple {13513#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13513#false} is VALID [2022-04-07 14:02:23,452 INFO L290 TraceCheckUtils]: 92: Hoare triple {13513#false} assume !(#t~post6 < 100);havoc #t~post6; {13513#false} is VALID [2022-04-07 14:02:23,452 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-07 14:02:23,452 INFO L290 TraceCheckUtils]: 94: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-07 14:02:23,452 INFO L290 TraceCheckUtils]: 95: Hoare triple {13513#false} assume 0 == ~cond; {13513#false} is VALID [2022-04-07 14:02:23,452 INFO L290 TraceCheckUtils]: 96: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-07 14:02:23,452 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-07 14:02:23,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:23,951 INFO L290 TraceCheckUtils]: 96: Hoare triple {13513#false} assume !false; {13513#false} is VALID [2022-04-07 14:02:23,951 INFO L290 TraceCheckUtils]: 95: Hoare triple {13513#false} assume 0 == ~cond; {13513#false} is VALID [2022-04-07 14:02:23,951 INFO L290 TraceCheckUtils]: 94: Hoare triple {13513#false} ~cond := #in~cond; {13513#false} is VALID [2022-04-07 14:02:23,951 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-07 14:02:23,951 INFO L290 TraceCheckUtils]: 92: Hoare triple {13513#false} assume !(#t~post6 < 100);havoc #t~post6; {13513#false} is VALID [2022-04-07 14:02:23,951 INFO L290 TraceCheckUtils]: 91: Hoare triple {13513#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13513#false} is VALID [2022-04-07 14:02:23,959 INFO L290 TraceCheckUtils]: 90: Hoare triple {13834#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {13513#false} is VALID [2022-04-07 14:02:23,959 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-07 14:02:23,960 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-07 14:02:23,960 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {13512#true} {13838#(< ~counter~0 100)} #98#return; {13838#(< ~counter~0 100)} is VALID [2022-04-07 14:02:23,960 INFO L290 TraceCheckUtils]: 86: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,961 INFO L290 TraceCheckUtils]: 85: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,961 INFO L290 TraceCheckUtils]: 84: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,961 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-07 14:02:23,961 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-07 14:02:23,962 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-07 14:02:23,962 INFO L290 TraceCheckUtils]: 80: Hoare triple {13863#(< ~counter~0 99)} assume !(~r~0 > 0); {13863#(< ~counter~0 99)} is VALID [2022-04-07 14:02:23,962 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {13512#true} {13863#(< ~counter~0 99)} #96#return; {13863#(< ~counter~0 99)} is VALID [2022-04-07 14:02:23,962 INFO L290 TraceCheckUtils]: 78: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,963 INFO L290 TraceCheckUtils]: 77: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,963 INFO L290 TraceCheckUtils]: 76: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,963 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-07 14:02:23,963 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-07 14:02:23,963 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-07 14:02:23,964 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-07 14:02:23,964 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13512#true} {13888#(< ~counter~0 98)} #96#return; {13888#(< ~counter~0 98)} is VALID [2022-04-07 14:02:23,964 INFO L290 TraceCheckUtils]: 70: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,964 INFO L290 TraceCheckUtils]: 69: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,965 INFO L290 TraceCheckUtils]: 68: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,965 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-07 14:02:23,965 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-07 14:02:23,965 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-07 14:02:23,966 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-07 14:02:23,966 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13512#true} {13913#(< ~counter~0 97)} #96#return; {13913#(< ~counter~0 97)} is VALID [2022-04-07 14:02:23,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,967 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-07 14:02:23,967 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-07 14:02:23,967 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-07 14:02:23,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {13938#(< ~counter~0 96)} assume !!(0 != ~r~0); {13938#(< ~counter~0 96)} is VALID [2022-04-07 14:02:23,968 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13512#true} {13938#(< ~counter~0 96)} #94#return; {13938#(< ~counter~0 96)} is VALID [2022-04-07 14:02:23,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,968 INFO L290 TraceCheckUtils]: 52: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,968 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-07 14:02:23,969 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-07 14:02:23,969 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-07 14:02:23,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {13963#(< ~counter~0 95)} assume !(~r~0 < 0); {13963#(< ~counter~0 95)} is VALID [2022-04-07 14:02:23,970 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13512#true} {13963#(< ~counter~0 95)} #98#return; {13963#(< ~counter~0 95)} is VALID [2022-04-07 14:02:23,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,970 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-07 14:02:23,971 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-07 14:02:23,971 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-07 14:02:23,971 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-07 14:02:23,972 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13512#true} {13988#(< ~counter~0 94)} #98#return; {13988#(< ~counter~0 94)} is VALID [2022-04-07 14:02:23,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,972 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-07 14:02:23,972 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-07 14:02:23,973 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-07 14:02:23,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {14013#(< ~counter~0 93)} assume !(~r~0 > 0); {14013#(< ~counter~0 93)} is VALID [2022-04-07 14:02:23,973 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13512#true} {14013#(< ~counter~0 93)} #96#return; {14013#(< ~counter~0 93)} is VALID [2022-04-07 14:02:23,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,974 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-07 14:02:23,974 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-07 14:02:23,974 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-07 14:02:23,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {14038#(< ~counter~0 92)} assume !!(0 != ~r~0); {14038#(< ~counter~0 92)} is VALID [2022-04-07 14:02:23,975 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13512#true} {14038#(< ~counter~0 92)} #94#return; {14038#(< ~counter~0 92)} is VALID [2022-04-07 14:02:23,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,975 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-07 14:02:23,975 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-07 14:02:23,976 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-07 14:02:23,976 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-07 14:02:23,976 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13512#true} {14063#(< ~counter~0 91)} #92#return; {14063#(< ~counter~0 91)} is VALID [2022-04-07 14:02:23,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,977 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-07 14:02:23,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13512#true} {14063#(< ~counter~0 91)} #90#return; {14063#(< ~counter~0 91)} is VALID [2022-04-07 14:02:23,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {13512#true} assume true; {13512#true} is VALID [2022-04-07 14:02:23,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {13512#true} assume !(0 == ~cond); {13512#true} is VALID [2022-04-07 14:02:23,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {13512#true} ~cond := #in~cond; {13512#true} is VALID [2022-04-07 14:02:23,977 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-07 14:02:23,977 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-07 14:02:23,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {14063#(< ~counter~0 91)} call #t~ret9 := main(); {14063#(< ~counter~0 91)} is VALID [2022-04-07 14:02:23,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14063#(< ~counter~0 91)} {13512#true} #102#return; {14063#(< ~counter~0 91)} is VALID [2022-04-07 14:02:23,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {14063#(< ~counter~0 91)} assume true; {14063#(< ~counter~0 91)} is VALID [2022-04-07 14:02:23,979 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-07 14:02:23,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {13512#true} call ULTIMATE.init(); {13512#true} is VALID [2022-04-07 14:02:23,979 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-07 14:02:23,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487834481] [2022-04-07 14:02:23,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592347070] [2022-04-07 14:02:23,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592347070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:23,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:23,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-07 14:02:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461204283] [2022-04-07 14:02:23,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:23,980 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-07 14:02:23,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:23,980 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-07 14:02:24,085 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-07 14:02:24,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-07 14:02:24,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:24,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-07 14:02:24,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-07 14:02:24,086 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-07 14:02:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:26,291 INFO L93 Difference]: Finished difference Result 1285 states and 1799 transitions. [2022-04-07 14:02:26,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-07 14:02:26,291 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-07 14:02:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:26,292 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-07 14:02:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-07 14:02:26,296 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-07 14:02:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 467 transitions. [2022-04-07 14:02:26,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 467 transitions. [2022-04-07 14:02:26,632 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-07 14:02:26,660 INFO L225 Difference]: With dead ends: 1285 [2022-04-07 14:02:26,660 INFO L226 Difference]: Without dead ends: 795 [2022-04-07 14:02:26,661 INFO L912 BasicCegarLoop]: 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-07 14:02:26,661 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 597 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:26,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 507 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 14:02:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-07 14:02:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 740. [2022-04-07 14:02:27,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:27,068 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-07 14:02:27,069 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-07 14:02:27,070 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-07 14:02:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:27,093 INFO L93 Difference]: Finished difference Result 795 states and 1047 transitions. [2022-04-07 14:02:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1047 transitions. [2022-04-07 14:02:27,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:27,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:27,102 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-07 14:02:27,103 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-07 14:02:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:27,126 INFO L93 Difference]: Finished difference Result 795 states and 1047 transitions. [2022-04-07 14:02:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1047 transitions. [2022-04-07 14:02:27,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:27,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:27,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:27,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:27,129 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-07 14:02:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1001 transitions. [2022-04-07 14:02:27,153 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1001 transitions. Word has length 97 [2022-04-07 14:02:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:27,153 INFO L478 AbstractCegarLoop]: Abstraction has 740 states and 1001 transitions. [2022-04-07 14:02:27,153 INFO L479 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-07 14:02:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1001 transitions. [2022-04-07 14:02:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-07 14:02:27,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:27,154 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 14:02:27,177 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-07 14:02:27,360 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 14:02:27,360 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:27,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 1 times [2022-04-07 14:02:27,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:27,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309736625] [2022-04-07 14:02:27,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:27,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:27,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:27,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059969212] [2022-04-07 14:02:27,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:27,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:27,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:27,374 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-07 14:02:27,375 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-07 14:02:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:27,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 14:02:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:27,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:27,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-07 14:02:27,903 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-07 14:02:27,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18589#(<= ~counter~0 0)} {18581#true} #102#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {18589#(<= ~counter~0 0)} call #t~ret9 := main(); {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,904 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-07 14:02:27,904 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-07 14:02:27,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {18589#(<= ~counter~0 0)} ~cond := #in~cond; {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {18589#(<= ~counter~0 0)} assume !(0 == ~cond); {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18589#(<= ~counter~0 0)} {18589#(<= ~counter~0 0)} #90#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,906 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-07 14:02:27,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {18589#(<= ~counter~0 0)} ~cond := #in~cond; {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {18589#(<= ~counter~0 0)} assume !(0 == ~cond); {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {18589#(<= ~counter~0 0)} assume true; {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,907 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18589#(<= ~counter~0 0)} {18589#(<= ~counter~0 0)} #92#return; {18589#(<= ~counter~0 0)} is VALID [2022-04-07 14:02:27,907 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-07 14:02:27,907 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-07 14:02:27,908 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-07 14:02:27,908 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-07 14:02:27,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {18638#(<= ~counter~0 1)} ~cond := #in~cond; {18638#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:27,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {18638#(<= ~counter~0 1)} assume !(0 == ~cond); {18638#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:27,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {18638#(<= ~counter~0 1)} assume true; {18638#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:27,909 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18638#(<= ~counter~0 1)} {18638#(<= ~counter~0 1)} #94#return; {18638#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:27,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {18638#(<= ~counter~0 1)} assume !!(0 != ~r~0); {18638#(<= ~counter~0 1)} is VALID [2022-04-07 14:02:27,910 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-07 14:02:27,910 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-07 14:02:27,910 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-07 14:02:27,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {18663#(<= ~counter~0 2)} ~cond := #in~cond; {18663#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:27,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {18663#(<= ~counter~0 2)} assume !(0 == ~cond); {18663#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:27,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {18663#(<= ~counter~0 2)} assume true; {18663#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:27,912 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18663#(<= ~counter~0 2)} {18663#(<= ~counter~0 2)} #96#return; {18663#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:27,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {18663#(<= ~counter~0 2)} assume !(~r~0 > 0); {18663#(<= ~counter~0 2)} is VALID [2022-04-07 14:02:27,912 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-07 14:02:27,912 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-07 14:02:27,913 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-07 14:02:27,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {18688#(<= ~counter~0 3)} ~cond := #in~cond; {18688#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:27,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {18688#(<= ~counter~0 3)} assume !(0 == ~cond); {18688#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:27,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {18688#(<= ~counter~0 3)} assume true; {18688#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:27,914 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18688#(<= ~counter~0 3)} {18688#(<= ~counter~0 3)} #98#return; {18688#(<= ~counter~0 3)} is VALID [2022-04-07 14:02:27,914 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-07 14:02:27,915 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-07 14:02:27,915 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-07 14:02:27,915 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-07 14:02:27,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {18713#(<= ~counter~0 4)} ~cond := #in~cond; {18713#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:27,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {18713#(<= ~counter~0 4)} assume !(0 == ~cond); {18713#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:27,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {18713#(<= ~counter~0 4)} assume true; {18713#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:27,916 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18713#(<= ~counter~0 4)} {18713#(<= ~counter~0 4)} #98#return; {18713#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:27,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {18713#(<= ~counter~0 4)} assume !(~r~0 < 0); {18713#(<= ~counter~0 4)} is VALID [2022-04-07 14:02:27,917 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-07 14:02:27,917 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-07 14:02:27,918 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-07 14:02:27,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {18738#(<= ~counter~0 5)} ~cond := #in~cond; {18738#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:27,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {18738#(<= ~counter~0 5)} assume !(0 == ~cond); {18738#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:27,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {18738#(<= ~counter~0 5)} assume true; {18738#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:27,919 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18738#(<= ~counter~0 5)} {18738#(<= ~counter~0 5)} #94#return; {18738#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:27,919 INFO L290 TraceCheckUtils]: 56: Hoare triple {18738#(<= ~counter~0 5)} assume !!(0 != ~r~0); {18738#(<= ~counter~0 5)} is VALID [2022-04-07 14:02:27,919 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-07 14:02:27,920 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-07 14:02:27,920 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-07 14:02:27,920 INFO L290 TraceCheckUtils]: 60: Hoare triple {18763#(<= ~counter~0 6)} ~cond := #in~cond; {18763#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:27,921 INFO L290 TraceCheckUtils]: 61: Hoare triple {18763#(<= ~counter~0 6)} assume !(0 == ~cond); {18763#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:27,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {18763#(<= ~counter~0 6)} assume true; {18763#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:27,921 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18763#(<= ~counter~0 6)} {18763#(<= ~counter~0 6)} #96#return; {18763#(<= ~counter~0 6)} is VALID [2022-04-07 14:02:27,921 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-07 14:02:27,922 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-07 14:02:27,922 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-07 14:02:27,923 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-07 14:02:27,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {18788#(<= ~counter~0 7)} ~cond := #in~cond; {18788#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:27,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {18788#(<= ~counter~0 7)} assume !(0 == ~cond); {18788#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:27,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {18788#(<= ~counter~0 7)} assume true; {18788#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:27,926 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18788#(<= ~counter~0 7)} {18788#(<= ~counter~0 7)} #96#return; {18788#(<= ~counter~0 7)} is VALID [2022-04-07 14:02:27,926 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-07 14:02:27,927 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-07 14:02:27,927 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-07 14:02:27,927 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-07 14:02:27,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {18813#(<= ~counter~0 8)} ~cond := #in~cond; {18813#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:27,928 INFO L290 TraceCheckUtils]: 77: Hoare triple {18813#(<= ~counter~0 8)} assume !(0 == ~cond); {18813#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:27,928 INFO L290 TraceCheckUtils]: 78: Hoare triple {18813#(<= ~counter~0 8)} assume true; {18813#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:27,928 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18813#(<= ~counter~0 8)} {18813#(<= ~counter~0 8)} #96#return; {18813#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:27,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {18813#(<= ~counter~0 8)} assume !(~r~0 > 0); {18813#(<= ~counter~0 8)} is VALID [2022-04-07 14:02:27,929 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-07 14:02:27,929 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-07 14:02:27,930 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-07 14:02:27,930 INFO L290 TraceCheckUtils]: 84: Hoare triple {18838#(<= ~counter~0 9)} ~cond := #in~cond; {18838#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:27,930 INFO L290 TraceCheckUtils]: 85: Hoare triple {18838#(<= ~counter~0 9)} assume !(0 == ~cond); {18838#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:27,930 INFO L290 TraceCheckUtils]: 86: Hoare triple {18838#(<= ~counter~0 9)} assume true; {18838#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:27,931 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18838#(<= ~counter~0 9)} {18838#(<= ~counter~0 9)} #98#return; {18838#(<= ~counter~0 9)} is VALID [2022-04-07 14:02:27,931 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-07 14:02:27,931 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-07 14:02:27,932 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-07 14:02:27,932 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-07 14:02:27,932 INFO L290 TraceCheckUtils]: 92: Hoare triple {18863#(<= ~counter~0 10)} ~cond := #in~cond; {18863#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:27,933 INFO L290 TraceCheckUtils]: 93: Hoare triple {18863#(<= ~counter~0 10)} assume !(0 == ~cond); {18863#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:27,933 INFO L290 TraceCheckUtils]: 94: Hoare triple {18863#(<= ~counter~0 10)} assume true; {18863#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:27,933 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18863#(<= ~counter~0 10)} {18863#(<= ~counter~0 10)} #98#return; {18863#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:27,933 INFO L290 TraceCheckUtils]: 96: Hoare triple {18863#(<= ~counter~0 10)} assume !(~r~0 < 0); {18863#(<= ~counter~0 10)} is VALID [2022-04-07 14:02:27,934 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-07 14:02:27,934 INFO L290 TraceCheckUtils]: 98: Hoare triple {18888#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {18582#false} is VALID [2022-04-07 14:02:27,934 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-07 14:02:27,934 INFO L290 TraceCheckUtils]: 100: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-07 14:02:27,934 INFO L290 TraceCheckUtils]: 101: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-07 14:02:27,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-07 14:02:27,935 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-07 14:02:27,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:28,499 INFO L290 TraceCheckUtils]: 102: Hoare triple {18582#false} assume !false; {18582#false} is VALID [2022-04-07 14:02:28,499 INFO L290 TraceCheckUtils]: 101: Hoare triple {18582#false} assume 0 == ~cond; {18582#false} is VALID [2022-04-07 14:02:28,499 INFO L290 TraceCheckUtils]: 100: Hoare triple {18582#false} ~cond := #in~cond; {18582#false} is VALID [2022-04-07 14:02:28,499 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-07 14:02:28,499 INFO L290 TraceCheckUtils]: 98: Hoare triple {18916#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {18582#false} is VALID [2022-04-07 14:02:28,500 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-07 14:02:28,500 INFO L290 TraceCheckUtils]: 96: Hoare triple {18920#(< ~counter~0 100)} assume !(~r~0 < 0); {18920#(< ~counter~0 100)} is VALID [2022-04-07 14:02:28,500 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {18581#true} {18920#(< ~counter~0 100)} #98#return; {18920#(< ~counter~0 100)} is VALID [2022-04-07 14:02:28,500 INFO L290 TraceCheckUtils]: 94: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,501 INFO L290 TraceCheckUtils]: 93: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,501 INFO L290 TraceCheckUtils]: 92: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,501 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-07 14:02:28,501 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-07 14:02:28,501 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-07 14:02:28,502 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-07 14:02:28,502 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {18581#true} {18945#(< ~counter~0 99)} #98#return; {18945#(< ~counter~0 99)} is VALID [2022-04-07 14:02:28,502 INFO L290 TraceCheckUtils]: 86: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,502 INFO L290 TraceCheckUtils]: 85: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,502 INFO L290 TraceCheckUtils]: 84: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,502 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-07 14:02:28,503 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-07 14:02:28,503 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-07 14:02:28,503 INFO L290 TraceCheckUtils]: 80: Hoare triple {18970#(< ~counter~0 98)} assume !(~r~0 > 0); {18970#(< ~counter~0 98)} is VALID [2022-04-07 14:02:28,504 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {18581#true} {18970#(< ~counter~0 98)} #96#return; {18970#(< ~counter~0 98)} is VALID [2022-04-07 14:02:28,504 INFO L290 TraceCheckUtils]: 78: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,504 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-07 14:02:28,504 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-07 14:02:28,505 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-07 14:02:28,505 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-07 14:02:28,505 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18581#true} {18995#(< ~counter~0 97)} #96#return; {18995#(< ~counter~0 97)} is VALID [2022-04-07 14:02:28,505 INFO L290 TraceCheckUtils]: 70: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,505 INFO L290 TraceCheckUtils]: 69: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,505 INFO L290 TraceCheckUtils]: 68: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,505 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-07 14:02:28,506 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-07 14:02:28,506 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-07 14:02:28,506 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-07 14:02:28,507 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18581#true} {19020#(< ~counter~0 96)} #96#return; {19020#(< ~counter~0 96)} is VALID [2022-04-07 14:02:28,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,507 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-07 14:02:28,507 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-07 14:02:28,508 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-07 14:02:28,508 INFO L290 TraceCheckUtils]: 56: Hoare triple {19045#(< ~counter~0 95)} assume !!(0 != ~r~0); {19045#(< ~counter~0 95)} is VALID [2022-04-07 14:02:28,508 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18581#true} {19045#(< ~counter~0 95)} #94#return; {19045#(< ~counter~0 95)} is VALID [2022-04-07 14:02:28,508 INFO L290 TraceCheckUtils]: 54: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,508 INFO L290 TraceCheckUtils]: 53: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,508 INFO L290 TraceCheckUtils]: 52: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,509 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-07 14:02:28,509 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-07 14:02:28,509 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-07 14:02:28,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {19070#(< ~counter~0 94)} assume !(~r~0 < 0); {19070#(< ~counter~0 94)} is VALID [2022-04-07 14:02:28,510 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18581#true} {19070#(< ~counter~0 94)} #98#return; {19070#(< ~counter~0 94)} is VALID [2022-04-07 14:02:28,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,510 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-07 14:02:28,511 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-07 14:02:28,511 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-07 14:02:28,512 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-07 14:02:28,512 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18581#true} {19095#(< ~counter~0 93)} #98#return; {19095#(< ~counter~0 93)} is VALID [2022-04-07 14:02:28,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,512 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-07 14:02:28,513 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-07 14:02:28,513 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-07 14:02:28,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {19120#(< ~counter~0 92)} assume !(~r~0 > 0); {19120#(< ~counter~0 92)} is VALID [2022-04-07 14:02:28,514 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {18581#true} {19120#(< ~counter~0 92)} #96#return; {19120#(< ~counter~0 92)} is VALID [2022-04-07 14:02:28,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,514 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-07 14:02:28,519 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-07 14:02:28,520 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-07 14:02:28,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {19145#(< ~counter~0 91)} assume !!(0 != ~r~0); {19145#(< ~counter~0 91)} is VALID [2022-04-07 14:02:28,520 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18581#true} {19145#(< ~counter~0 91)} #94#return; {19145#(< ~counter~0 91)} is VALID [2022-04-07 14:02:28,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,521 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-07 14:02:28,521 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-07 14:02:28,521 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-07 14:02:28,522 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-07 14:02:28,522 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18581#true} {19170#(< ~counter~0 90)} #92#return; {19170#(< ~counter~0 90)} is VALID [2022-04-07 14:02:28,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,522 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-07 14:02:28,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18581#true} {19170#(< ~counter~0 90)} #90#return; {19170#(< ~counter~0 90)} is VALID [2022-04-07 14:02:28,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {18581#true} assume true; {18581#true} is VALID [2022-04-07 14:02:28,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {18581#true} assume !(0 == ~cond); {18581#true} is VALID [2022-04-07 14:02:28,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {18581#true} ~cond := #in~cond; {18581#true} is VALID [2022-04-07 14:02:28,523 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-07 14:02:28,523 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-07 14:02:28,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {19170#(< ~counter~0 90)} call #t~ret9 := main(); {19170#(< ~counter~0 90)} is VALID [2022-04-07 14:02:28,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19170#(< ~counter~0 90)} {18581#true} #102#return; {19170#(< ~counter~0 90)} is VALID [2022-04-07 14:02:28,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {19170#(< ~counter~0 90)} assume true; {19170#(< ~counter~0 90)} is VALID [2022-04-07 14:02:28,525 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-07 14:02:28,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {18581#true} call ULTIMATE.init(); {18581#true} is VALID [2022-04-07 14:02:28,525 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-07 14:02:28,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:28,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309736625] [2022-04-07 14:02:28,525 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:28,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059969212] [2022-04-07 14:02:28,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059969212] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:28,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:28,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-07 14:02:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890196859] [2022-04-07 14:02:28,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:28,527 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-07 14:02:28,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:28,528 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-07 14:02:28,636 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-07 14:02:28,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 14:02:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:28,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 14:02:28,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-07 14:02:28,637 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-07 14:02:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:30,851 INFO L93 Difference]: Finished difference Result 850 states and 1161 transitions. [2022-04-07 14:02:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-07 14:02:30,851 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-07 14:02:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:30,851 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-07 14:02:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-07 14:02:30,856 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-07 14:02:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 452 transitions. [2022-04-07 14:02:30,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 452 transitions. [2022-04-07 14:02:31,192 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-07 14:02:31,221 INFO L225 Difference]: With dead ends: 850 [2022-04-07 14:02:31,221 INFO L226 Difference]: Without dead ends: 845 [2022-04-07 14:02:31,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=670, Invalid=1222, Unknown=0, NotChecked=0, Total=1892 [2022-04-07 14:02:31,222 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 485 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:31,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 549 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 14:02:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-07 14:02:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 830. [2022-04-07 14:02:31,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:31,688 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-07 14:02:31,689 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-07 14:02:31,690 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-07 14:02:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:31,714 INFO L93 Difference]: Finished difference Result 845 states and 1130 transitions. [2022-04-07 14:02:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1130 transitions. [2022-04-07 14:02:31,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:31,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:31,718 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-07 14:02:31,718 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-07 14:02:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:31,743 INFO L93 Difference]: Finished difference Result 845 states and 1130 transitions. [2022-04-07 14:02:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1130 transitions. [2022-04-07 14:02:31,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:31,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:31,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:31,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:31,746 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-07 14:02:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1111 transitions. [2022-04-07 14:02:31,776 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1111 transitions. Word has length 103 [2022-04-07 14:02:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:31,776 INFO L478 AbstractCegarLoop]: Abstraction has 830 states and 1111 transitions. [2022-04-07 14:02:31,776 INFO L479 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-07 14:02:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1111 transitions. [2022-04-07 14:02:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-07 14:02:31,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:31,779 INFO L499 BasicCegarLoop]: 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-07 14:02:31,795 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-07 14:02:31,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:31,996 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:31,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash -599363247, now seen corresponding path program 3 times [2022-04-07 14:02:31,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:31,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948335912] [2022-04-07 14:02:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:32,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:32,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767310538] [2022-04-07 14:02:32,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 14:02:32,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:32,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:32,019 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-07 14:02:32,021 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-07 14:02:32,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 14:02:32,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:02:32,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 14:02:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:32,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:32,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {23302#true} call ULTIMATE.init(); {23302#true} is VALID [2022-04-07 14:02:32,422 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-07 14:02:32,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23302#true} {23302#true} #102#return; {23302#true} is VALID [2022-04-07 14:02:32,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {23302#true} call #t~ret9 := main(); {23302#true} is VALID [2022-04-07 14:02:32,422 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-07 14:02:32,422 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-07 14:02:32,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23302#true} {23302#true} #90#return; {23302#true} is VALID [2022-04-07 14:02:32,423 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-07 14:02:32,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23302#true} {23302#true} #92#return; {23302#true} is VALID [2022-04-07 14:02:32,423 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-07 14:02:32,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,423 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-07 14:02:32,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,423 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-07 14:02:32,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 33: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 34: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,424 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-07 14:02:32,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-07 14:02:32,424 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-07 14:02:32,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,424 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-07 14:02:32,424 INFO L290 TraceCheckUtils]: 44: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,425 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-07 14:02:32,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,425 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-07 14:02:32,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L290 TraceCheckUtils]: 62: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-07 14:02:32,425 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-07 14:02:32,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,425 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-07 14:02:32,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,435 INFO L290 TraceCheckUtils]: 69: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,435 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-07 14:02:32,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-07 14:02:32,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,435 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-07 14:02:32,435 INFO L290 TraceCheckUtils]: 76: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,435 INFO L290 TraceCheckUtils]: 78: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 80: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 81: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 82: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,436 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-07 14:02:32,436 INFO L290 TraceCheckUtils]: 84: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 85: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 86: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 88: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 89: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 90: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,436 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-07 14:02:32,436 INFO L290 TraceCheckUtils]: 92: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 93: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 94: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-07 14:02:32,436 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-07 14:02:32,436 INFO L290 TraceCheckUtils]: 97: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,436 INFO L290 TraceCheckUtils]: 98: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,436 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-07 14:02:32,437 INFO L290 TraceCheckUtils]: 100: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 101: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 102: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 104: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 105: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 106: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,437 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-07 14:02:32,437 INFO L290 TraceCheckUtils]: 108: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 109: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 110: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 112: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 113: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 114: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,437 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-07 14:02:32,437 INFO L290 TraceCheckUtils]: 116: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 117: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 118: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 120: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-07 14:02:32,437 INFO L290 TraceCheckUtils]: 121: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 122: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,438 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-07 14:02:32,438 INFO L290 TraceCheckUtils]: 124: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 125: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 126: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-07 14:02:32,438 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-07 14:02:32,438 INFO L290 TraceCheckUtils]: 129: Hoare triple {23302#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 130: Hoare triple {23302#true} assume !!(#t~post7 < 100);havoc #t~post7; {23302#true} is VALID [2022-04-07 14:02:32,438 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-07 14:02:32,438 INFO L290 TraceCheckUtils]: 132: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 133: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 134: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {23302#true} {23302#true} #96#return; {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 136: Hoare triple {23302#true} assume !(~r~0 > 0); {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 137: Hoare triple {23302#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 138: Hoare triple {23302#true} assume !!(#t~post8 < 100);havoc #t~post8; {23302#true} is VALID [2022-04-07 14:02:32,438 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-07 14:02:32,438 INFO L290 TraceCheckUtils]: 140: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 141: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,438 INFO L290 TraceCheckUtils]: 142: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,439 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {23302#true} {23302#true} #98#return; {23302#true} is VALID [2022-04-07 14:02:32,439 INFO L290 TraceCheckUtils]: 144: Hoare triple {23302#true} assume !(~r~0 < 0); {23302#true} is VALID [2022-04-07 14:02:32,439 INFO L290 TraceCheckUtils]: 145: Hoare triple {23302#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,439 INFO L290 TraceCheckUtils]: 146: Hoare triple {23302#true} assume !!(#t~post6 < 100);havoc #t~post6; {23302#true} is VALID [2022-04-07 14:02:32,439 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-07 14:02:32,439 INFO L290 TraceCheckUtils]: 148: Hoare triple {23302#true} ~cond := #in~cond; {23302#true} is VALID [2022-04-07 14:02:32,439 INFO L290 TraceCheckUtils]: 149: Hoare triple {23302#true} assume !(0 == ~cond); {23302#true} is VALID [2022-04-07 14:02:32,439 INFO L290 TraceCheckUtils]: 150: Hoare triple {23302#true} assume true; {23302#true} is VALID [2022-04-07 14:02:32,439 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {23302#true} {23302#true} #94#return; {23302#true} is VALID [2022-04-07 14:02:32,439 INFO L290 TraceCheckUtils]: 152: Hoare triple {23302#true} assume !!(0 != ~r~0); {23302#true} is VALID [2022-04-07 14:02:32,439 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-07 14:02:32,440 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-07 14:02:32,440 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-07 14:02:32,441 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-07 14:02:32,441 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-07 14:02:32,441 INFO L290 TraceCheckUtils]: 158: Hoare triple {23774#(<= 102 ~counter~0)} ~cond := #in~cond; {23774#(<= 102 ~counter~0)} is VALID [2022-04-07 14:02:32,441 INFO L290 TraceCheckUtils]: 159: Hoare triple {23774#(<= 102 ~counter~0)} assume !(0 == ~cond); {23774#(<= 102 ~counter~0)} is VALID [2022-04-07 14:02:32,442 INFO L290 TraceCheckUtils]: 160: Hoare triple {23774#(<= 102 ~counter~0)} assume true; {23774#(<= 102 ~counter~0)} is VALID [2022-04-07 14:02:32,442 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {23774#(<= 102 ~counter~0)} {23774#(<= 102 ~counter~0)} #98#return; {23774#(<= 102 ~counter~0)} is VALID [2022-04-07 14:02:32,442 INFO L290 TraceCheckUtils]: 162: Hoare triple {23774#(<= 102 ~counter~0)} assume !(~r~0 < 0); {23774#(<= 102 ~counter~0)} is VALID [2022-04-07 14:02:32,443 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-07 14:02:32,443 INFO L290 TraceCheckUtils]: 164: Hoare triple {23799#(<= 102 |main_#t~post6|)} assume !!(#t~post6 < 100);havoc #t~post6; {23303#false} is VALID [2022-04-07 14:02:32,443 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-07 14:02:32,443 INFO L290 TraceCheckUtils]: 166: Hoare triple {23303#false} ~cond := #in~cond; {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L290 TraceCheckUtils]: 167: Hoare triple {23303#false} assume !(0 == ~cond); {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L290 TraceCheckUtils]: 168: Hoare triple {23303#false} assume true; {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {23303#false} {23303#false} #94#return; {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L290 TraceCheckUtils]: 170: Hoare triple {23303#false} assume !!(0 != ~r~0); {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L290 TraceCheckUtils]: 171: Hoare triple {23303#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L290 TraceCheckUtils]: 172: Hoare triple {23303#false} assume !(#t~post7 < 100);havoc #t~post7; {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L290 TraceCheckUtils]: 173: Hoare triple {23303#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L290 TraceCheckUtils]: 174: Hoare triple {23303#false} assume !(#t~post8 < 100);havoc #t~post8; {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L290 TraceCheckUtils]: 175: Hoare triple {23303#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23303#false} is VALID [2022-04-07 14:02:32,443 INFO L290 TraceCheckUtils]: 176: Hoare triple {23303#false} assume !(#t~post6 < 100);havoc #t~post6; {23303#false} is VALID [2022-04-07 14:02:32,443 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-07 14:02:32,443 INFO L290 TraceCheckUtils]: 178: Hoare triple {23303#false} ~cond := #in~cond; {23303#false} is VALID [2022-04-07 14:02:32,444 INFO L290 TraceCheckUtils]: 179: Hoare triple {23303#false} assume 0 == ~cond; {23303#false} is VALID [2022-04-07 14:02:32,444 INFO L290 TraceCheckUtils]: 180: Hoare triple {23303#false} assume !false; {23303#false} is VALID [2022-04-07 14:02:32,444 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-07 14:02:32,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:32,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:32,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948335912] [2022-04-07 14:02:32,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:32,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767310538] [2022-04-07 14:02:32,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767310538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:32,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:32,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 14:02:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084804018] [2022-04-07 14:02:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:32,445 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-07 14:02:32,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:32,446 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-07 14:02:32,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-07 14:02:32,479 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 14:02:32,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 14:02:32,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 14:02:32,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-07 14:02:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:33,175 INFO L93 Difference]: Finished difference Result 1103 states and 1482 transitions. [2022-04-07 14:02:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 14:02:33,175 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-07 14:02:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:33,176 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-07 14:02:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-07 14:02:33,177 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-07 14:02:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-04-07 14:02:33,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2022-04-07 14:02:33,225 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-07 14:02:33,256 INFO L225 Difference]: With dead ends: 1103 [2022-04-07 14:02:33,256 INFO L226 Difference]: Without dead ends: 896 [2022-04-07 14:02:33,257 INFO L912 BasicCegarLoop]: 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-07 14:02:33,258 INFO L913 BasicCegarLoop]: 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-07 14:02:33,258 INFO L914 BasicCegarLoop]: 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-07 14:02:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-04-07 14:02:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 861. [2022-04-07 14:02:33,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:33,735 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-07 14:02:33,736 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-07 14:02:33,737 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-07 14:02:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:33,764 INFO L93 Difference]: Finished difference Result 896 states and 1170 transitions. [2022-04-07 14:02:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1170 transitions. [2022-04-07 14:02:33,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:33,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:33,767 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-07 14:02:33,767 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-07 14:02:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:33,795 INFO L93 Difference]: Finished difference Result 896 states and 1170 transitions. [2022-04-07 14:02:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1170 transitions. [2022-04-07 14:02:33,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:33,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:33,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:33,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:33,798 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-07 14:02:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1129 transitions. [2022-04-07 14:02:33,833 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1129 transitions. Word has length 181 [2022-04-07 14:02:33,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:33,833 INFO L478 AbstractCegarLoop]: Abstraction has 861 states and 1129 transitions. [2022-04-07 14:02:33,833 INFO L479 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-07 14:02:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1129 transitions. [2022-04-07 14:02:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:02:33,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:33,835 INFO L499 BasicCegarLoop]: 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-07 14:02:33,853 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-07 14:02:34,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-07 14:02:34,052 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:34,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1408642227, now seen corresponding path program 4 times [2022-04-07 14:02:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:34,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256670639] [2022-04-07 14:02:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:34,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:34,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83417084] [2022-04-07 14:02:34,075 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 14:02:34,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:34,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:34,076 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-07 14:02:34,076 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-07 14:02:34,149 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 14:02:34,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:02:34,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-07 14:02:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:34,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:34,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {28385#true} call ULTIMATE.init(); {28385#true} is VALID [2022-04-07 14:02:34,503 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-07 14:02:34,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28385#true} {28385#true} #102#return; {28385#true} is VALID [2022-04-07 14:02:34,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {28385#true} call #t~ret9 := main(); {28385#true} is VALID [2022-04-07 14:02:34,503 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-07 14:02:34,503 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-07 14:02:34,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {28385#true} {28385#true} #90#return; {28385#true} is VALID [2022-04-07 14:02:34,503 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-07 14:02:34,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {28385#true} {28385#true} #92#return; {28385#true} is VALID [2022-04-07 14:02:34,503 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-07 14:02:34,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {28385#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28385#true} is VALID [2022-04-07 14:02:34,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {28385#true} assume !!(#t~post6 < 100);havoc #t~post6; {28385#true} is VALID [2022-04-07 14:02:34,504 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-07 14:02:34,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {28385#true} {28385#true} #94#return; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {28385#true} assume !!(0 != ~r~0); {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {28385#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {28385#true} assume !!(#t~post7 < 100);havoc #t~post7; {28385#true} is VALID [2022-04-07 14:02:34,504 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-07 14:02:34,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {28385#true} {28385#true} #96#return; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {28385#true} assume !(~r~0 > 0); {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {28385#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {28385#true} assume !!(#t~post8 < 100);havoc #t~post8; {28385#true} is VALID [2022-04-07 14:02:34,504 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-07 14:02:34,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,504 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {28385#true} {28385#true} #98#return; {28385#true} is VALID [2022-04-07 14:02:34,505 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-07 14:02:34,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {28385#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {28385#true} assume !!(#t~post8 < 100);havoc #t~post8; {28385#true} is VALID [2022-04-07 14:02:34,505 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-07 14:02:34,505 INFO L290 TraceCheckUtils]: 44: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {28385#true} {28385#true} #98#return; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 48: Hoare triple {28385#true} assume !(~r~0 < 0); {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {28385#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {28385#true} assume !!(#t~post6 < 100);havoc #t~post6; {28385#true} is VALID [2022-04-07 14:02:34,505 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-07 14:02:34,505 INFO L290 TraceCheckUtils]: 52: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {28385#true} {28385#true} #94#return; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {28385#true} assume !!(0 != ~r~0); {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {28385#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {28385#true} assume !!(#t~post7 < 100);havoc #t~post7; {28385#true} is VALID [2022-04-07 14:02:34,505 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-07 14:02:34,505 INFO L290 TraceCheckUtils]: 60: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,505 INFO L290 TraceCheckUtils]: 61: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,506 INFO L290 TraceCheckUtils]: 62: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,506 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {28385#true} {28385#true} #96#return; {28385#true} is VALID [2022-04-07 14:02:34,506 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-07 14:02:34,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {28385#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28385#true} is VALID [2022-04-07 14:02:34,506 INFO L290 TraceCheckUtils]: 66: Hoare triple {28385#true} assume !!(#t~post7 < 100);havoc #t~post7; {28385#true} is VALID [2022-04-07 14:02:34,506 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-07 14:02:34,506 INFO L290 TraceCheckUtils]: 68: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,506 INFO L290 TraceCheckUtils]: 69: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,506 INFO L290 TraceCheckUtils]: 70: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,506 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {28385#true} {28385#true} #96#return; {28385#true} is VALID [2022-04-07 14:02:34,506 INFO L290 TraceCheckUtils]: 72: Hoare triple {28385#true} assume !(~r~0 > 0); {28606#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:02:34,506 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-07 14:02:34,507 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-07 14:02:34,507 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-07 14:02:34,507 INFO L290 TraceCheckUtils]: 76: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,507 INFO L290 TraceCheckUtils]: 77: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,507 INFO L290 TraceCheckUtils]: 78: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,507 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-07 14:02:34,508 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-07 14:02:34,508 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-07 14:02:34,508 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-07 14:02:34,508 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-07 14:02:34,508 INFO L290 TraceCheckUtils]: 84: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,509 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-07 14:02:34,509 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-07 14:02:34,509 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-07 14:02:34,510 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-07 14:02:34,510 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-07 14:02:34,510 INFO L290 TraceCheckUtils]: 92: Hoare triple {28385#true} ~cond := #in~cond; {28385#true} is VALID [2022-04-07 14:02:34,510 INFO L290 TraceCheckUtils]: 93: Hoare triple {28385#true} assume !(0 == ~cond); {28385#true} is VALID [2022-04-07 14:02:34,510 INFO L290 TraceCheckUtils]: 94: Hoare triple {28385#true} assume true; {28385#true} is VALID [2022-04-07 14:02:34,510 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-07 14:02:34,511 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-07 14:02:34,511 INFO L290 TraceCheckUtils]: 97: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {28386#false} assume !!(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,511 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-07 14:02:34,511 INFO L290 TraceCheckUtils]: 100: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 101: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 102: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 104: Hoare triple {28386#false} assume !(~r~0 > 0); {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 105: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 106: Hoare triple {28386#false} assume !!(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,511 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-07 14:02:34,511 INFO L290 TraceCheckUtils]: 108: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 109: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 110: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 112: Hoare triple {28386#false} assume !(~r~0 < 0); {28386#false} is VALID [2022-04-07 14:02:34,511 INFO L290 TraceCheckUtils]: 113: Hoare triple {28386#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L290 TraceCheckUtils]: 114: Hoare triple {28386#false} assume !!(#t~post6 < 100);havoc #t~post6; {28386#false} is VALID [2022-04-07 14:02:34,512 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-07 14:02:34,512 INFO L290 TraceCheckUtils]: 116: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L290 TraceCheckUtils]: 117: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L290 TraceCheckUtils]: 118: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {28386#false} {28386#false} #94#return; {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L290 TraceCheckUtils]: 120: Hoare triple {28386#false} assume !!(0 != ~r~0); {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L290 TraceCheckUtils]: 121: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L290 TraceCheckUtils]: 122: Hoare triple {28386#false} assume !!(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,512 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-07 14:02:34,512 INFO L290 TraceCheckUtils]: 124: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L290 TraceCheckUtils]: 125: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L290 TraceCheckUtils]: 126: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-07 14:02:34,512 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-07 14:02:34,512 INFO L290 TraceCheckUtils]: 129: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,512 INFO L290 TraceCheckUtils]: 130: Hoare triple {28386#false} assume !!(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,513 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-07 14:02:34,513 INFO L290 TraceCheckUtils]: 132: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 133: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 134: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 136: Hoare triple {28386#false} assume !(~r~0 > 0); {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 137: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 138: Hoare triple {28386#false} assume !!(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,513 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-07 14:02:34,513 INFO L290 TraceCheckUtils]: 140: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 141: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 142: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 144: Hoare triple {28386#false} assume !(~r~0 < 0); {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 145: Hoare triple {28386#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28386#false} is VALID [2022-04-07 14:02:34,513 INFO L290 TraceCheckUtils]: 146: Hoare triple {28386#false} assume !!(#t~post6 < 100);havoc #t~post6; {28386#false} is VALID [2022-04-07 14:02:34,513 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-07 14:02:34,514 INFO L290 TraceCheckUtils]: 148: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 149: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 150: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {28386#false} {28386#false} #94#return; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 152: Hoare triple {28386#false} assume !!(0 != ~r~0); {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 153: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 154: Hoare triple {28386#false} assume !!(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,514 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-07 14:02:34,514 INFO L290 TraceCheckUtils]: 156: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 157: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 158: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {28386#false} {28386#false} #96#return; {28386#false} is VALID [2022-04-07 14:02:34,514 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-07 14:02:34,514 INFO L290 TraceCheckUtils]: 161: Hoare triple {28386#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 162: Hoare triple {28386#false} assume !(#t~post7 < 100);havoc #t~post7; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 163: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 164: Hoare triple {28386#false} assume !!(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,514 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-07 14:02:34,514 INFO L290 TraceCheckUtils]: 166: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 167: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L290 TraceCheckUtils]: 168: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,514 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-07 14:02:34,515 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-07 14:02:34,515 INFO L290 TraceCheckUtils]: 171: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,515 INFO L290 TraceCheckUtils]: 172: Hoare triple {28386#false} assume !!(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,515 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-07 14:02:34,515 INFO L290 TraceCheckUtils]: 174: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,515 INFO L290 TraceCheckUtils]: 175: Hoare triple {28386#false} assume !(0 == ~cond); {28386#false} is VALID [2022-04-07 14:02:34,515 INFO L290 TraceCheckUtils]: 176: Hoare triple {28386#false} assume true; {28386#false} is VALID [2022-04-07 14:02:34,515 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {28386#false} {28386#false} #98#return; {28386#false} is VALID [2022-04-07 14:02:34,515 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-07 14:02:34,515 INFO L290 TraceCheckUtils]: 179: Hoare triple {28386#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,515 INFO L290 TraceCheckUtils]: 180: Hoare triple {28386#false} assume !(#t~post8 < 100);havoc #t~post8; {28386#false} is VALID [2022-04-07 14:02:34,515 INFO L290 TraceCheckUtils]: 181: Hoare triple {28386#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28386#false} is VALID [2022-04-07 14:02:34,515 INFO L290 TraceCheckUtils]: 182: Hoare triple {28386#false} assume !(#t~post6 < 100);havoc #t~post6; {28386#false} is VALID [2022-04-07 14:02:34,515 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-07 14:02:34,515 INFO L290 TraceCheckUtils]: 184: Hoare triple {28386#false} ~cond := #in~cond; {28386#false} is VALID [2022-04-07 14:02:34,515 INFO L290 TraceCheckUtils]: 185: Hoare triple {28386#false} assume 0 == ~cond; {28386#false} is VALID [2022-04-07 14:02:34,515 INFO L290 TraceCheckUtils]: 186: Hoare triple {28386#false} assume !false; {28386#false} is VALID [2022-04-07 14:02:34,516 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-07 14:02:34,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:34,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:34,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256670639] [2022-04-07 14:02:34,516 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:34,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83417084] [2022-04-07 14:02:34,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83417084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:34,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:34,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 14:02:34,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629775040] [2022-04-07 14:02:34,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:34,517 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-07 14:02:34,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:34,517 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-07 14:02:34,571 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-07 14:02:34,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 14:02:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:34,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 14:02:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 14:02:34,572 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-07 14:02:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:35,529 INFO L93 Difference]: Finished difference Result 1462 states and 1917 transitions. [2022-04-07 14:02:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 14:02:35,530 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-07 14:02:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:35,530 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-07 14:02:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-07 14:02:35,531 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-07 14:02:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-04-07 14:02:35,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-04-07 14:02:35,647 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-07 14:02:35,682 INFO L225 Difference]: With dead ends: 1462 [2022-04-07 14:02:35,682 INFO L226 Difference]: Without dead ends: 919 [2022-04-07 14:02:35,683 INFO L912 BasicCegarLoop]: 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-07 14:02:35,684 INFO L913 BasicCegarLoop]: 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-07 14:02:35,684 INFO L914 BasicCegarLoop]: 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-07 14:02:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2022-04-07 14:02:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 867. [2022-04-07 14:02:36,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:36,199 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-07 14:02:36,199 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-07 14:02:36,200 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-07 14:02:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:36,226 INFO L93 Difference]: Finished difference Result 919 states and 1203 transitions. [2022-04-07 14:02:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1203 transitions. [2022-04-07 14:02:36,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:36,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:36,229 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-07 14:02:36,230 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-07 14:02:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:36,256 INFO L93 Difference]: Finished difference Result 919 states and 1203 transitions. [2022-04-07 14:02:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1203 transitions. [2022-04-07 14:02:36,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:36,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:36,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:36,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:36,259 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-07 14:02:36,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1135 transitions. [2022-04-07 14:02:36,289 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1135 transitions. Word has length 187 [2022-04-07 14:02:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:36,289 INFO L478 AbstractCegarLoop]: Abstraction has 867 states and 1135 transitions. [2022-04-07 14:02:36,289 INFO L479 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-07 14:02:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1135 transitions. [2022-04-07 14:02:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:02:36,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:36,292 INFO L499 BasicCegarLoop]: 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-07 14:02:36,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-07 14:02:36,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-07 14:02:36,503 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:36,504 INFO L85 PathProgramCache]: Analyzing trace with hash -464040263, now seen corresponding path program 5 times [2022-04-07 14:02:36,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:36,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807990102] [2022-04-07 14:02:36,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:36,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:36,526 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:36,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501121189] [2022-04-07 14:02:36,526 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 14:02:36,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:36,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:36,527 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-07 14:02:36,528 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-07 14:02:36,861 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-04-07 14:02:36,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:02:36,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 14:02:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:36,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:37,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {34032#true} call ULTIMATE.init(); {34032#true} is VALID [2022-04-07 14:02:37,202 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-07 14:02:37,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34032#true} {34032#true} #102#return; {34032#true} is VALID [2022-04-07 14:02:37,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {34032#true} call #t~ret9 := main(); {34032#true} is VALID [2022-04-07 14:02:37,202 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-07 14:02:37,203 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-07 14:02:37,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34032#true} {34032#true} #90#return; {34032#true} is VALID [2022-04-07 14:02:37,203 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-07 14:02:37,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34032#true} {34032#true} #92#return; {34032#true} is VALID [2022-04-07 14:02:37,203 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-07 14:02:37,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {34032#true} assume !!(#t~post6 < 100);havoc #t~post6; {34032#true} is VALID [2022-04-07 14:02:37,203 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-07 14:02:37,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,204 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-07 14:02:37,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 29: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {34032#true} assume !(~r~0 > 0); {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,204 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-07 14:02:37,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-07 14:02:37,204 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-07 14:02:37,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,204 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-07 14:02:37,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-07 14:02:37,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {34032#true} assume !(~r~0 < 0); {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 50: Hoare triple {34032#true} assume !!(#t~post6 < 100);havoc #t~post6; {34032#true} is VALID [2022-04-07 14:02:37,205 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-07 14:02:37,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 56: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,205 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-07 14:02:37,205 INFO L290 TraceCheckUtils]: 60: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 61: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 62: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-07 14:02:37,205 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-07 14:02:37,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,205 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-07 14:02:37,205 INFO L290 TraceCheckUtils]: 68: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,205 INFO L290 TraceCheckUtils]: 69: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 70: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-07 14:02:37,206 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-07 14:02:37,206 INFO L290 TraceCheckUtils]: 73: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 74: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,206 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-07 14:02:37,206 INFO L290 TraceCheckUtils]: 76: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 77: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 78: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 80: Hoare triple {34032#true} assume !(~r~0 > 0); {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 81: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 82: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,206 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-07 14:02:37,206 INFO L290 TraceCheckUtils]: 84: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 85: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 86: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-07 14:02:37,206 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-07 14:02:37,206 INFO L290 TraceCheckUtils]: 89: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,206 INFO L290 TraceCheckUtils]: 90: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,206 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-07 14:02:37,207 INFO L290 TraceCheckUtils]: 92: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 93: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 94: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 96: Hoare triple {34032#true} assume !(~r~0 < 0); {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 97: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 98: Hoare triple {34032#true} assume !!(#t~post6 < 100);havoc #t~post6; {34032#true} is VALID [2022-04-07 14:02:37,207 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-07 14:02:37,207 INFO L290 TraceCheckUtils]: 100: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 101: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 102: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 104: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 105: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 106: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,207 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-07 14:02:37,207 INFO L290 TraceCheckUtils]: 108: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 109: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L290 TraceCheckUtils]: 110: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,207 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-07 14:02:37,207 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-07 14:02:37,207 INFO L290 TraceCheckUtils]: 113: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 114: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,208 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-07 14:02:37,208 INFO L290 TraceCheckUtils]: 116: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 117: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 118: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 120: Hoare triple {34032#true} assume !(~r~0 > 0); {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 121: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 122: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,208 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-07 14:02:37,208 INFO L290 TraceCheckUtils]: 124: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 125: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 126: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-07 14:02:37,208 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-07 14:02:37,208 INFO L290 TraceCheckUtils]: 129: Hoare triple {34032#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 130: Hoare triple {34032#true} assume !!(#t~post8 < 100);havoc #t~post8; {34032#true} is VALID [2022-04-07 14:02:37,208 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-07 14:02:37,208 INFO L290 TraceCheckUtils]: 132: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 133: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,208 INFO L290 TraceCheckUtils]: 134: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {34032#true} {34032#true} #98#return; {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 136: Hoare triple {34032#true} assume !(~r~0 < 0); {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 137: Hoare triple {34032#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 138: Hoare triple {34032#true} assume !!(#t~post6 < 100);havoc #t~post6; {34032#true} is VALID [2022-04-07 14:02:37,209 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-07 14:02:37,209 INFO L290 TraceCheckUtils]: 140: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 141: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 142: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {34032#true} {34032#true} #94#return; {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 144: Hoare triple {34032#true} assume !!(0 != ~r~0); {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 145: Hoare triple {34032#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 146: Hoare triple {34032#true} assume !!(#t~post7 < 100);havoc #t~post7; {34032#true} is VALID [2022-04-07 14:02:37,209 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-07 14:02:37,209 INFO L290 TraceCheckUtils]: 148: Hoare triple {34032#true} ~cond := #in~cond; {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 149: Hoare triple {34032#true} assume !(0 == ~cond); {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L290 TraceCheckUtils]: 150: Hoare triple {34032#true} assume true; {34032#true} is VALID [2022-04-07 14:02:37,209 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {34032#true} {34032#true} #96#return; {34032#true} is VALID [2022-04-07 14:02:37,209 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-07 14:02:37,210 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-07 14:02:37,210 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-07 14:02:37,211 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-07 14:02:37,211 INFO L290 TraceCheckUtils]: 156: Hoare triple {34504#(<= 101 |main_#t~post8|)} assume !!(#t~post8 < 100);havoc #t~post8; {34033#false} is VALID [2022-04-07 14:02:37,211 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-07 14:02:37,211 INFO L290 TraceCheckUtils]: 158: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-07 14:02:37,211 INFO L290 TraceCheckUtils]: 159: Hoare triple {34033#false} assume !(0 == ~cond); {34033#false} is VALID [2022-04-07 14:02:37,211 INFO L290 TraceCheckUtils]: 160: Hoare triple {34033#false} assume true; {34033#false} is VALID [2022-04-07 14:02:37,211 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {34033#false} {34033#false} #98#return; {34033#false} is VALID [2022-04-07 14:02:37,211 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-07 14:02:37,211 INFO L290 TraceCheckUtils]: 163: Hoare triple {34033#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L290 TraceCheckUtils]: 164: Hoare triple {34033#false} assume !!(#t~post8 < 100);havoc #t~post8; {34033#false} is VALID [2022-04-07 14:02:37,212 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-07 14:02:37,212 INFO L290 TraceCheckUtils]: 166: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L290 TraceCheckUtils]: 167: Hoare triple {34033#false} assume !(0 == ~cond); {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L290 TraceCheckUtils]: 168: Hoare triple {34033#false} assume true; {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L284 TraceCheckUtils]: 169: Hoare quadruple {34033#false} {34033#false} #98#return; {34033#false} is VALID [2022-04-07 14:02:37,212 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-07 14:02:37,212 INFO L290 TraceCheckUtils]: 171: Hoare triple {34033#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L290 TraceCheckUtils]: 172: Hoare triple {34033#false} assume !!(#t~post8 < 100);havoc #t~post8; {34033#false} is VALID [2022-04-07 14:02:37,212 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-07 14:02:37,212 INFO L290 TraceCheckUtils]: 174: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L290 TraceCheckUtils]: 175: Hoare triple {34033#false} assume !(0 == ~cond); {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L290 TraceCheckUtils]: 176: Hoare triple {34033#false} assume true; {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L284 TraceCheckUtils]: 177: Hoare quadruple {34033#false} {34033#false} #98#return; {34033#false} is VALID [2022-04-07 14:02:37,212 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-07 14:02:37,212 INFO L290 TraceCheckUtils]: 179: Hoare triple {34033#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L290 TraceCheckUtils]: 180: Hoare triple {34033#false} assume !(#t~post8 < 100);havoc #t~post8; {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L290 TraceCheckUtils]: 181: Hoare triple {34033#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34033#false} is VALID [2022-04-07 14:02:37,212 INFO L290 TraceCheckUtils]: 182: Hoare triple {34033#false} assume !(#t~post6 < 100);havoc #t~post6; {34033#false} is VALID [2022-04-07 14:02:37,212 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-07 14:02:37,212 INFO L290 TraceCheckUtils]: 184: Hoare triple {34033#false} ~cond := #in~cond; {34033#false} is VALID [2022-04-07 14:02:37,213 INFO L290 TraceCheckUtils]: 185: Hoare triple {34033#false} assume 0 == ~cond; {34033#false} is VALID [2022-04-07 14:02:37,213 INFO L290 TraceCheckUtils]: 186: Hoare triple {34033#false} assume !false; {34033#false} is VALID [2022-04-07 14:02:37,213 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-07 14:02:37,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:37,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:37,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807990102] [2022-04-07 14:02:37,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:37,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501121189] [2022-04-07 14:02:37,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501121189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:37,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:37,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 14:02:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945584138] [2022-04-07 14:02:37,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:37,214 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-07 14:02:37,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:37,214 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-07 14:02:37,253 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-07 14:02:37,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 14:02:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:37,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 14:02:37,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 14:02:37,254 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-07 14:02:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:37,845 INFO L93 Difference]: Finished difference Result 887 states and 1154 transitions. [2022-04-07 14:02:37,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 14:02:37,846 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-07 14:02:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:37,846 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-07 14:02:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 14:02:37,847 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-07 14:02:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 14:02:37,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 14:02:37,881 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-07 14:02:37,911 INFO L225 Difference]: With dead ends: 887 [2022-04-07 14:02:37,911 INFO L226 Difference]: Without dead ends: 831 [2022-04-07 14:02:37,911 INFO L912 BasicCegarLoop]: 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-07 14:02:37,912 INFO L913 BasicCegarLoop]: 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-07 14:02:37,912 INFO L914 BasicCegarLoop]: 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-07 14:02:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-04-07 14:02:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 806. [2022-04-07 14:02:38,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:38,380 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-07 14:02:38,381 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-07 14:02:38,382 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-07 14:02:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:38,403 INFO L93 Difference]: Finished difference Result 831 states and 1088 transitions. [2022-04-07 14:02:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1088 transitions. [2022-04-07 14:02:38,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:38,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:38,406 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-07 14:02:38,407 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-07 14:02:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:38,428 INFO L93 Difference]: Finished difference Result 831 states and 1088 transitions. [2022-04-07 14:02:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1088 transitions. [2022-04-07 14:02:38,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:38,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:38,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:38,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:38,431 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-07 14:02:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1058 transitions. [2022-04-07 14:02:38,456 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1058 transitions. Word has length 187 [2022-04-07 14:02:38,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:38,457 INFO L478 AbstractCegarLoop]: Abstraction has 806 states and 1058 transitions. [2022-04-07 14:02:38,457 INFO L479 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-07 14:02:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1058 transitions. [2022-04-07 14:02:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:02:38,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:38,459 INFO L499 BasicCegarLoop]: 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-07 14:02:38,468 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-07 14:02:38,664 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-07 14:02:38,664 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:38,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash 372440269, now seen corresponding path program 6 times [2022-04-07 14:02:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:38,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775990638] [2022-04-07 14:02:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:38,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:38,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435766273] [2022-04-07 14:02:38,682 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-07 14:02:38,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:38,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:38,683 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-07 14:02:38,685 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-07 14:02:38,856 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-07 14:02:38,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:02:38,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 14:02:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:38,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:39,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {38618#true} call ULTIMATE.init(); {38618#true} is VALID [2022-04-07 14:02:39,249 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-07 14:02:39,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38618#true} {38618#true} #102#return; {38618#true} is VALID [2022-04-07 14:02:39,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {38618#true} call #t~ret9 := main(); {38618#true} is VALID [2022-04-07 14:02:39,249 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-07 14:02:39,249 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-07 14:02:39,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,249 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38618#true} {38618#true} #90#return; {38618#true} is VALID [2022-04-07 14:02:39,249 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-07 14:02:39,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,249 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38618#true} {38618#true} #92#return; {38618#true} is VALID [2022-04-07 14:02:39,249 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-07 14:02:39,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-07 14:02:39,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {38618#true} assume !!(#t~post6 < 100);havoc #t~post6; {38618#true} is VALID [2022-04-07 14:02:39,250 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-07 14:02:39,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,250 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-07 14:02:39,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {38618#true} assume !(~r~0 > 0); {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,250 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-07 14:02:39,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,250 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-07 14:02:39,251 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-07 14:02:39,251 INFO L290 TraceCheckUtils]: 41: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 42: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,251 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-07 14:02:39,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {38618#true} assume !(~r~0 < 0); {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 50: Hoare triple {38618#true} assume !!(#t~post6 < 100);havoc #t~post6; {38618#true} is VALID [2022-04-07 14:02:39,251 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-07 14:02:39,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,251 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-07 14:02:39,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L290 TraceCheckUtils]: 62: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-07 14:02:39,252 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-07 14:02:39,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,252 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-07 14:02:39,252 INFO L290 TraceCheckUtils]: 68: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L290 TraceCheckUtils]: 69: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-07 14:02:39,252 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-07 14:02:39,252 INFO L290 TraceCheckUtils]: 73: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L290 TraceCheckUtils]: 74: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,252 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-07 14:02:39,252 INFO L290 TraceCheckUtils]: 76: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L290 TraceCheckUtils]: 77: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L290 TraceCheckUtils]: 78: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-07 14:02:39,252 INFO L290 TraceCheckUtils]: 80: Hoare triple {38618#true} assume !(~r~0 > 0); {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 81: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 82: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,253 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-07 14:02:39,253 INFO L290 TraceCheckUtils]: 84: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 85: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 86: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-07 14:02:39,253 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-07 14:02:39,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 90: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,253 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-07 14:02:39,253 INFO L290 TraceCheckUtils]: 92: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 93: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 94: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 96: Hoare triple {38618#true} assume !(~r~0 < 0); {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 97: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-07 14:02:39,253 INFO L290 TraceCheckUtils]: 98: Hoare triple {38618#true} assume !!(#t~post6 < 100);havoc #t~post6; {38618#true} is VALID [2022-04-07 14:02:39,253 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-07 14:02:39,253 INFO L290 TraceCheckUtils]: 100: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 101: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 102: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 104: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 105: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 106: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,254 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-07 14:02:39,254 INFO L290 TraceCheckUtils]: 108: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 109: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 110: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-07 14:02:39,254 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-07 14:02:39,254 INFO L290 TraceCheckUtils]: 113: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 114: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,254 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-07 14:02:39,254 INFO L290 TraceCheckUtils]: 116: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 117: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 118: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 120: Hoare triple {38618#true} assume !(~r~0 > 0); {38618#true} is VALID [2022-04-07 14:02:39,254 INFO L290 TraceCheckUtils]: 121: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 122: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,255 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-07 14:02:39,255 INFO L290 TraceCheckUtils]: 124: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 125: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 126: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-07 14:02:39,255 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-07 14:02:39,255 INFO L290 TraceCheckUtils]: 129: Hoare triple {38618#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 130: Hoare triple {38618#true} assume !!(#t~post8 < 100);havoc #t~post8; {38618#true} is VALID [2022-04-07 14:02:39,255 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-07 14:02:39,255 INFO L290 TraceCheckUtils]: 132: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 133: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 134: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {38618#true} {38618#true} #98#return; {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 136: Hoare triple {38618#true} assume !(~r~0 < 0); {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 137: Hoare triple {38618#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 138: Hoare triple {38618#true} assume !!(#t~post6 < 100);havoc #t~post6; {38618#true} is VALID [2022-04-07 14:02:39,255 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-07 14:02:39,255 INFO L290 TraceCheckUtils]: 140: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,255 INFO L290 TraceCheckUtils]: 141: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L290 TraceCheckUtils]: 142: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {38618#true} {38618#true} #94#return; {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L290 TraceCheckUtils]: 144: Hoare triple {38618#true} assume !!(0 != ~r~0); {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L290 TraceCheckUtils]: 145: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L290 TraceCheckUtils]: 146: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,256 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-07 14:02:39,256 INFO L290 TraceCheckUtils]: 148: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L290 TraceCheckUtils]: 149: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L290 TraceCheckUtils]: 150: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-07 14:02:39,256 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-07 14:02:39,256 INFO L290 TraceCheckUtils]: 153: Hoare triple {38618#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L290 TraceCheckUtils]: 154: Hoare triple {38618#true} assume !!(#t~post7 < 100);havoc #t~post7; {38618#true} is VALID [2022-04-07 14:02:39,256 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-07 14:02:39,256 INFO L290 TraceCheckUtils]: 156: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L290 TraceCheckUtils]: 157: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L290 TraceCheckUtils]: 158: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,256 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {38618#true} {38618#true} #96#return; {38618#true} is VALID [2022-04-07 14:02:39,263 INFO L290 TraceCheckUtils]: 160: Hoare triple {38618#true} assume !(~r~0 > 0); {39103#(not (< 0 main_~r~0))} is VALID [2022-04-07 14:02:39,263 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-07 14:02:39,264 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-07 14:02:39,264 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-07 14:02:39,264 INFO L290 TraceCheckUtils]: 164: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,264 INFO L290 TraceCheckUtils]: 165: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,264 INFO L290 TraceCheckUtils]: 166: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,264 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-07 14:02:39,265 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-07 14:02:39,265 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-07 14:02:39,265 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-07 14:02:39,266 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-07 14:02:39,266 INFO L290 TraceCheckUtils]: 172: Hoare triple {38618#true} ~cond := #in~cond; {38618#true} is VALID [2022-04-07 14:02:39,266 INFO L290 TraceCheckUtils]: 173: Hoare triple {38618#true} assume !(0 == ~cond); {38618#true} is VALID [2022-04-07 14:02:39,266 INFO L290 TraceCheckUtils]: 174: Hoare triple {38618#true} assume true; {38618#true} is VALID [2022-04-07 14:02:39,266 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-07 14:02:39,266 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-07 14:02:39,266 INFO L290 TraceCheckUtils]: 177: Hoare triple {38619#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38619#false} is VALID [2022-04-07 14:02:39,266 INFO L290 TraceCheckUtils]: 178: Hoare triple {38619#false} assume !(#t~post7 < 100);havoc #t~post7; {38619#false} is VALID [2022-04-07 14:02:39,267 INFO L290 TraceCheckUtils]: 179: Hoare triple {38619#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38619#false} is VALID [2022-04-07 14:02:39,267 INFO L290 TraceCheckUtils]: 180: Hoare triple {38619#false} assume !(#t~post8 < 100);havoc #t~post8; {38619#false} is VALID [2022-04-07 14:02:39,267 INFO L290 TraceCheckUtils]: 181: Hoare triple {38619#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38619#false} is VALID [2022-04-07 14:02:39,267 INFO L290 TraceCheckUtils]: 182: Hoare triple {38619#false} assume !(#t~post6 < 100);havoc #t~post6; {38619#false} is VALID [2022-04-07 14:02:39,267 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-07 14:02:39,267 INFO L290 TraceCheckUtils]: 184: Hoare triple {38619#false} ~cond := #in~cond; {38619#false} is VALID [2022-04-07 14:02:39,267 INFO L290 TraceCheckUtils]: 185: Hoare triple {38619#false} assume 0 == ~cond; {38619#false} is VALID [2022-04-07 14:02:39,267 INFO L290 TraceCheckUtils]: 186: Hoare triple {38619#false} assume !false; {38619#false} is VALID [2022-04-07 14:02:39,267 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-07 14:02:39,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 14:02:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:39,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775990638] [2022-04-07 14:02:39,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:39,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435766273] [2022-04-07 14:02:39,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435766273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 14:02:39,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 14:02:39,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 14:02:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948026856] [2022-04-07 14:02:39,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 14:02:39,269 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-07 14:02:39,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:39,269 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-07 14:02:39,303 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-07 14:02:39,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 14:02:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:39,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 14:02:39,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-07 14:02:39,303 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-07 14:02:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:39,909 INFO L93 Difference]: Finished difference Result 853 states and 1107 transitions. [2022-04-07 14:02:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 14:02:39,909 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-07 14:02:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:39,909 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-07 14:02:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-07 14:02:39,910 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-07 14:02:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-07 14:02:39,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-07 14:02:39,963 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-07 14:02:39,987 INFO L225 Difference]: With dead ends: 853 [2022-04-07 14:02:39,988 INFO L226 Difference]: Without dead ends: 782 [2022-04-07 14:02:39,988 INFO L912 BasicCegarLoop]: 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-07 14:02:39,988 INFO L913 BasicCegarLoop]: 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-07 14:02:39,988 INFO L914 BasicCegarLoop]: 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-07 14:02:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-04-07 14:02:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 755. [2022-04-07 14:02:40,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:40,469 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-07 14:02:40,469 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-07 14:02:40,470 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-07 14:02:40,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:40,489 INFO L93 Difference]: Finished difference Result 782 states and 1016 transitions. [2022-04-07 14:02:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1016 transitions. [2022-04-07 14:02:40,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:40,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:40,491 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-07 14:02:40,493 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-07 14:02:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:40,513 INFO L93 Difference]: Finished difference Result 782 states and 1016 transitions. [2022-04-07 14:02:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1016 transitions. [2022-04-07 14:02:40,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:40,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:40,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:40,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:40,515 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-07 14:02:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 984 transitions. [2022-04-07 14:02:40,537 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 984 transitions. Word has length 187 [2022-04-07 14:02:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:40,537 INFO L478 AbstractCegarLoop]: Abstraction has 755 states and 984 transitions. [2022-04-07 14:02:40,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-07 14:02:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 984 transitions. [2022-04-07 14:02:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:02:40,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:40,540 INFO L499 BasicCegarLoop]: 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-07 14:02:40,546 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-07 14:02:40,744 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-07 14:02:40,744 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash -288806385, now seen corresponding path program 7 times [2022-04-07 14:02:40,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:40,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132096978] [2022-04-07 14:02:40,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:40,769 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:40,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [95973664] [2022-04-07 14:02:40,769 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-07 14:02:40,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:40,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:40,776 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-07 14:02:40,794 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-07 14:02:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:40,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 14:02:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:40,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:41,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {42989#true} call ULTIMATE.init(); {42989#true} is VALID [2022-04-07 14:02:41,416 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-07 14:02:41,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42989#true} {42989#true} #102#return; {42989#true} is VALID [2022-04-07 14:02:41,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {42989#true} call #t~ret9 := main(); {42989#true} is VALID [2022-04-07 14:02:41,416 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-07 14:02:41,416 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-07 14:02:41,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,416 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42989#true} {42989#true} #90#return; {42989#true} is VALID [2022-04-07 14:02:41,416 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-07 14:02:41,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,416 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42989#true} {42989#true} #92#return; {42989#true} is VALID [2022-04-07 14:02:41,417 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-07 14:02:41,417 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-07 14:02:41,417 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-07 14:02:41,417 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-07 14:02:41,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,418 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,418 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-07 14:02:41,419 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-07 14:02:41,419 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-07 14:02:41,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,419 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 > 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,420 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-07 14:02:41,420 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-07 14:02:41,420 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-07 14:02:41,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,421 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,432 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-07 14:02:41,432 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-07 14:02:41,432 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-07 14:02:41,432 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-07 14:02:41,432 INFO L290 TraceCheckUtils]: 44: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,432 INFO L290 TraceCheckUtils]: 45: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,433 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 < 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,434 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-07 14:02:41,434 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-07 14:02:41,434 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-07 14:02:41,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,435 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,436 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-07 14:02:41,436 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-07 14:02:41,436 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-07 14:02:41,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,437 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:41,437 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-07 14:02:41,438 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-07 14:02:41,438 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-07 14:02:41,438 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-07 14:02:41,438 INFO L290 TraceCheckUtils]: 68: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,438 INFO L290 TraceCheckUtils]: 69: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,438 INFO L290 TraceCheckUtils]: 70: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,439 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42989#true} {43187#(<= main_~v~0 3)} #96#return; {43187#(<= main_~v~0 3)} is VALID [2022-04-07 14:02:41,439 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-07 14:02:41,439 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-07 14:02:41,440 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-07 14:02:41,440 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-07 14:02:41,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,440 INFO L290 TraceCheckUtils]: 77: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,440 INFO L290 TraceCheckUtils]: 78: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,442 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-07 14:02:41,442 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-07 14:02:41,442 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-07 14:02:41,443 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-07 14:02:41,443 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-07 14:02:41,443 INFO L290 TraceCheckUtils]: 84: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,443 INFO L290 TraceCheckUtils]: 85: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,443 INFO L290 TraceCheckUtils]: 86: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,443 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-07 14:02:41,444 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-07 14:02:41,444 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-07 14:02:41,445 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-07 14:02:41,445 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-07 14:02:41,445 INFO L290 TraceCheckUtils]: 92: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,445 INFO L290 TraceCheckUtils]: 93: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,445 INFO L290 TraceCheckUtils]: 94: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,445 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-07 14:02:41,445 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-07 14:02:41,446 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-07 14:02:41,446 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-07 14:02:41,446 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-07 14:02:41,446 INFO L290 TraceCheckUtils]: 100: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,446 INFO L290 TraceCheckUtils]: 101: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,446 INFO L290 TraceCheckUtils]: 102: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,452 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-07 14:02:41,452 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-07 14:02:41,452 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-07 14:02:41,453 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-07 14:02:41,453 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-07 14:02:41,453 INFO L290 TraceCheckUtils]: 108: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,453 INFO L290 TraceCheckUtils]: 109: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,453 INFO L290 TraceCheckUtils]: 110: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,453 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-07 14:02:41,454 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-07 14:02:41,454 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-07 14:02:41,455 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-07 14:02:41,455 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-07 14:02:41,455 INFO L290 TraceCheckUtils]: 116: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,455 INFO L290 TraceCheckUtils]: 117: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,455 INFO L290 TraceCheckUtils]: 118: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,455 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-07 14:02:41,456 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-07 14:02:41,456 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-07 14:02:41,456 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-07 14:02:41,456 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-07 14:02:41,456 INFO L290 TraceCheckUtils]: 124: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,456 INFO L290 TraceCheckUtils]: 125: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,456 INFO L290 TraceCheckUtils]: 126: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,457 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-07 14:02:41,457 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-07 14:02:41,458 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-07 14:02:41,458 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-07 14:02:41,458 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-07 14:02:41,458 INFO L290 TraceCheckUtils]: 132: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,458 INFO L290 TraceCheckUtils]: 133: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,458 INFO L290 TraceCheckUtils]: 134: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,458 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-07 14:02:41,459 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-07 14:02:41,459 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-07 14:02:41,459 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-07 14:02:41,459 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-07 14:02:41,459 INFO L290 TraceCheckUtils]: 140: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,459 INFO L290 TraceCheckUtils]: 141: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,459 INFO L290 TraceCheckUtils]: 142: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,460 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-07 14:02:41,460 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-07 14:02:41,460 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-07 14:02:41,461 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-07 14:02:41,461 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-07 14:02:41,461 INFO L290 TraceCheckUtils]: 148: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,461 INFO L290 TraceCheckUtils]: 149: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,461 INFO L290 TraceCheckUtils]: 150: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,461 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-07 14:02:41,462 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-07 14:02:41,462 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-07 14:02:41,462 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-07 14:02:41,462 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-07 14:02:41,462 INFO L290 TraceCheckUtils]: 156: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:41,462 INFO L290 TraceCheckUtils]: 157: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:41,462 INFO L290 TraceCheckUtils]: 158: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:41,463 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {42989#true} {43456#(< main_~r~0 1)} #96#return; {43456#(< main_~r~0 1)} is VALID [2022-04-07 14:02:41,463 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-07 14:02:41,463 INFO L290 TraceCheckUtils]: 161: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-07 14:02:41,463 INFO L290 TraceCheckUtils]: 162: Hoare triple {42990#false} assume !!(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-07 14:02:41,463 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-07 14:02:41,463 INFO L290 TraceCheckUtils]: 164: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-07 14:02:41,463 INFO L290 TraceCheckUtils]: 165: Hoare triple {42990#false} assume !(0 == ~cond); {42990#false} is VALID [2022-04-07 14:02:41,463 INFO L290 TraceCheckUtils]: 166: Hoare triple {42990#false} assume true; {42990#false} is VALID [2022-04-07 14:02:41,463 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {42990#false} {42990#false} #96#return; {42990#false} is VALID [2022-04-07 14:02:41,464 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-07 14:02:41,464 INFO L290 TraceCheckUtils]: 169: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 170: Hoare triple {42990#false} assume !!(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-07 14:02:41,464 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-07 14:02:41,464 INFO L290 TraceCheckUtils]: 172: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 173: Hoare triple {42990#false} assume !(0 == ~cond); {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 174: Hoare triple {42990#false} assume true; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {42990#false} {42990#false} #96#return; {42990#false} is VALID [2022-04-07 14:02:41,464 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-07 14:02:41,464 INFO L290 TraceCheckUtils]: 177: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 178: Hoare triple {42990#false} assume !(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 179: Hoare triple {42990#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 180: Hoare triple {42990#false} assume !(#t~post8 < 100);havoc #t~post8; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 181: Hoare triple {42990#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 182: Hoare triple {42990#false} assume !(#t~post6 < 100);havoc #t~post6; {42990#false} is VALID [2022-04-07 14:02:41,464 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-07 14:02:41,464 INFO L290 TraceCheckUtils]: 184: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 185: Hoare triple {42990#false} assume 0 == ~cond; {42990#false} is VALID [2022-04-07 14:02:41,464 INFO L290 TraceCheckUtils]: 186: Hoare triple {42990#false} assume !false; {42990#false} is VALID [2022-04-07 14:02:41,465 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-07 14:02:41,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:42,037 INFO L290 TraceCheckUtils]: 186: Hoare triple {42990#false} assume !false; {42990#false} is VALID [2022-04-07 14:02:42,037 INFO L290 TraceCheckUtils]: 185: Hoare triple {42990#false} assume 0 == ~cond; {42990#false} is VALID [2022-04-07 14:02:42,037 INFO L290 TraceCheckUtils]: 184: Hoare triple {42990#false} ~cond := #in~cond; {42990#false} is VALID [2022-04-07 14:02:42,037 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-07 14:02:42,037 INFO L290 TraceCheckUtils]: 182: Hoare triple {42990#false} assume !(#t~post6 < 100);havoc #t~post6; {42990#false} is VALID [2022-04-07 14:02:42,037 INFO L290 TraceCheckUtils]: 181: Hoare triple {42990#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {42990#false} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 180: Hoare triple {42990#false} assume !(#t~post8 < 100);havoc #t~post8; {42990#false} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 179: Hoare triple {42990#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {42990#false} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 178: Hoare triple {42990#false} assume !(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 177: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-07 14:02:42,038 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-07 14:02:42,038 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {42989#true} {42990#false} #96#return; {42990#false} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 174: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 173: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 172: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,038 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-07 14:02:42,038 INFO L290 TraceCheckUtils]: 170: Hoare triple {42990#false} assume !!(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 169: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-07 14:02:42,038 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-07 14:02:42,038 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {42989#true} {42990#false} #96#return; {42990#false} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 166: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 165: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 164: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,038 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-07 14:02:42,038 INFO L290 TraceCheckUtils]: 162: Hoare triple {42990#false} assume !!(#t~post7 < 100);havoc #t~post7; {42990#false} is VALID [2022-04-07 14:02:42,038 INFO L290 TraceCheckUtils]: 161: Hoare triple {42990#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {42990#false} is VALID [2022-04-07 14:02:42,039 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-07 14:02:42,040 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {42989#true} {43456#(< main_~r~0 1)} #96#return; {43456#(< main_~r~0 1)} is VALID [2022-04-07 14:02:42,040 INFO L290 TraceCheckUtils]: 158: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,040 INFO L290 TraceCheckUtils]: 157: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,040 INFO L290 TraceCheckUtils]: 156: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,040 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-07 14:02:42,040 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-07 14:02:42,040 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-07 14:02:42,041 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-07 14:02:42,042 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-07 14:02:42,042 INFO L290 TraceCheckUtils]: 150: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,042 INFO L290 TraceCheckUtils]: 149: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,042 INFO L290 TraceCheckUtils]: 148: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,042 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-07 14:02:42,042 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-07 14:02:42,042 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-07 14:02:42,042 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-07 14:02:42,043 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-07 14:02:42,043 INFO L290 TraceCheckUtils]: 142: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,043 INFO L290 TraceCheckUtils]: 141: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,043 INFO L290 TraceCheckUtils]: 140: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,043 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-07 14:02:42,043 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-07 14:02:42,044 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-07 14:02:42,044 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-07 14:02:42,044 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-07 14:02:42,044 INFO L290 TraceCheckUtils]: 134: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,044 INFO L290 TraceCheckUtils]: 133: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,044 INFO L290 TraceCheckUtils]: 132: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,044 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-07 14:02:42,045 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-07 14:02:42,045 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-07 14:02:42,045 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-07 14:02:42,046 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-07 14:02:42,046 INFO L290 TraceCheckUtils]: 126: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,046 INFO L290 TraceCheckUtils]: 125: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,046 INFO L290 TraceCheckUtils]: 124: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,046 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-07 14:02:42,046 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-07 14:02:42,047 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-07 14:02:42,047 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-07 14:02:42,047 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-07 14:02:42,047 INFO L290 TraceCheckUtils]: 118: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,047 INFO L290 TraceCheckUtils]: 117: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,047 INFO L290 TraceCheckUtils]: 116: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,047 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-07 14:02:42,048 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-07 14:02:42,048 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-07 14:02:42,048 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-07 14:02:42,049 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-07 14:02:42,049 INFO L290 TraceCheckUtils]: 110: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,049 INFO L290 TraceCheckUtils]: 109: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,049 INFO L290 TraceCheckUtils]: 108: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,049 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-07 14:02:42,049 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-07 14:02:42,049 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-07 14:02:42,050 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-07 14:02:42,050 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-07 14:02:42,050 INFO L290 TraceCheckUtils]: 102: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,050 INFO L290 TraceCheckUtils]: 101: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,050 INFO L290 TraceCheckUtils]: 100: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,050 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-07 14:02:42,051 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-07 14:02:42,051 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-07 14:02:42,051 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-07 14:02:42,051 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-07 14:02:42,051 INFO L290 TraceCheckUtils]: 94: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,052 INFO L290 TraceCheckUtils]: 93: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,052 INFO L290 TraceCheckUtils]: 92: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,052 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-07 14:02:42,052 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-07 14:02:42,052 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-07 14:02:42,053 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-07 14:02:42,053 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-07 14:02:42,053 INFO L290 TraceCheckUtils]: 86: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,053 INFO L290 TraceCheckUtils]: 85: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,053 INFO L290 TraceCheckUtils]: 84: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,053 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-07 14:02:42,053 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-07 14:02:42,054 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-07 14:02:42,054 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-07 14:02:42,054 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-07 14:02:42,054 INFO L290 TraceCheckUtils]: 78: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,055 INFO L290 TraceCheckUtils]: 77: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,055 INFO L290 TraceCheckUtils]: 76: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,055 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-07 14:02:42,055 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-07 14:02:42,055 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-07 14:02:42,056 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-07 14:02:42,056 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {42989#true} {43187#(<= main_~v~0 3)} #96#return; {43187#(<= main_~v~0 3)} is VALID [2022-04-07 14:02:42,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,056 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-07 14:02:42,056 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-07 14:02:42,057 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-07 14:02:42,057 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-07 14:02:42,057 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,058 INFO L290 TraceCheckUtils]: 60: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,058 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-07 14:02:42,058 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-07 14:02:42,058 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-07 14:02:42,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,059 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,059 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-07 14:02:42,059 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-07 14:02:42,059 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-07 14:02:42,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 < 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,060 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,060 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-07 14:02:42,060 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-07 14:02:42,061 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-07 14:02:42,061 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-07 14:02:42,061 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #98#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,061 INFO L290 TraceCheckUtils]: 38: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,061 INFO L290 TraceCheckUtils]: 37: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,061 INFO L290 TraceCheckUtils]: 36: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,061 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-07 14:02:42,062 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-07 14:02:42,062 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-07 14:02:42,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {43042#(<= main_~v~0 1)} assume !(~r~0 > 0); {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,063 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #96#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,063 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-07 14:02:42,063 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-07 14:02:42,063 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-07 14:02:42,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {43042#(<= main_~v~0 1)} assume !!(0 != ~r~0); {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,064 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {42989#true} {43042#(<= main_~v~0 1)} #94#return; {43042#(<= main_~v~0 1)} is VALID [2022-04-07 14:02:42,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,064 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-07 14:02:42,064 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-07 14:02:42,065 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-07 14:02:42,065 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-07 14:02:42,065 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42989#true} {42989#true} #92#return; {42989#true} is VALID [2022-04-07 14:02:42,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,065 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-07 14:02:42,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42989#true} {42989#true} #90#return; {42989#true} is VALID [2022-04-07 14:02:42,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {42989#true} assume !(0 == ~cond); {42989#true} is VALID [2022-04-07 14:02:42,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {42989#true} ~cond := #in~cond; {42989#true} is VALID [2022-04-07 14:02:42,065 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-07 14:02:42,065 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-07 14:02:42,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {42989#true} call #t~ret9 := main(); {42989#true} is VALID [2022-04-07 14:02:42,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42989#true} {42989#true} #102#return; {42989#true} is VALID [2022-04-07 14:02:42,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {42989#true} assume true; {42989#true} is VALID [2022-04-07 14:02:42,066 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-07 14:02:42,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {42989#true} call ULTIMATE.init(); {42989#true} is VALID [2022-04-07 14:02:42,066 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-07 14:02:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:42,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132096978] [2022-04-07 14:02:42,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:42,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95973664] [2022-04-07 14:02:42,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95973664] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:42,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:42,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2022-04-07 14:02:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749085917] [2022-04-07 14:02:42,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:42,067 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-07 14:02:42,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:42,068 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-07 14:02:42,152 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-07 14:02:42,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 14:02:42,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 14:02:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-07 14:02:42,153 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-07 14:02:46,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:46,131 INFO L93 Difference]: Finished difference Result 1720 states and 2275 transitions. [2022-04-07 14:02:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-07 14:02:46,131 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-07 14:02:46,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:46,132 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-07 14:02:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-07 14:02:46,136 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-07 14:02:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 430 transitions. [2022-04-07 14:02:46,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 430 transitions. [2022-04-07 14:02:46,447 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-07 14:02:46,529 INFO L225 Difference]: With dead ends: 1720 [2022-04-07 14:02:46,529 INFO L226 Difference]: Without dead ends: 1523 [2022-04-07 14:02:46,530 INFO L912 BasicCegarLoop]: 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-07 14:02:46,530 INFO L913 BasicCegarLoop]: 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-07 14:02:46,530 INFO L914 BasicCegarLoop]: 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-07 14:02:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2022-04-07 14:02:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1314. [2022-04-07 14:02:47,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:47,763 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-07 14:02:47,764 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-07 14:02:47,764 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-07 14:02:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:47,824 INFO L93 Difference]: Finished difference Result 1523 states and 2012 transitions. [2022-04-07 14:02:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2012 transitions. [2022-04-07 14:02:47,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:47,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:47,829 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-07 14:02:47,829 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-07 14:02:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:47,890 INFO L93 Difference]: Finished difference Result 1523 states and 2012 transitions. [2022-04-07 14:02:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 2012 transitions. [2022-04-07 14:02:47,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:47,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:47,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:47,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:47,895 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-07 14:02:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1767 transitions. [2022-04-07 14:02:47,973 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1767 transitions. Word has length 187 [2022-04-07 14:02:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:47,973 INFO L478 AbstractCegarLoop]: Abstraction has 1314 states and 1767 transitions. [2022-04-07 14:02:47,974 INFO L479 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-07 14:02:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1767 transitions. [2022-04-07 14:02:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:02:47,977 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:47,977 INFO L499 BasicCegarLoop]: 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-07 14:02:47,993 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-07 14:02:48,190 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:48,190 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -719610275, now seen corresponding path program 8 times [2022-04-07 14:02:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:48,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928215820] [2022-04-07 14:02:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:48,209 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:48,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384066363] [2022-04-07 14:02:48,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:02:48,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:48,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:48,210 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-07 14:02:48,210 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-07 14:02:48,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:02:48,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:02:48,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 14:02:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:02:48,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:02:48,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {51455#true} call ULTIMATE.init(); {51455#true} is VALID [2022-04-07 14:02:48,904 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-07 14:02:48,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51455#true} {51455#true} #102#return; {51455#true} is VALID [2022-04-07 14:02:48,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {51455#true} call #t~ret9 := main(); {51455#true} is VALID [2022-04-07 14:02:48,904 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-07 14:02:48,904 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-07 14:02:48,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51455#true} {51455#true} #90#return; {51455#true} is VALID [2022-04-07 14:02:48,905 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-07 14:02:48,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51455#true} {51455#true} #92#return; {51455#true} is VALID [2022-04-07 14:02:48,905 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-07 14:02:48,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {51455#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {51455#true} assume !!(#t~post6 < 100);havoc #t~post6; {51455#true} is VALID [2022-04-07 14:02:48,905 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-07 14:02:48,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51455#true} {51455#true} #94#return; {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {51455#true} assume !!(0 != ~r~0); {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {51455#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51455#true} is VALID [2022-04-07 14:02:48,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {51455#true} assume !!(#t~post7 < 100);havoc #t~post7; {51455#true} is VALID [2022-04-07 14:02:48,905 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-07 14:02:48,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,906 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51455#true} {51455#true} #96#return; {51455#true} is VALID [2022-04-07 14:02:48,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {51455#true} assume !(~r~0 > 0); {51455#true} is VALID [2022-04-07 14:02:48,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {51455#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51455#true} is VALID [2022-04-07 14:02:48,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {51455#true} assume !!(#t~post8 < 100);havoc #t~post8; {51455#true} is VALID [2022-04-07 14:02:48,906 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-07 14:02:48,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,906 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51455#true} {51455#true} #98#return; {51455#true} is VALID [2022-04-07 14:02:48,907 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-07 14:02:48,907 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-07 14:02:48,907 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-07 14:02:48,907 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-07 14:02:48,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,908 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-07 14:02:48,908 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-07 14:02:48,908 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-07 14:02:48,909 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-07 14:02:48,909 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-07 14:02:48,909 INFO L290 TraceCheckUtils]: 52: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,909 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-07 14:02:48,910 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-07 14:02:48,910 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-07 14:02:48,910 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-07 14:02:48,910 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-07 14:02:48,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,911 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-07 14:02:48,911 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-07 14:02:48,912 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-07 14:02:48,912 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-07 14:02:48,912 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-07 14:02:48,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,912 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-07 14:02:48,913 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-07 14:02:48,913 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-07 14:02:48,914 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-07 14:02:48,914 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-07 14:02:48,914 INFO L290 TraceCheckUtils]: 76: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,914 INFO L290 TraceCheckUtils]: 77: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,914 INFO L290 TraceCheckUtils]: 78: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,914 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-07 14:02:48,914 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-07 14:02:48,915 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-07 14:02:48,915 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-07 14:02:48,915 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-07 14:02:48,915 INFO L290 TraceCheckUtils]: 84: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,915 INFO L290 TraceCheckUtils]: 85: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,915 INFO L290 TraceCheckUtils]: 86: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,916 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-07 14:02:48,916 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-07 14:02:48,917 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-07 14:02:48,917 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-07 14:02:48,917 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-07 14:02:48,917 INFO L290 TraceCheckUtils]: 92: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,917 INFO L290 TraceCheckUtils]: 93: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,917 INFO L290 TraceCheckUtils]: 94: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,917 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-07 14:02:48,918 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-07 14:02:48,918 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-07 14:02:48,918 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-07 14:02:48,918 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-07 14:02:48,919 INFO L290 TraceCheckUtils]: 100: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,919 INFO L290 TraceCheckUtils]: 101: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,919 INFO L290 TraceCheckUtils]: 102: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,919 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-07 14:02:48,919 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-07 14:02:48,920 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-07 14:02:48,920 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-07 14:02:48,920 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-07 14:02:48,920 INFO L290 TraceCheckUtils]: 108: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,920 INFO L290 TraceCheckUtils]: 109: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,920 INFO L290 TraceCheckUtils]: 110: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,921 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-07 14:02:48,921 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-07 14:02:48,921 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-07 14:02:48,922 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-07 14:02:48,922 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-07 14:02:48,922 INFO L290 TraceCheckUtils]: 116: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,922 INFO L290 TraceCheckUtils]: 117: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,922 INFO L290 TraceCheckUtils]: 118: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,922 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-07 14:02:48,922 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-07 14:02:48,923 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-07 14:02:48,923 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-07 14:02:48,923 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-07 14:02:48,923 INFO L290 TraceCheckUtils]: 124: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,923 INFO L290 TraceCheckUtils]: 125: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,923 INFO L290 TraceCheckUtils]: 126: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,923 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-07 14:02:48,924 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-07 14:02:48,924 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-07 14:02:48,924 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-07 14:02:48,924 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-07 14:02:48,924 INFO L290 TraceCheckUtils]: 132: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:48,924 INFO L290 TraceCheckUtils]: 133: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:48,925 INFO L290 TraceCheckUtils]: 134: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:48,925 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {51455#true} {51849#(< 4 main_~r~0)} #98#return; {51849#(< 4 main_~r~0)} is VALID [2022-04-07 14:02:48,925 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-07 14:02:48,925 INFO L290 TraceCheckUtils]: 137: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 138: Hoare triple {51456#false} assume !!(#t~post8 < 100);havoc #t~post8; {51456#false} is VALID [2022-04-07 14:02:48,926 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-07 14:02:48,926 INFO L290 TraceCheckUtils]: 140: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 141: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 142: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {51456#false} {51456#false} #98#return; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 144: Hoare triple {51456#false} assume !(~r~0 < 0); {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 145: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 146: Hoare triple {51456#false} assume !!(#t~post6 < 100);havoc #t~post6; {51456#false} is VALID [2022-04-07 14:02:48,926 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-07 14:02:48,926 INFO L290 TraceCheckUtils]: 148: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 149: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 150: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {51456#false} {51456#false} #94#return; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 152: Hoare triple {51456#false} assume !!(0 != ~r~0); {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 153: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 154: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-07 14:02:48,926 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-07 14:02:48,926 INFO L290 TraceCheckUtils]: 156: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 157: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L290 TraceCheckUtils]: 158: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-07 14:02:48,926 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {51456#false} {51456#false} #96#return; {51456#false} is VALID [2022-04-07 14:02:48,927 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-07 14:02:48,927 INFO L290 TraceCheckUtils]: 161: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 162: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-07 14:02:48,927 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-07 14:02:48,927 INFO L290 TraceCheckUtils]: 164: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 165: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 166: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {51456#false} {51456#false} #96#return; {51456#false} is VALID [2022-04-07 14:02:48,927 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-07 14:02:48,927 INFO L290 TraceCheckUtils]: 169: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 170: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-07 14:02:48,927 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-07 14:02:48,927 INFO L290 TraceCheckUtils]: 172: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 173: Hoare triple {51456#false} assume !(0 == ~cond); {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 174: Hoare triple {51456#false} assume true; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {51456#false} {51456#false} #96#return; {51456#false} is VALID [2022-04-07 14:02:48,927 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-07 14:02:48,927 INFO L290 TraceCheckUtils]: 177: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 178: Hoare triple {51456#false} assume !(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 179: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 180: Hoare triple {51456#false} assume !(#t~post8 < 100);havoc #t~post8; {51456#false} is VALID [2022-04-07 14:02:48,927 INFO L290 TraceCheckUtils]: 181: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-07 14:02:48,928 INFO L290 TraceCheckUtils]: 182: Hoare triple {51456#false} assume !(#t~post6 < 100);havoc #t~post6; {51456#false} is VALID [2022-04-07 14:02:48,928 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-07 14:02:48,928 INFO L290 TraceCheckUtils]: 184: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-07 14:02:48,928 INFO L290 TraceCheckUtils]: 185: Hoare triple {51456#false} assume 0 == ~cond; {51456#false} is VALID [2022-04-07 14:02:48,928 INFO L290 TraceCheckUtils]: 186: Hoare triple {51456#false} assume !false; {51456#false} is VALID [2022-04-07 14:02:48,928 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-07 14:02:48,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:02:49,530 INFO L290 TraceCheckUtils]: 186: Hoare triple {51456#false} assume !false; {51456#false} is VALID [2022-04-07 14:02:49,530 INFO L290 TraceCheckUtils]: 185: Hoare triple {51456#false} assume 0 == ~cond; {51456#false} is VALID [2022-04-07 14:02:49,530 INFO L290 TraceCheckUtils]: 184: Hoare triple {51456#false} ~cond := #in~cond; {51456#false} is VALID [2022-04-07 14:02:49,530 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-07 14:02:49,530 INFO L290 TraceCheckUtils]: 182: Hoare triple {51456#false} assume !(#t~post6 < 100);havoc #t~post6; {51456#false} is VALID [2022-04-07 14:02:49,530 INFO L290 TraceCheckUtils]: 181: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-07 14:02:49,530 INFO L290 TraceCheckUtils]: 180: Hoare triple {51456#false} assume !(#t~post8 < 100);havoc #t~post8; {51456#false} is VALID [2022-04-07 14:02:49,530 INFO L290 TraceCheckUtils]: 179: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 178: Hoare triple {51456#false} assume !(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 177: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-07 14:02:49,531 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-07 14:02:49,531 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {51455#true} {51456#false} #96#return; {51456#false} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 174: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 173: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 172: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,531 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-07 14:02:49,531 INFO L290 TraceCheckUtils]: 170: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 169: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-07 14:02:49,531 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-07 14:02:49,531 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {51455#true} {51456#false} #96#return; {51456#false} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 166: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 165: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 164: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,531 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-07 14:02:49,531 INFO L290 TraceCheckUtils]: 162: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 161: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-07 14:02:49,531 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-07 14:02:49,531 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {51455#true} {51456#false} #96#return; {51456#false} is VALID [2022-04-07 14:02:49,531 INFO L290 TraceCheckUtils]: 158: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 157: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 156: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,532 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-07 14:02:49,532 INFO L290 TraceCheckUtils]: 154: Hoare triple {51456#false} assume !!(#t~post7 < 100);havoc #t~post7; {51456#false} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 153: Hoare triple {51456#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51456#false} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 152: Hoare triple {51456#false} assume !!(0 != ~r~0); {51456#false} is VALID [2022-04-07 14:02:49,532 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {51455#true} {51456#false} #94#return; {51456#false} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 150: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 149: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 148: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,532 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-07 14:02:49,532 INFO L290 TraceCheckUtils]: 146: Hoare triple {51456#false} assume !!(#t~post6 < 100);havoc #t~post6; {51456#false} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 145: Hoare triple {51456#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51456#false} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 144: Hoare triple {51456#false} assume !(~r~0 < 0); {51456#false} is VALID [2022-04-07 14:02:49,532 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {51455#true} {51456#false} #98#return; {51456#false} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 142: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 141: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 140: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,532 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-07 14:02:49,532 INFO L290 TraceCheckUtils]: 138: Hoare triple {51456#false} assume !!(#t~post8 < 100);havoc #t~post8; {51456#false} is VALID [2022-04-07 14:02:49,532 INFO L290 TraceCheckUtils]: 137: Hoare triple {51456#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51456#false} is VALID [2022-04-07 14:02:49,533 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-07 14:02:49,533 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-07 14:02:49,533 INFO L290 TraceCheckUtils]: 134: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,533 INFO L290 TraceCheckUtils]: 133: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,533 INFO L290 TraceCheckUtils]: 132: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,533 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-07 14:02:49,534 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-07 14:02:49,534 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-07 14:02:49,534 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-07 14:02:49,535 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-07 14:02:49,535 INFO L290 TraceCheckUtils]: 126: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,535 INFO L290 TraceCheckUtils]: 125: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,535 INFO L290 TraceCheckUtils]: 124: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,535 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-07 14:02:49,535 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-07 14:02:49,535 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-07 14:02:49,536 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-07 14:02:49,536 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-07 14:02:49,536 INFO L290 TraceCheckUtils]: 118: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,536 INFO L290 TraceCheckUtils]: 117: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,536 INFO L290 TraceCheckUtils]: 116: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,536 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-07 14:02:49,536 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-07 14:02:49,537 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-07 14:02:49,537 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-07 14:02:49,538 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-07 14:02:49,538 INFO L290 TraceCheckUtils]: 110: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,538 INFO L290 TraceCheckUtils]: 109: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,538 INFO L290 TraceCheckUtils]: 108: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,538 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-07 14:02:49,538 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-07 14:02:49,538 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-07 14:02:49,539 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-07 14:02:49,539 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-07 14:02:49,539 INFO L290 TraceCheckUtils]: 102: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,539 INFO L290 TraceCheckUtils]: 101: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,539 INFO L290 TraceCheckUtils]: 100: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,539 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-07 14:02:49,539 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-07 14:02:49,540 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-07 14:02:49,540 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-07 14:02:49,540 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-07 14:02:49,540 INFO L290 TraceCheckUtils]: 94: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,540 INFO L290 TraceCheckUtils]: 93: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,540 INFO L290 TraceCheckUtils]: 92: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,541 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-07 14:02:49,541 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-07 14:02:49,541 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-07 14:02:49,541 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-07 14:02:49,542 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-07 14:02:49,542 INFO L290 TraceCheckUtils]: 86: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,542 INFO L290 TraceCheckUtils]: 85: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,542 INFO L290 TraceCheckUtils]: 84: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,542 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-07 14:02:49,542 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-07 14:02:49,543 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-07 14:02:49,543 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-07 14:02:49,543 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-07 14:02:49,544 INFO L290 TraceCheckUtils]: 78: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,544 INFO L290 TraceCheckUtils]: 77: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,544 INFO L290 TraceCheckUtils]: 76: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,544 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-07 14:02:49,544 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-07 14:02:49,544 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-07 14:02:49,545 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-07 14:02:49,545 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-07 14:02:49,545 INFO L290 TraceCheckUtils]: 70: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,545 INFO L290 TraceCheckUtils]: 69: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,545 INFO L290 TraceCheckUtils]: 68: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,545 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-07 14:02:49,546 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-07 14:02:49,546 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-07 14:02:49,547 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-07 14:02:49,547 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-07 14:02:49,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,548 INFO L290 TraceCheckUtils]: 60: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,548 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-07 14:02:49,548 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-07 14:02:49,548 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-07 14:02:49,548 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-07 14:02:49,549 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-07 14:02:49,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,549 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-07 14:02:49,549 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-07 14:02:49,549 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-07 14:02:49,550 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-07 14:02:49,550 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-07 14:02:49,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,550 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-07 14:02:49,550 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-07 14:02:49,551 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-07 14:02:49,551 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-07 14:02:49,551 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {51455#true} {51455#true} #98#return; {51455#true} is VALID [2022-04-07 14:02:49,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,552 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-07 14:02:49,552 INFO L290 TraceCheckUtils]: 34: Hoare triple {51455#true} assume !!(#t~post8 < 100);havoc #t~post8; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {51455#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {51455#true} assume !(~r~0 > 0); {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {51455#true} {51455#true} #96#return; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,552 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-07 14:02:49,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {51455#true} assume !!(#t~post7 < 100);havoc #t~post7; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {51455#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {51455#true} assume !!(0 != ~r~0); {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {51455#true} {51455#true} #94#return; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,552 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-07 14:02:49,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {51455#true} assume !!(#t~post6 < 100);havoc #t~post6; {51455#true} is VALID [2022-04-07 14:02:49,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {51455#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {51455#true} is VALID [2022-04-07 14:02:49,552 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-07 14:02:49,552 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {51455#true} {51455#true} #92#return; {51455#true} is VALID [2022-04-07 14:02:49,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,553 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-07 14:02:49,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51455#true} {51455#true} #90#return; {51455#true} is VALID [2022-04-07 14:02:49,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {51455#true} assume !(0 == ~cond); {51455#true} is VALID [2022-04-07 14:02:49,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {51455#true} ~cond := #in~cond; {51455#true} is VALID [2022-04-07 14:02:49,553 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-07 14:02:49,553 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-07 14:02:49,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {51455#true} call #t~ret9 := main(); {51455#true} is VALID [2022-04-07 14:02:49,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51455#true} {51455#true} #102#return; {51455#true} is VALID [2022-04-07 14:02:49,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {51455#true} assume true; {51455#true} is VALID [2022-04-07 14:02:49,553 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-07 14:02:49,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {51455#true} call ULTIMATE.init(); {51455#true} is VALID [2022-04-07 14:02:49,554 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-07 14:02:49,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:02:49,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928215820] [2022-04-07 14:02:49,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:02:49,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384066363] [2022-04-07 14:02:49,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384066363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:02:49,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:02:49,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 14:02:49,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978256848] [2022-04-07 14:02:49,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:02:49,555 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-07 14:02:49,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:02:49,556 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-07 14:02:49,689 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-07 14:02:49,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 14:02:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:02:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 14:02:49,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-07 14:02:49,690 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-07 14:02:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:56,250 INFO L93 Difference]: Finished difference Result 2714 states and 3675 transitions. [2022-04-07 14:02:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 14:02:56,250 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-07 14:02:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:02:56,251 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-07 14:02:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-07 14:02:56,255 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-07 14:02:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 442 transitions. [2022-04-07 14:02:56,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 442 transitions. [2022-04-07 14:02:56,614 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-07 14:02:56,827 INFO L225 Difference]: With dead ends: 2714 [2022-04-07 14:02:56,827 INFO L226 Difference]: Without dead ends: 2417 [2022-04-07 14:02:56,828 INFO L912 BasicCegarLoop]: 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-07 14:02:56,828 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 182 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-04-07 14:02:56,828 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 969 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-07 14:02:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-04-07 14:02:59,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1968. [2022-04-07 14:02:59,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:02:59,168 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-07 14:02:59,169 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-07 14:02:59,170 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-07 14:02:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:59,334 INFO L93 Difference]: Finished difference Result 2417 states and 3221 transitions. [2022-04-07 14:02:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3221 transitions. [2022-04-07 14:02:59,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:59,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:59,339 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-07 14:02:59,340 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-07 14:02:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:02:59,496 INFO L93 Difference]: Finished difference Result 2417 states and 3221 transitions. [2022-04-07 14:02:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 3221 transitions. [2022-04-07 14:02:59,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:02:59,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:02:59,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:02:59,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:02:59,501 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-07 14:02:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 2649 transitions. [2022-04-07 14:02:59,648 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 2649 transitions. Word has length 187 [2022-04-07 14:02:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:02:59,648 INFO L478 AbstractCegarLoop]: Abstraction has 1968 states and 2649 transitions. [2022-04-07 14:02:59,648 INFO L479 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-07 14:02:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2649 transitions. [2022-04-07 14:02:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:02:59,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:02:59,652 INFO L499 BasicCegarLoop]: 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-07 14:02:59,668 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-07 14:02:59,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:59,867 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:02:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:02:59,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1188230671, now seen corresponding path program 9 times [2022-04-07 14:02:59,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:02:59,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612708366] [2022-04-07 14:02:59,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:02:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:02:59,884 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:02:59,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037178475] [2022-04-07 14:02:59,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 14:02:59,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:02:59,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:02:59,885 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-07 14:02:59,886 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-07 14:03:00,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-04-07 14:03:00,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:00,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-07 14:03:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:00,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:01,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {64085#true} call ULTIMATE.init(); {64085#true} is VALID [2022-04-07 14:03:01,387 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-07 14:03:01,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64085#true} {64085#true} #102#return; {64085#true} is VALID [2022-04-07 14:03:01,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {64085#true} call #t~ret9 := main(); {64085#true} is VALID [2022-04-07 14:03:01,388 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-07 14:03:01,388 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-07 14:03:01,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,388 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {64085#true} {64085#true} #90#return; {64085#true} is VALID [2022-04-07 14:03:01,388 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-07 14:03:01,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,388 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {64085#true} {64085#true} #92#return; {64085#true} is VALID [2022-04-07 14:03:01,388 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-07 14:03:01,389 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-07 14:03:01,389 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-07 14:03:01,389 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-07 14:03:01,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,390 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,390 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-07 14:03:01,390 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-07 14:03:01,390 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-07 14:03:01,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,391 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 > 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,391 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-07 14:03:01,392 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-07 14:03:01,392 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-07 14:03:01,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,392 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,392 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-07 14:03:01,393 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-07 14:03:01,393 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-07 14:03:01,393 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-07 14:03:01,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,393 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 < 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,394 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-07 14:03:01,394 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-07 14:03:01,394 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-07 14:03:01,394 INFO L290 TraceCheckUtils]: 52: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,395 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,395 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-07 14:03:01,395 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-07 14:03:01,395 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-07 14:03:01,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,396 INFO L290 TraceCheckUtils]: 61: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,396 INFO L290 TraceCheckUtils]: 62: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,396 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:01,396 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-07 14:03:01,397 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-07 14:03:01,397 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-07 14:03:01,397 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-07 14:03:01,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,397 INFO L290 TraceCheckUtils]: 70: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,398 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {64085#true} {64283#(<= main_~v~0 3)} #96#return; {64283#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:01,398 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-07 14:03:01,398 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-07 14:03:01,399 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-07 14:03:01,399 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-07 14:03:01,399 INFO L290 TraceCheckUtils]: 76: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,399 INFO L290 TraceCheckUtils]: 77: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,399 INFO L290 TraceCheckUtils]: 78: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,399 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-07 14:03:01,400 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-07 14:03:01,400 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-07 14:03:01,400 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-07 14:03:01,400 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-07 14:03:01,400 INFO L290 TraceCheckUtils]: 84: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,400 INFO L290 TraceCheckUtils]: 85: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,400 INFO L290 TraceCheckUtils]: 86: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,401 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-07 14:03:01,402 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-07 14:03:01,402 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-07 14:03:01,402 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-07 14:03:01,402 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-07 14:03:01,402 INFO L290 TraceCheckUtils]: 92: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,402 INFO L290 TraceCheckUtils]: 93: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,402 INFO L290 TraceCheckUtils]: 94: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,403 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-07 14:03:01,403 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-07 14:03:01,403 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-07 14:03:01,404 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-07 14:03:01,404 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-07 14:03:01,404 INFO L290 TraceCheckUtils]: 100: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,404 INFO L290 TraceCheckUtils]: 101: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,404 INFO L290 TraceCheckUtils]: 102: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,404 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-07 14:03:01,405 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-07 14:03:01,405 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-07 14:03:01,405 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-07 14:03:01,405 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-07 14:03:01,405 INFO L290 TraceCheckUtils]: 108: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,405 INFO L290 TraceCheckUtils]: 109: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,405 INFO L290 TraceCheckUtils]: 110: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,406 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-07 14:03:01,407 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-07 14:03:01,407 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-07 14:03:01,407 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-07 14:03:01,407 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-07 14:03:01,407 INFO L290 TraceCheckUtils]: 116: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,407 INFO L290 TraceCheckUtils]: 117: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,407 INFO L290 TraceCheckUtils]: 118: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,408 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-07 14:03:01,408 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-07 14:03:01,409 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-07 14:03:01,409 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-07 14:03:01,409 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-07 14:03:01,409 INFO L290 TraceCheckUtils]: 124: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,409 INFO L290 TraceCheckUtils]: 125: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,409 INFO L290 TraceCheckUtils]: 126: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,409 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-07 14:03:01,410 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-07 14:03:01,410 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-07 14:03:01,410 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-07 14:03:01,410 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-07 14:03:01,410 INFO L290 TraceCheckUtils]: 132: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,411 INFO L290 TraceCheckUtils]: 133: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,411 INFO L290 TraceCheckUtils]: 134: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,411 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-07 14:03:01,412 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-07 14:03:01,412 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-07 14:03:01,412 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-07 14:03:01,412 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-07 14:03:01,412 INFO L290 TraceCheckUtils]: 140: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,412 INFO L290 TraceCheckUtils]: 141: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,412 INFO L290 TraceCheckUtils]: 142: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,413 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-07 14:03:01,413 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-07 14:03:01,413 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-07 14:03:01,414 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-07 14:03:01,414 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-07 14:03:01,414 INFO L290 TraceCheckUtils]: 148: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,414 INFO L290 TraceCheckUtils]: 149: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,414 INFO L290 TraceCheckUtils]: 150: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,414 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-07 14:03:01,415 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-07 14:03:01,415 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-07 14:03:01,415 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-07 14:03:01,415 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-07 14:03:01,415 INFO L290 TraceCheckUtils]: 156: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,415 INFO L290 TraceCheckUtils]: 157: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,416 INFO L290 TraceCheckUtils]: 158: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,416 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-07 14:03:01,417 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-07 14:03:01,417 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-07 14:03:01,417 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-07 14:03:01,417 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-07 14:03:01,417 INFO L290 TraceCheckUtils]: 164: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,417 INFO L290 TraceCheckUtils]: 165: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,417 INFO L290 TraceCheckUtils]: 166: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,418 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-07 14:03:01,418 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-07 14:03:01,418 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-07 14:03:01,419 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-07 14:03:01,419 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-07 14:03:01,419 INFO L290 TraceCheckUtils]: 172: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:01,419 INFO L290 TraceCheckUtils]: 173: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:01,419 INFO L290 TraceCheckUtils]: 174: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:01,419 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {64085#true} {64602#(< main_~r~0 0)} #96#return; {64602#(< main_~r~0 0)} is VALID [2022-04-07 14:03:01,420 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-07 14:03:01,420 INFO L290 TraceCheckUtils]: 177: Hoare triple {64086#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64086#false} is VALID [2022-04-07 14:03:01,420 INFO L290 TraceCheckUtils]: 178: Hoare triple {64086#false} assume !(#t~post7 < 100);havoc #t~post7; {64086#false} is VALID [2022-04-07 14:03:01,420 INFO L290 TraceCheckUtils]: 179: Hoare triple {64086#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64086#false} is VALID [2022-04-07 14:03:01,420 INFO L290 TraceCheckUtils]: 180: Hoare triple {64086#false} assume !(#t~post8 < 100);havoc #t~post8; {64086#false} is VALID [2022-04-07 14:03:01,420 INFO L290 TraceCheckUtils]: 181: Hoare triple {64086#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64086#false} is VALID [2022-04-07 14:03:01,420 INFO L290 TraceCheckUtils]: 182: Hoare triple {64086#false} assume !(#t~post6 < 100);havoc #t~post6; {64086#false} is VALID [2022-04-07 14:03:01,420 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-07 14:03:01,420 INFO L290 TraceCheckUtils]: 184: Hoare triple {64086#false} ~cond := #in~cond; {64086#false} is VALID [2022-04-07 14:03:01,420 INFO L290 TraceCheckUtils]: 185: Hoare triple {64086#false} assume 0 == ~cond; {64086#false} is VALID [2022-04-07 14:03:01,420 INFO L290 TraceCheckUtils]: 186: Hoare triple {64086#false} assume !false; {64086#false} is VALID [2022-04-07 14:03:01,421 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-07 14:03:01,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:02,440 INFO L290 TraceCheckUtils]: 186: Hoare triple {64086#false} assume !false; {64086#false} is VALID [2022-04-07 14:03:02,440 INFO L290 TraceCheckUtils]: 185: Hoare triple {64086#false} assume 0 == ~cond; {64086#false} is VALID [2022-04-07 14:03:02,440 INFO L290 TraceCheckUtils]: 184: Hoare triple {64086#false} ~cond := #in~cond; {64086#false} is VALID [2022-04-07 14:03:02,440 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-07 14:03:02,440 INFO L290 TraceCheckUtils]: 182: Hoare triple {64086#false} assume !(#t~post6 < 100);havoc #t~post6; {64086#false} is VALID [2022-04-07 14:03:02,440 INFO L290 TraceCheckUtils]: 181: Hoare triple {64086#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {64086#false} is VALID [2022-04-07 14:03:02,440 INFO L290 TraceCheckUtils]: 180: Hoare triple {64086#false} assume !(#t~post8 < 100);havoc #t~post8; {64086#false} is VALID [2022-04-07 14:03:02,440 INFO L290 TraceCheckUtils]: 179: Hoare triple {64086#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {64086#false} is VALID [2022-04-07 14:03:02,440 INFO L290 TraceCheckUtils]: 178: Hoare triple {64086#false} assume !(#t~post7 < 100);havoc #t~post7; {64086#false} is VALID [2022-04-07 14:03:02,440 INFO L290 TraceCheckUtils]: 177: Hoare triple {64086#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {64086#false} is VALID [2022-04-07 14:03:02,441 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-07 14:03:02,441 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-07 14:03:02,441 INFO L290 TraceCheckUtils]: 174: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,441 INFO L290 TraceCheckUtils]: 173: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,441 INFO L290 TraceCheckUtils]: 172: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,442 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-07 14:03:02,442 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-07 14:03:02,442 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-07 14:03:02,443 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-07 14:03:02,443 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-07 14:03:02,443 INFO L290 TraceCheckUtils]: 166: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,443 INFO L290 TraceCheckUtils]: 165: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,443 INFO L290 TraceCheckUtils]: 164: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,444 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-07 14:03:02,444 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-07 14:03:02,444 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-07 14:03:02,445 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-07 14:03:02,445 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-07 14:03:02,445 INFO L290 TraceCheckUtils]: 158: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,445 INFO L290 TraceCheckUtils]: 157: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,445 INFO L290 TraceCheckUtils]: 156: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,445 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-07 14:03:02,446 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-07 14:03:02,446 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-07 14:03:02,446 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-07 14:03:02,447 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-07 14:03:02,447 INFO L290 TraceCheckUtils]: 150: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,447 INFO L290 TraceCheckUtils]: 149: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,447 INFO L290 TraceCheckUtils]: 148: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,447 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-07 14:03:02,447 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-07 14:03:02,448 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-07 14:03:02,448 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-07 14:03:02,448 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-07 14:03:02,448 INFO L290 TraceCheckUtils]: 142: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,448 INFO L290 TraceCheckUtils]: 141: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,449 INFO L290 TraceCheckUtils]: 140: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,449 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-07 14:03:02,449 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-07 14:03:02,449 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-07 14:03:02,451 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-07 14:03:02,451 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-07 14:03:02,451 INFO L290 TraceCheckUtils]: 134: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,451 INFO L290 TraceCheckUtils]: 133: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,451 INFO L290 TraceCheckUtils]: 132: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,451 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-07 14:03:02,452 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-07 14:03:02,452 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-07 14:03:02,452 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-07 14:03:02,453 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-07 14:03:02,453 INFO L290 TraceCheckUtils]: 126: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,453 INFO L290 TraceCheckUtils]: 125: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,453 INFO L290 TraceCheckUtils]: 124: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,453 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-07 14:03:02,453 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-07 14:03:02,454 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-07 14:03:02,454 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-07 14:03:02,455 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-07 14:03:02,455 INFO L290 TraceCheckUtils]: 118: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,455 INFO L290 TraceCheckUtils]: 117: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,455 INFO L290 TraceCheckUtils]: 116: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,455 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-07 14:03:02,455 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-07 14:03:02,455 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-07 14:03:02,456 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-07 14:03:02,456 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-07 14:03:02,457 INFO L290 TraceCheckUtils]: 110: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,457 INFO L290 TraceCheckUtils]: 109: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,457 INFO L290 TraceCheckUtils]: 108: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,457 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-07 14:03:02,457 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-07 14:03:02,457 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-07 14:03:02,458 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-07 14:03:02,458 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-07 14:03:02,458 INFO L290 TraceCheckUtils]: 102: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,458 INFO L290 TraceCheckUtils]: 101: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,458 INFO L290 TraceCheckUtils]: 100: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,458 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-07 14:03:02,459 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-07 14:03:02,459 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-07 14:03:02,459 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-07 14:03:02,460 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-07 14:03:02,460 INFO L290 TraceCheckUtils]: 94: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,460 INFO L290 TraceCheckUtils]: 93: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,460 INFO L290 TraceCheckUtils]: 92: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,460 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-07 14:03:02,461 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-07 14:03:02,461 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-07 14:03:02,462 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-07 14:03:02,462 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-07 14:03:02,462 INFO L290 TraceCheckUtils]: 86: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,462 INFO L290 TraceCheckUtils]: 85: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,462 INFO L290 TraceCheckUtils]: 84: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,463 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-07 14:03:02,463 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-07 14:03:02,463 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-07 14:03:02,463 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-07 14:03:02,464 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-07 14:03:02,464 INFO L290 TraceCheckUtils]: 78: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,464 INFO L290 TraceCheckUtils]: 77: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,464 INFO L290 TraceCheckUtils]: 76: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,464 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-07 14:03:02,464 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-07 14:03:02,464 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-07 14:03:02,465 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-07 14:03:02,465 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {64085#true} {64283#(<= main_~v~0 3)} #96#return; {64283#(<= main_~v~0 3)} is VALID [2022-04-07 14:03:02,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,466 INFO L290 TraceCheckUtils]: 69: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,466 INFO L290 TraceCheckUtils]: 68: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,466 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-07 14:03:02,466 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-07 14:03:02,466 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-07 14:03:02,467 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-07 14:03:02,467 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,468 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-07 14:03:02,468 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-07 14:03:02,468 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-07 14:03:02,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,469 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,469 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-07 14:03:02,469 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-07 14:03:02,469 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-07 14:03:02,470 INFO L290 TraceCheckUtils]: 48: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 < 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,470 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,470 INFO L290 TraceCheckUtils]: 46: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,470 INFO L290 TraceCheckUtils]: 45: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,470 INFO L290 TraceCheckUtils]: 44: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,470 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-07 14:03:02,470 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-07 14:03:02,471 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-07 14:03:02,471 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-07 14:03:02,471 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #98#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,471 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-07 14:03:02,472 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-07 14:03:02,472 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-07 14:03:02,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {64138#(<= main_~v~0 1)} assume !(~r~0 > 0); {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,473 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #96#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,473 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-07 14:03:02,473 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-07 14:03:02,473 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-07 14:03:02,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {64138#(<= main_~v~0 1)} assume !!(0 != ~r~0); {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,485 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {64085#true} {64138#(<= main_~v~0 1)} #94#return; {64138#(<= main_~v~0 1)} is VALID [2022-04-07 14:03:02,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,486 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-07 14:03:02,486 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-07 14:03:02,486 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-07 14:03:02,486 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-07 14:03:02,486 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {64085#true} {64085#true} #92#return; {64085#true} is VALID [2022-04-07 14:03:02,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,487 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-07 14:03:02,487 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {64085#true} {64085#true} #90#return; {64085#true} is VALID [2022-04-07 14:03:02,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {64085#true} assume !(0 == ~cond); {64085#true} is VALID [2022-04-07 14:03:02,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {64085#true} ~cond := #in~cond; {64085#true} is VALID [2022-04-07 14:03:02,487 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-07 14:03:02,487 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-07 14:03:02,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {64085#true} call #t~ret9 := main(); {64085#true} is VALID [2022-04-07 14:03:02,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64085#true} {64085#true} #102#return; {64085#true} is VALID [2022-04-07 14:03:02,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {64085#true} assume true; {64085#true} is VALID [2022-04-07 14:03:02,487 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-07 14:03:02,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {64085#true} call ULTIMATE.init(); {64085#true} is VALID [2022-04-07 14:03:02,488 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-07 14:03:02,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:02,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612708366] [2022-04-07 14:03:02,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:02,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037178475] [2022-04-07 14:03:02,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037178475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:02,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:02,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2022-04-07 14:03:02,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298341180] [2022-04-07 14:03:02,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:02,489 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-07 14:03:02,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:02,489 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-07 14:03:02,648 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-07 14:03:02,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 14:03:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:02,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 14:03:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-07 14:03:02,649 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-07 14:03:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:16,171 INFO L93 Difference]: Finished difference Result 3252 states and 4395 transitions. [2022-04-07 14:03:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-07 14:03:16,171 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-07 14:03:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:16,172 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-07 14:03:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-07 14:03:16,181 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-07 14:03:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 746 transitions. [2022-04-07 14:03:16,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 746 transitions. [2022-04-07 14:03:16,827 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-07 14:03:17,159 INFO L225 Difference]: With dead ends: 3252 [2022-04-07 14:03:17,159 INFO L226 Difference]: Without dead ends: 2993 [2022-04-07 14:03:17,160 INFO L912 BasicCegarLoop]: 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-07 14:03:17,160 INFO L913 BasicCegarLoop]: 343 mSDtfsCounter, 276 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:17,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 2084 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-07 14:03:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2022-04-07 14:03:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2462. [2022-04-07 14:03:20,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:03:20,639 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-07 14:03:20,649 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-07 14:03:20,651 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-07 14:03:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:20,886 INFO L93 Difference]: Finished difference Result 2993 states and 4017 transitions. [2022-04-07 14:03:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4017 transitions. [2022-04-07 14:03:20,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:20,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:20,894 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-07 14:03:20,895 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-07 14:03:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:21,138 INFO L93 Difference]: Finished difference Result 2993 states and 4017 transitions. [2022-04-07 14:03:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4017 transitions. [2022-04-07 14:03:21,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:03:21,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:03:21,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:03:21,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:03:21,145 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-07 14:03:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 3344 transitions. [2022-04-07 14:03:21,383 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 3344 transitions. Word has length 187 [2022-04-07 14:03:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:03:21,384 INFO L478 AbstractCegarLoop]: Abstraction has 2462 states and 3344 transitions. [2022-04-07 14:03:21,384 INFO L479 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-07 14:03:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 3344 transitions. [2022-04-07 14:03:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-04-07 14:03:21,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:03:21,387 INFO L499 BasicCegarLoop]: 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-07 14:03:21,394 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-07 14:03:21,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:21,593 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:03:21,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:03:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2070462991, now seen corresponding path program 10 times [2022-04-07 14:03:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:03:21,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850645613] [2022-04-07 14:03:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:03:21,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:03:21,609 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:03:21,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293267246] [2022-04-07 14:03:21,610 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 14:03:21,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:03:21,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:03:21,610 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-07 14:03:21,611 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-07 14:03:21,795 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 14:03:21,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:03:21,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-07 14:03:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:03:21,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:03:22,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {79339#true} call ULTIMATE.init(); {79339#true} is VALID [2022-04-07 14:03:22,768 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-07 14:03:22,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {79347#(<= ~counter~0 0)} assume true; {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79347#(<= ~counter~0 0)} {79339#true} #102#return; {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {79347#(<= ~counter~0 0)} call #t~ret9 := main(); {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,769 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-07 14:03:22,770 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-07 14:03:22,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {79347#(<= ~counter~0 0)} ~cond := #in~cond; {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {79347#(<= ~counter~0 0)} assume !(0 == ~cond); {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {79347#(<= ~counter~0 0)} assume true; {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79347#(<= ~counter~0 0)} {79347#(<= ~counter~0 0)} #90#return; {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,771 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-07 14:03:22,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {79347#(<= ~counter~0 0)} ~cond := #in~cond; {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {79347#(<= ~counter~0 0)} assume !(0 == ~cond); {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {79347#(<= ~counter~0 0)} assume true; {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,772 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79347#(<= ~counter~0 0)} {79347#(<= ~counter~0 0)} #92#return; {79347#(<= ~counter~0 0)} is VALID [2022-04-07 14:03:22,772 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-07 14:03:22,774 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-07 14:03:22,774 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-07 14:03:22,774 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-07 14:03:22,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {79396#(<= ~counter~0 1)} ~cond := #in~cond; {79396#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:22,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {79396#(<= ~counter~0 1)} assume !(0 == ~cond); {79396#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:22,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {79396#(<= ~counter~0 1)} assume true; {79396#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:22,776 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79396#(<= ~counter~0 1)} {79396#(<= ~counter~0 1)} #94#return; {79396#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:22,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {79396#(<= ~counter~0 1)} assume !!(0 != ~r~0); {79396#(<= ~counter~0 1)} is VALID [2022-04-07 14:03:22,776 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-07 14:03:22,777 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-07 14:03:22,777 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-07 14:03:22,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {79421#(<= ~counter~0 2)} ~cond := #in~cond; {79421#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:22,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {79421#(<= ~counter~0 2)} assume !(0 == ~cond); {79421#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:22,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {79421#(<= ~counter~0 2)} assume true; {79421#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:22,778 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79421#(<= ~counter~0 2)} {79421#(<= ~counter~0 2)} #96#return; {79421#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:22,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {79421#(<= ~counter~0 2)} assume !(~r~0 > 0); {79421#(<= ~counter~0 2)} is VALID [2022-04-07 14:03:22,779 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-07 14:03:22,779 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-07 14:03:22,780 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-07 14:03:22,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {79446#(<= ~counter~0 3)} ~cond := #in~cond; {79446#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:22,780 INFO L290 TraceCheckUtils]: 37: Hoare triple {79446#(<= ~counter~0 3)} assume !(0 == ~cond); {79446#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:22,781 INFO L290 TraceCheckUtils]: 38: Hoare triple {79446#(<= ~counter~0 3)} assume true; {79446#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:22,781 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79446#(<= ~counter~0 3)} {79446#(<= ~counter~0 3)} #98#return; {79446#(<= ~counter~0 3)} is VALID [2022-04-07 14:03:22,781 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-07 14:03:22,782 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-07 14:03:22,782 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-07 14:03:22,783 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-07 14:03:22,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {79471#(<= ~counter~0 4)} ~cond := #in~cond; {79471#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:22,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {79471#(<= ~counter~0 4)} assume !(0 == ~cond); {79471#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:22,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {79471#(<= ~counter~0 4)} assume true; {79471#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:22,784 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79471#(<= ~counter~0 4)} {79471#(<= ~counter~0 4)} #98#return; {79471#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:22,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {79471#(<= ~counter~0 4)} assume !(~r~0 < 0); {79471#(<= ~counter~0 4)} is VALID [2022-04-07 14:03:22,785 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-07 14:03:22,785 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-07 14:03:22,785 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-07 14:03:22,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {79496#(<= ~counter~0 5)} ~cond := #in~cond; {79496#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:22,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {79496#(<= ~counter~0 5)} assume !(0 == ~cond); {79496#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:22,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {79496#(<= ~counter~0 5)} assume true; {79496#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:22,786 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79496#(<= ~counter~0 5)} {79496#(<= ~counter~0 5)} #94#return; {79496#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:22,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {79496#(<= ~counter~0 5)} assume !!(0 != ~r~0); {79496#(<= ~counter~0 5)} is VALID [2022-04-07 14:03:22,787 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-07 14:03:22,788 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-07 14:03:22,795 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-07 14:03:22,796 INFO L290 TraceCheckUtils]: 60: Hoare triple {79521#(<= ~counter~0 6)} ~cond := #in~cond; {79521#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:22,796 INFO L290 TraceCheckUtils]: 61: Hoare triple {79521#(<= ~counter~0 6)} assume !(0 == ~cond); {79521#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:22,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {79521#(<= ~counter~0 6)} assume true; {79521#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:22,797 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79521#(<= ~counter~0 6)} {79521#(<= ~counter~0 6)} #96#return; {79521#(<= ~counter~0 6)} is VALID [2022-04-07 14:03:22,797 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-07 14:03:22,798 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-07 14:03:22,798 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-07 14:03:22,799 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-07 14:03:22,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {79546#(<= ~counter~0 7)} ~cond := #in~cond; {79546#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:22,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {79546#(<= ~counter~0 7)} assume !(0 == ~cond); {79546#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:22,800 INFO L290 TraceCheckUtils]: 70: Hoare triple {79546#(<= ~counter~0 7)} assume true; {79546#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:22,800 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79546#(<= ~counter~0 7)} {79546#(<= ~counter~0 7)} #96#return; {79546#(<= ~counter~0 7)} is VALID [2022-04-07 14:03:22,800 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-07 14:03:22,801 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-07 14:03:22,801 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-07 14:03:22,802 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-07 14:03:22,802 INFO L290 TraceCheckUtils]: 76: Hoare triple {79571#(<= ~counter~0 8)} ~cond := #in~cond; {79571#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:22,802 INFO L290 TraceCheckUtils]: 77: Hoare triple {79571#(<= ~counter~0 8)} assume !(0 == ~cond); {79571#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:22,803 INFO L290 TraceCheckUtils]: 78: Hoare triple {79571#(<= ~counter~0 8)} assume true; {79571#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:22,803 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79571#(<= ~counter~0 8)} {79571#(<= ~counter~0 8)} #96#return; {79571#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:22,803 INFO L290 TraceCheckUtils]: 80: Hoare triple {79571#(<= ~counter~0 8)} assume !(~r~0 > 0); {79571#(<= ~counter~0 8)} is VALID [2022-04-07 14:03:22,804 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-07 14:03:22,804 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-07 14:03:22,805 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-07 14:03:22,805 INFO L290 TraceCheckUtils]: 84: Hoare triple {79596#(<= ~counter~0 9)} ~cond := #in~cond; {79596#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:22,805 INFO L290 TraceCheckUtils]: 85: Hoare triple {79596#(<= ~counter~0 9)} assume !(0 == ~cond); {79596#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:22,806 INFO L290 TraceCheckUtils]: 86: Hoare triple {79596#(<= ~counter~0 9)} assume true; {79596#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:22,806 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79596#(<= ~counter~0 9)} {79596#(<= ~counter~0 9)} #98#return; {79596#(<= ~counter~0 9)} is VALID [2022-04-07 14:03:22,806 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-07 14:03:22,807 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-07 14:03:22,808 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-07 14:03:22,808 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-07 14:03:22,809 INFO L290 TraceCheckUtils]: 92: Hoare triple {79621#(<= ~counter~0 10)} ~cond := #in~cond; {79621#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:22,809 INFO L290 TraceCheckUtils]: 93: Hoare triple {79621#(<= ~counter~0 10)} assume !(0 == ~cond); {79621#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:22,809 INFO L290 TraceCheckUtils]: 94: Hoare triple {79621#(<= ~counter~0 10)} assume true; {79621#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:22,810 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79621#(<= ~counter~0 10)} {79621#(<= ~counter~0 10)} #98#return; {79621#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:22,810 INFO L290 TraceCheckUtils]: 96: Hoare triple {79621#(<= ~counter~0 10)} assume !(~r~0 < 0); {79621#(<= ~counter~0 10)} is VALID [2022-04-07 14:03:22,812 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-07 14:03:22,812 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-07 14:03:22,813 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-07 14:03:22,813 INFO L290 TraceCheckUtils]: 100: Hoare triple {79646#(<= ~counter~0 11)} ~cond := #in~cond; {79646#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:22,813 INFO L290 TraceCheckUtils]: 101: Hoare triple {79646#(<= ~counter~0 11)} assume !(0 == ~cond); {79646#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:22,813 INFO L290 TraceCheckUtils]: 102: Hoare triple {79646#(<= ~counter~0 11)} assume true; {79646#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:22,814 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79646#(<= ~counter~0 11)} {79646#(<= ~counter~0 11)} #94#return; {79646#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:22,814 INFO L290 TraceCheckUtils]: 104: Hoare triple {79646#(<= ~counter~0 11)} assume !!(0 != ~r~0); {79646#(<= ~counter~0 11)} is VALID [2022-04-07 14:03:22,815 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-07 14:03:22,816 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-07 14:03:22,816 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-07 14:03:22,816 INFO L290 TraceCheckUtils]: 108: Hoare triple {79671#(<= ~counter~0 12)} ~cond := #in~cond; {79671#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:22,817 INFO L290 TraceCheckUtils]: 109: Hoare triple {79671#(<= ~counter~0 12)} assume !(0 == ~cond); {79671#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:22,817 INFO L290 TraceCheckUtils]: 110: Hoare triple {79671#(<= ~counter~0 12)} assume true; {79671#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:22,818 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79671#(<= ~counter~0 12)} {79671#(<= ~counter~0 12)} #96#return; {79671#(<= ~counter~0 12)} is VALID [2022-04-07 14:03:22,818 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-07 14:03:22,819 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-07 14:03:22,819 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-07 14:03:22,819 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-07 14:03:22,820 INFO L290 TraceCheckUtils]: 116: Hoare triple {79696#(<= ~counter~0 13)} ~cond := #in~cond; {79696#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:22,820 INFO L290 TraceCheckUtils]: 117: Hoare triple {79696#(<= ~counter~0 13)} assume !(0 == ~cond); {79696#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:22,820 INFO L290 TraceCheckUtils]: 118: Hoare triple {79696#(<= ~counter~0 13)} assume true; {79696#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:22,821 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {79696#(<= ~counter~0 13)} {79696#(<= ~counter~0 13)} #96#return; {79696#(<= ~counter~0 13)} is VALID [2022-04-07 14:03:22,821 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-07 14:03:22,822 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-07 14:03:22,822 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-07 14:03:22,823 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-07 14:03:22,823 INFO L290 TraceCheckUtils]: 124: Hoare triple {79721#(<= ~counter~0 14)} ~cond := #in~cond; {79721#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:22,824 INFO L290 TraceCheckUtils]: 125: Hoare triple {79721#(<= ~counter~0 14)} assume !(0 == ~cond); {79721#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:22,824 INFO L290 TraceCheckUtils]: 126: Hoare triple {79721#(<= ~counter~0 14)} assume true; {79721#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:22,824 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {79721#(<= ~counter~0 14)} {79721#(<= ~counter~0 14)} #96#return; {79721#(<= ~counter~0 14)} is VALID [2022-04-07 14:03:22,825 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-07 14:03:22,826 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-07 14:03:22,826 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-07 14:03:22,826 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-07 14:03:22,827 INFO L290 TraceCheckUtils]: 132: Hoare triple {79746#(<= ~counter~0 15)} ~cond := #in~cond; {79746#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:22,827 INFO L290 TraceCheckUtils]: 133: Hoare triple {79746#(<= ~counter~0 15)} assume !(0 == ~cond); {79746#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:22,827 INFO L290 TraceCheckUtils]: 134: Hoare triple {79746#(<= ~counter~0 15)} assume true; {79746#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:22,828 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {79746#(<= ~counter~0 15)} {79746#(<= ~counter~0 15)} #96#return; {79746#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:22,828 INFO L290 TraceCheckUtils]: 136: Hoare triple {79746#(<= ~counter~0 15)} assume !(~r~0 > 0); {79746#(<= ~counter~0 15)} is VALID [2022-04-07 14:03:22,829 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-07 14:03:22,829 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-07 14:03:22,830 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-07 14:03:22,830 INFO L290 TraceCheckUtils]: 140: Hoare triple {79771#(<= ~counter~0 16)} ~cond := #in~cond; {79771#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:22,831 INFO L290 TraceCheckUtils]: 141: Hoare triple {79771#(<= ~counter~0 16)} assume !(0 == ~cond); {79771#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:22,831 INFO L290 TraceCheckUtils]: 142: Hoare triple {79771#(<= ~counter~0 16)} assume true; {79771#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:22,831 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {79771#(<= ~counter~0 16)} {79771#(<= ~counter~0 16)} #98#return; {79771#(<= ~counter~0 16)} is VALID [2022-04-07 14:03:22,832 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-07 14:03:22,833 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-07 14:03:22,833 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-07 14:03:22,833 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-07 14:03:22,834 INFO L290 TraceCheckUtils]: 148: Hoare triple {79796#(<= ~counter~0 17)} ~cond := #in~cond; {79796#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:22,834 INFO L290 TraceCheckUtils]: 149: Hoare triple {79796#(<= ~counter~0 17)} assume !(0 == ~cond); {79796#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:22,834 INFO L290 TraceCheckUtils]: 150: Hoare triple {79796#(<= ~counter~0 17)} assume true; {79796#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:22,835 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {79796#(<= ~counter~0 17)} {79796#(<= ~counter~0 17)} #98#return; {79796#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:22,835 INFO L290 TraceCheckUtils]: 152: Hoare triple {79796#(<= ~counter~0 17)} assume !(~r~0 < 0); {79796#(<= ~counter~0 17)} is VALID [2022-04-07 14:03:22,836 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-07 14:03:22,836 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-07 14:03:22,837 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-07 14:03:22,837 INFO L290 TraceCheckUtils]: 156: Hoare triple {79821#(<= ~counter~0 18)} ~cond := #in~cond; {79821#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:22,838 INFO L290 TraceCheckUtils]: 157: Hoare triple {79821#(<= ~counter~0 18)} assume !(0 == ~cond); {79821#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:22,838 INFO L290 TraceCheckUtils]: 158: Hoare triple {79821#(<= ~counter~0 18)} assume true; {79821#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:22,839 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {79821#(<= ~counter~0 18)} {79821#(<= ~counter~0 18)} #94#return; {79821#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:22,839 INFO L290 TraceCheckUtils]: 160: Hoare triple {79821#(<= ~counter~0 18)} assume !!(0 != ~r~0); {79821#(<= ~counter~0 18)} is VALID [2022-04-07 14:03:22,840 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-07 14:03:22,840 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-07 14:03:22,841 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-07 14:03:22,841 INFO L290 TraceCheckUtils]: 164: Hoare triple {79846#(<= ~counter~0 19)} ~cond := #in~cond; {79846#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:22,841 INFO L290 TraceCheckUtils]: 165: Hoare triple {79846#(<= ~counter~0 19)} assume !(0 == ~cond); {79846#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:22,841 INFO L290 TraceCheckUtils]: 166: Hoare triple {79846#(<= ~counter~0 19)} assume true; {79846#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:22,842 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {79846#(<= ~counter~0 19)} {79846#(<= ~counter~0 19)} #96#return; {79846#(<= ~counter~0 19)} is VALID [2022-04-07 14:03:22,842 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-07 14:03:22,843 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-07 14:03:22,843 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-07 14:03:22,844 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-07 14:03:22,844 INFO L290 TraceCheckUtils]: 172: Hoare triple {79871#(<= ~counter~0 20)} ~cond := #in~cond; {79871#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:22,845 INFO L290 TraceCheckUtils]: 173: Hoare triple {79871#(<= ~counter~0 20)} assume !(0 == ~cond); {79871#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:22,845 INFO L290 TraceCheckUtils]: 174: Hoare triple {79871#(<= ~counter~0 20)} assume true; {79871#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:22,845 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {79871#(<= ~counter~0 20)} {79871#(<= ~counter~0 20)} #96#return; {79871#(<= ~counter~0 20)} is VALID [2022-04-07 14:03:22,846 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-07 14:03:22,846 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-07 14:03:22,846 INFO L290 TraceCheckUtils]: 178: Hoare triple {79896#(<= |main_#t~post7| 20)} assume !(#t~post7 < 100);havoc #t~post7; {79340#false} is VALID [2022-04-07 14:03:22,847 INFO L290 TraceCheckUtils]: 179: Hoare triple {79340#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79340#false} is VALID [2022-04-07 14:03:22,847 INFO L290 TraceCheckUtils]: 180: Hoare triple {79340#false} assume !(#t~post8 < 100);havoc #t~post8; {79340#false} is VALID [2022-04-07 14:03:22,847 INFO L290 TraceCheckUtils]: 181: Hoare triple {79340#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79340#false} is VALID [2022-04-07 14:03:22,847 INFO L290 TraceCheckUtils]: 182: Hoare triple {79340#false} assume !(#t~post6 < 100);havoc #t~post6; {79340#false} is VALID [2022-04-07 14:03:22,847 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-07 14:03:22,847 INFO L290 TraceCheckUtils]: 184: Hoare triple {79340#false} ~cond := #in~cond; {79340#false} is VALID [2022-04-07 14:03:22,847 INFO L290 TraceCheckUtils]: 185: Hoare triple {79340#false} assume 0 == ~cond; {79340#false} is VALID [2022-04-07 14:03:22,847 INFO L290 TraceCheckUtils]: 186: Hoare triple {79340#false} assume !false; {79340#false} is VALID [2022-04-07 14:03:22,848 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-07 14:03:22,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:03:24,091 INFO L290 TraceCheckUtils]: 186: Hoare triple {79340#false} assume !false; {79340#false} is VALID [2022-04-07 14:03:24,091 INFO L290 TraceCheckUtils]: 185: Hoare triple {79340#false} assume 0 == ~cond; {79340#false} is VALID [2022-04-07 14:03:24,091 INFO L290 TraceCheckUtils]: 184: Hoare triple {79340#false} ~cond := #in~cond; {79340#false} is VALID [2022-04-07 14:03:24,091 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-07 14:03:24,091 INFO L290 TraceCheckUtils]: 182: Hoare triple {79340#false} assume !(#t~post6 < 100);havoc #t~post6; {79340#false} is VALID [2022-04-07 14:03:24,091 INFO L290 TraceCheckUtils]: 181: Hoare triple {79340#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79340#false} is VALID [2022-04-07 14:03:24,091 INFO L290 TraceCheckUtils]: 180: Hoare triple {79340#false} assume !(#t~post8 < 100);havoc #t~post8; {79340#false} is VALID [2022-04-07 14:03:24,091 INFO L290 TraceCheckUtils]: 179: Hoare triple {79340#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {79340#false} is VALID [2022-04-07 14:03:24,092 INFO L290 TraceCheckUtils]: 178: Hoare triple {79948#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {79340#false} is VALID [2022-04-07 14:03:24,092 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-07 14:03:24,092 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-07 14:03:24,093 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {79339#true} {79952#(< ~counter~0 100)} #96#return; {79952#(< ~counter~0 100)} is VALID [2022-04-07 14:03:24,093 INFO L290 TraceCheckUtils]: 174: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,093 INFO L290 TraceCheckUtils]: 173: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,093 INFO L290 TraceCheckUtils]: 172: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,093 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-07 14:03:24,093 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-07 14:03:24,095 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-07 14:03:24,095 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-07 14:03:24,095 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {79339#true} {79977#(< ~counter~0 99)} #96#return; {79977#(< ~counter~0 99)} is VALID [2022-04-07 14:03:24,095 INFO L290 TraceCheckUtils]: 166: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,096 INFO L290 TraceCheckUtils]: 165: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,096 INFO L290 TraceCheckUtils]: 164: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,096 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-07 14:03:24,096 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-07 14:03:24,097 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-07 14:03:24,097 INFO L290 TraceCheckUtils]: 160: Hoare triple {80002#(< ~counter~0 98)} assume !!(0 != ~r~0); {80002#(< ~counter~0 98)} is VALID [2022-04-07 14:03:24,097 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {79339#true} {80002#(< ~counter~0 98)} #94#return; {80002#(< ~counter~0 98)} is VALID [2022-04-07 14:03:24,097 INFO L290 TraceCheckUtils]: 158: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,097 INFO L290 TraceCheckUtils]: 157: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,098 INFO L290 TraceCheckUtils]: 156: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,098 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-07 14:03:24,098 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-07 14:03:24,099 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-07 14:03:24,099 INFO L290 TraceCheckUtils]: 152: Hoare triple {80027#(< ~counter~0 97)} assume !(~r~0 < 0); {80027#(< ~counter~0 97)} is VALID [2022-04-07 14:03:24,099 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {79339#true} {80027#(< ~counter~0 97)} #98#return; {80027#(< ~counter~0 97)} is VALID [2022-04-07 14:03:24,099 INFO L290 TraceCheckUtils]: 150: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,099 INFO L290 TraceCheckUtils]: 149: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,100 INFO L290 TraceCheckUtils]: 148: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,100 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-07 14:03:24,100 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-07 14:03:24,100 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-07 14:03:24,101 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-07 14:03:24,101 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {79339#true} {80052#(< ~counter~0 96)} #98#return; {80052#(< ~counter~0 96)} is VALID [2022-04-07 14:03:24,101 INFO L290 TraceCheckUtils]: 142: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,101 INFO L290 TraceCheckUtils]: 141: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,101 INFO L290 TraceCheckUtils]: 140: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,101 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-07 14:03:24,102 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-07 14:03:24,102 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-07 14:03:24,103 INFO L290 TraceCheckUtils]: 136: Hoare triple {80077#(< ~counter~0 95)} assume !(~r~0 > 0); {80077#(< ~counter~0 95)} is VALID [2022-04-07 14:03:24,103 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {79339#true} {80077#(< ~counter~0 95)} #96#return; {80077#(< ~counter~0 95)} is VALID [2022-04-07 14:03:24,103 INFO L290 TraceCheckUtils]: 134: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,103 INFO L290 TraceCheckUtils]: 133: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,103 INFO L290 TraceCheckUtils]: 132: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,103 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-07 14:03:24,104 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-07 14:03:24,104 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-07 14:03:24,104 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-07 14:03:24,105 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {79339#true} {80102#(< ~counter~0 94)} #96#return; {80102#(< ~counter~0 94)} is VALID [2022-04-07 14:03:24,105 INFO L290 TraceCheckUtils]: 126: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,105 INFO L290 TraceCheckUtils]: 125: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,105 INFO L290 TraceCheckUtils]: 124: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,105 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-07 14:03:24,105 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-07 14:03:24,106 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-07 14:03:24,106 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-07 14:03:24,107 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {79339#true} {80127#(< ~counter~0 93)} #96#return; {80127#(< ~counter~0 93)} is VALID [2022-04-07 14:03:24,107 INFO L290 TraceCheckUtils]: 118: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,107 INFO L290 TraceCheckUtils]: 117: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,107 INFO L290 TraceCheckUtils]: 116: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,107 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-07 14:03:24,107 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-07 14:03:24,108 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-07 14:03:24,108 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-07 14:03:24,109 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {79339#true} {80152#(< ~counter~0 92)} #96#return; {80152#(< ~counter~0 92)} is VALID [2022-04-07 14:03:24,109 INFO L290 TraceCheckUtils]: 110: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,109 INFO L290 TraceCheckUtils]: 109: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,109 INFO L290 TraceCheckUtils]: 108: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,109 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-07 14:03:24,109 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-07 14:03:24,110 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-07 14:03:24,110 INFO L290 TraceCheckUtils]: 104: Hoare triple {80177#(< ~counter~0 91)} assume !!(0 != ~r~0); {80177#(< ~counter~0 91)} is VALID [2022-04-07 14:03:24,111 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {79339#true} {80177#(< ~counter~0 91)} #94#return; {80177#(< ~counter~0 91)} is VALID [2022-04-07 14:03:24,111 INFO L290 TraceCheckUtils]: 102: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,111 INFO L290 TraceCheckUtils]: 101: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,111 INFO L290 TraceCheckUtils]: 100: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,111 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-07 14:03:24,111 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-07 14:03:24,112 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-07 14:03:24,112 INFO L290 TraceCheckUtils]: 96: Hoare triple {80202#(< ~counter~0 90)} assume !(~r~0 < 0); {80202#(< ~counter~0 90)} is VALID [2022-04-07 14:03:24,113 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {79339#true} {80202#(< ~counter~0 90)} #98#return; {80202#(< ~counter~0 90)} is VALID [2022-04-07 14:03:24,113 INFO L290 TraceCheckUtils]: 94: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,113 INFO L290 TraceCheckUtils]: 93: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,113 INFO L290 TraceCheckUtils]: 92: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,113 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-07 14:03:24,113 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-07 14:03:24,114 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-07 14:03:24,114 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-07 14:03:24,115 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {79339#true} {80227#(< ~counter~0 89)} #98#return; {80227#(< ~counter~0 89)} is VALID [2022-04-07 14:03:24,115 INFO L290 TraceCheckUtils]: 86: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,115 INFO L290 TraceCheckUtils]: 85: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,115 INFO L290 TraceCheckUtils]: 84: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,115 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-07 14:03:24,115 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-07 14:03:24,116 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-07 14:03:24,116 INFO L290 TraceCheckUtils]: 80: Hoare triple {80252#(< ~counter~0 88)} assume !(~r~0 > 0); {80252#(< ~counter~0 88)} is VALID [2022-04-07 14:03:24,117 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {79339#true} {80252#(< ~counter~0 88)} #96#return; {80252#(< ~counter~0 88)} is VALID [2022-04-07 14:03:24,117 INFO L290 TraceCheckUtils]: 78: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,117 INFO L290 TraceCheckUtils]: 77: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,117 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-07 14:03:24,117 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-07 14:03:24,118 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-07 14:03:24,118 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-07 14:03:24,118 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {79339#true} {80277#(< ~counter~0 87)} #96#return; {80277#(< ~counter~0 87)} is VALID [2022-04-07 14:03:24,118 INFO L290 TraceCheckUtils]: 70: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,119 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-07 14:03:24,119 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-07 14:03:24,120 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-07 14:03:24,120 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-07 14:03:24,120 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79339#true} {80302#(< ~counter~0 86)} #96#return; {80302#(< ~counter~0 86)} is VALID [2022-04-07 14:03:24,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,120 INFO L290 TraceCheckUtils]: 60: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,120 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-07 14:03:24,121 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-07 14:03:24,121 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-07 14:03:24,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {80327#(< ~counter~0 85)} assume !!(0 != ~r~0); {80327#(< ~counter~0 85)} is VALID [2022-04-07 14:03:24,122 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {79339#true} {80327#(< ~counter~0 85)} #94#return; {80327#(< ~counter~0 85)} is VALID [2022-04-07 14:03:24,122 INFO L290 TraceCheckUtils]: 54: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,122 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-07 14:03:24,123 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-07 14:03:24,123 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-07 14:03:24,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {80352#(< ~counter~0 84)} assume !(~r~0 < 0); {80352#(< ~counter~0 84)} is VALID [2022-04-07 14:03:24,124 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {79339#true} {80352#(< ~counter~0 84)} #98#return; {80352#(< ~counter~0 84)} is VALID [2022-04-07 14:03:24,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,124 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-07 14:03:24,125 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-07 14:03:24,125 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-07 14:03:24,126 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-07 14:03:24,126 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {79339#true} {80377#(< ~counter~0 83)} #98#return; {80377#(< ~counter~0 83)} is VALID [2022-04-07 14:03:24,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,126 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-07 14:03:24,126 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-07 14:03:24,127 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-07 14:03:24,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {80402#(< ~counter~0 82)} assume !(~r~0 > 0); {80402#(< ~counter~0 82)} is VALID [2022-04-07 14:03:24,128 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {79339#true} {80402#(< ~counter~0 82)} #96#return; {80402#(< ~counter~0 82)} is VALID [2022-04-07 14:03:24,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,128 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-07 14:03:24,128 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-07 14:03:24,129 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-07 14:03:24,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {80427#(< ~counter~0 81)} assume !!(0 != ~r~0); {80427#(< ~counter~0 81)} is VALID [2022-04-07 14:03:24,130 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {79339#true} {80427#(< ~counter~0 81)} #94#return; {80427#(< ~counter~0 81)} is VALID [2022-04-07 14:03:24,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,130 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-07 14:03:24,130 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-07 14:03:24,131 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-07 14:03:24,131 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-07 14:03:24,132 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79339#true} {80452#(< ~counter~0 80)} #92#return; {80452#(< ~counter~0 80)} is VALID [2022-04-07 14:03:24,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,132 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-07 14:03:24,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79339#true} {80452#(< ~counter~0 80)} #90#return; {80452#(< ~counter~0 80)} is VALID [2022-04-07 14:03:24,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {79339#true} assume true; {79339#true} is VALID [2022-04-07 14:03:24,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {79339#true} assume !(0 == ~cond); {79339#true} is VALID [2022-04-07 14:03:24,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {79339#true} ~cond := #in~cond; {79339#true} is VALID [2022-04-07 14:03:24,132 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-07 14:03:24,133 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-07 14:03:24,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {80452#(< ~counter~0 80)} call #t~ret9 := main(); {80452#(< ~counter~0 80)} is VALID [2022-04-07 14:03:24,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80452#(< ~counter~0 80)} {79339#true} #102#return; {80452#(< ~counter~0 80)} is VALID [2022-04-07 14:03:24,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {80452#(< ~counter~0 80)} assume true; {80452#(< ~counter~0 80)} is VALID [2022-04-07 14:03:24,134 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-07 14:03:24,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {79339#true} call ULTIMATE.init(); {79339#true} is VALID [2022-04-07 14:03:24,134 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-07 14:03:24,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:03:24,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850645613] [2022-04-07 14:03:24,135 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:03:24,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293267246] [2022-04-07 14:03:24,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293267246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:03:24,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:03:24,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2022-04-07 14:03:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321120284] [2022-04-07 14:03:24,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:03:24,136 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-07 14:03:24,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:03:24,136 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-07 14:03:24,354 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-07 14:03:24,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-07 14:03:24,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:03:24,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-07 14:03:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2022-04-07 14:03:24,355 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-07 14:03:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:03:48,614 INFO L93 Difference]: Finished difference Result 9906 states and 14925 transitions. [2022-04-07 14:03:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-04-07 14:03:48,615 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-07 14:03:48,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:03:48,615 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-07 14:03:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-07 14:03:48,622 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-07 14:03:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 956 transitions. [2022-04-07 14:03:48,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 956 transitions. [2022-04-07 14:03:49,356 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-07 14:03:52,997 INFO L225 Difference]: With dead ends: 9906 [2022-04-07 14:03:52,997 INFO L226 Difference]: Without dead ends: 9897 [2022-04-07 14:03:53,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2691, Invalid=4619, Unknown=0, NotChecked=0, Total=7310 [2022-04-07 14:03:53,001 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 1584 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 1053 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-07 14:03:53,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1584 Valid, 1026 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1053 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-07 14:03:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9897 states. [2022-04-07 14:04:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9897 to 9645. [2022-04-07 14:04:08,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:04:08,082 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-07 14:04:08,088 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-07 14:04:08,096 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-07 14:04:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:04:10,610 INFO L93 Difference]: Finished difference Result 9897 states and 14111 transitions. [2022-04-07 14:04:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9897 states and 14111 transitions. [2022-04-07 14:04:10,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:04:10,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:04:10,632 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-07 14:04:10,639 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-07 14:04:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:04:13,192 INFO L93 Difference]: Finished difference Result 9897 states and 14111 transitions. [2022-04-07 14:04:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 9897 states and 14111 transitions. [2022-04-07 14:04:13,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:04:13,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:04:13,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:04:13,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:04:13,213 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-07 14:04:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9645 states to 9645 states and 13867 transitions. [2022-04-07 14:04:16,718 INFO L78 Accepts]: Start accepts. Automaton has 9645 states and 13867 transitions. Word has length 187 [2022-04-07 14:04:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:04:16,718 INFO L478 AbstractCegarLoop]: Abstraction has 9645 states and 13867 transitions. [2022-04-07 14:04:16,718 INFO L479 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-07 14:04:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 9645 states and 13867 transitions. [2022-04-07 14:04:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-07 14:04:16,722 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:04:16,722 INFO L499 BasicCegarLoop]: 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-07 14:04:16,741 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-07 14:04:16,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:04:16,935 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:04:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:04:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash 179284923, now seen corresponding path program 2 times [2022-04-07 14:04:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:04:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708129904] [2022-04-07 14:04:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:04:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:04:16,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:04:16,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266724513] [2022-04-07 14:04:16,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:04:16,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:04:16,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:04:16,963 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-07 14:04:16,963 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-07 14:04:17,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:04:17,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:04:17,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-07 14:04:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:04:17,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:04:18,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {127992#true} call ULTIMATE.init(); {127992#true} is VALID [2022-04-07 14:04:18,006 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-07 14:04:18,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {128000#(<= ~counter~0 0)} assume true; {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128000#(<= ~counter~0 0)} {127992#true} #102#return; {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {128000#(<= ~counter~0 0)} call #t~ret9 := main(); {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,007 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-07 14:04:18,008 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-07 14:04:18,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {128000#(<= ~counter~0 0)} ~cond := #in~cond; {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {128000#(<= ~counter~0 0)} assume !(0 == ~cond); {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {128000#(<= ~counter~0 0)} assume true; {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {128000#(<= ~counter~0 0)} {128000#(<= ~counter~0 0)} #90#return; {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,032 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-07 14:04:18,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {128000#(<= ~counter~0 0)} ~cond := #in~cond; {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {128000#(<= ~counter~0 0)} assume !(0 == ~cond); {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {128000#(<= ~counter~0 0)} assume true; {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,034 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {128000#(<= ~counter~0 0)} {128000#(<= ~counter~0 0)} #92#return; {128000#(<= ~counter~0 0)} is VALID [2022-04-07 14:04:18,034 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-07 14:04:18,036 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-07 14:04:18,036 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-07 14:04:18,037 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-07 14:04:18,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {128049#(<= ~counter~0 1)} ~cond := #in~cond; {128049#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:18,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {128049#(<= ~counter~0 1)} assume !(0 == ~cond); {128049#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:18,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {128049#(<= ~counter~0 1)} assume true; {128049#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:18,039 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {128049#(<= ~counter~0 1)} {128049#(<= ~counter~0 1)} #94#return; {128049#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:18,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {128049#(<= ~counter~0 1)} assume !!(0 != ~r~0); {128049#(<= ~counter~0 1)} is VALID [2022-04-07 14:04:18,040 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-07 14:04:18,040 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-07 14:04:18,041 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-07 14:04:18,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {128074#(<= ~counter~0 2)} ~cond := #in~cond; {128074#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:18,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {128074#(<= ~counter~0 2)} assume !(0 == ~cond); {128074#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:18,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {128074#(<= ~counter~0 2)} assume true; {128074#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:18,043 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {128074#(<= ~counter~0 2)} {128074#(<= ~counter~0 2)} #96#return; {128074#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:18,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {128074#(<= ~counter~0 2)} assume !(~r~0 > 0); {128074#(<= ~counter~0 2)} is VALID [2022-04-07 14:04:18,044 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-07 14:04:18,044 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-07 14:04:18,045 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-07 14:04:18,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {128099#(<= ~counter~0 3)} ~cond := #in~cond; {128099#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:18,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {128099#(<= ~counter~0 3)} assume !(0 == ~cond); {128099#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:18,046 INFO L290 TraceCheckUtils]: 38: Hoare triple {128099#(<= ~counter~0 3)} assume true; {128099#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:18,047 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {128099#(<= ~counter~0 3)} {128099#(<= ~counter~0 3)} #98#return; {128099#(<= ~counter~0 3)} is VALID [2022-04-07 14:04:18,047 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-07 14:04:18,048 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-07 14:04:18,048 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-07 14:04:18,049 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-07 14:04:18,049 INFO L290 TraceCheckUtils]: 44: Hoare triple {128124#(<= ~counter~0 4)} ~cond := #in~cond; {128124#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:18,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {128124#(<= ~counter~0 4)} assume !(0 == ~cond); {128124#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:18,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {128124#(<= ~counter~0 4)} assume true; {128124#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:18,051 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {128124#(<= ~counter~0 4)} {128124#(<= ~counter~0 4)} #98#return; {128124#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:18,051 INFO L290 TraceCheckUtils]: 48: Hoare triple {128124#(<= ~counter~0 4)} assume !(~r~0 < 0); {128124#(<= ~counter~0 4)} is VALID [2022-04-07 14:04:18,052 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-07 14:04:18,052 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-07 14:04:18,053 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-07 14:04:18,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {128149#(<= ~counter~0 5)} ~cond := #in~cond; {128149#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:18,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {128149#(<= ~counter~0 5)} assume !(0 == ~cond); {128149#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:18,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {128149#(<= ~counter~0 5)} assume true; {128149#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:18,054 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {128149#(<= ~counter~0 5)} {128149#(<= ~counter~0 5)} #94#return; {128149#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:18,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {128149#(<= ~counter~0 5)} assume !!(0 != ~r~0); {128149#(<= ~counter~0 5)} is VALID [2022-04-07 14:04:18,055 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-07 14:04:18,055 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-07 14:04:18,056 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-07 14:04:18,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {128174#(<= ~counter~0 6)} ~cond := #in~cond; {128174#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:18,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {128174#(<= ~counter~0 6)} assume !(0 == ~cond); {128174#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:18,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {128174#(<= ~counter~0 6)} assume true; {128174#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:18,057 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {128174#(<= ~counter~0 6)} {128174#(<= ~counter~0 6)} #96#return; {128174#(<= ~counter~0 6)} is VALID [2022-04-07 14:04:18,057 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-07 14:04:18,058 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-07 14:04:18,058 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-07 14:04:18,058 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-07 14:04:18,059 INFO L290 TraceCheckUtils]: 68: Hoare triple {128199#(<= ~counter~0 7)} ~cond := #in~cond; {128199#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:18,059 INFO L290 TraceCheckUtils]: 69: Hoare triple {128199#(<= ~counter~0 7)} assume !(0 == ~cond); {128199#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:18,059 INFO L290 TraceCheckUtils]: 70: Hoare triple {128199#(<= ~counter~0 7)} assume true; {128199#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:18,060 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {128199#(<= ~counter~0 7)} {128199#(<= ~counter~0 7)} #96#return; {128199#(<= ~counter~0 7)} is VALID [2022-04-07 14:04:18,060 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-07 14:04:18,061 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-07 14:04:18,061 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-07 14:04:18,061 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-07 14:04:18,062 INFO L290 TraceCheckUtils]: 76: Hoare triple {128224#(<= ~counter~0 8)} ~cond := #in~cond; {128224#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:18,062 INFO L290 TraceCheckUtils]: 77: Hoare triple {128224#(<= ~counter~0 8)} assume !(0 == ~cond); {128224#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:18,062 INFO L290 TraceCheckUtils]: 78: Hoare triple {128224#(<= ~counter~0 8)} assume true; {128224#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:18,063 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {128224#(<= ~counter~0 8)} {128224#(<= ~counter~0 8)} #96#return; {128224#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:18,063 INFO L290 TraceCheckUtils]: 80: Hoare triple {128224#(<= ~counter~0 8)} assume !(~r~0 > 0); {128224#(<= ~counter~0 8)} is VALID [2022-04-07 14:04:18,064 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-07 14:04:18,064 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-07 14:04:18,064 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-07 14:04:18,065 INFO L290 TraceCheckUtils]: 84: Hoare triple {128249#(<= ~counter~0 9)} ~cond := #in~cond; {128249#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:18,065 INFO L290 TraceCheckUtils]: 85: Hoare triple {128249#(<= ~counter~0 9)} assume !(0 == ~cond); {128249#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:18,065 INFO L290 TraceCheckUtils]: 86: Hoare triple {128249#(<= ~counter~0 9)} assume true; {128249#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:18,066 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {128249#(<= ~counter~0 9)} {128249#(<= ~counter~0 9)} #98#return; {128249#(<= ~counter~0 9)} is VALID [2022-04-07 14:04:18,066 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-07 14:04:18,067 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-07 14:04:18,067 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-07 14:04:18,067 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-07 14:04:18,067 INFO L290 TraceCheckUtils]: 92: Hoare triple {128274#(<= ~counter~0 10)} ~cond := #in~cond; {128274#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:18,068 INFO L290 TraceCheckUtils]: 93: Hoare triple {128274#(<= ~counter~0 10)} assume !(0 == ~cond); {128274#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:18,068 INFO L290 TraceCheckUtils]: 94: Hoare triple {128274#(<= ~counter~0 10)} assume true; {128274#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:18,068 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {128274#(<= ~counter~0 10)} {128274#(<= ~counter~0 10)} #98#return; {128274#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:18,069 INFO L290 TraceCheckUtils]: 96: Hoare triple {128274#(<= ~counter~0 10)} assume !(~r~0 < 0); {128274#(<= ~counter~0 10)} is VALID [2022-04-07 14:04:18,069 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-07 14:04:18,069 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-07 14:04:18,070 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-07 14:04:18,070 INFO L290 TraceCheckUtils]: 100: Hoare triple {128299#(<= ~counter~0 11)} ~cond := #in~cond; {128299#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:18,070 INFO L290 TraceCheckUtils]: 101: Hoare triple {128299#(<= ~counter~0 11)} assume !(0 == ~cond); {128299#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:18,071 INFO L290 TraceCheckUtils]: 102: Hoare triple {128299#(<= ~counter~0 11)} assume true; {128299#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:18,071 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {128299#(<= ~counter~0 11)} {128299#(<= ~counter~0 11)} #94#return; {128299#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:18,071 INFO L290 TraceCheckUtils]: 104: Hoare triple {128299#(<= ~counter~0 11)} assume !!(0 != ~r~0); {128299#(<= ~counter~0 11)} is VALID [2022-04-07 14:04:18,072 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-07 14:04:18,072 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-07 14:04:18,073 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-07 14:04:18,073 INFO L290 TraceCheckUtils]: 108: Hoare triple {128324#(<= ~counter~0 12)} ~cond := #in~cond; {128324#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:18,073 INFO L290 TraceCheckUtils]: 109: Hoare triple {128324#(<= ~counter~0 12)} assume !(0 == ~cond); {128324#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:18,073 INFO L290 TraceCheckUtils]: 110: Hoare triple {128324#(<= ~counter~0 12)} assume true; {128324#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:18,074 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {128324#(<= ~counter~0 12)} {128324#(<= ~counter~0 12)} #96#return; {128324#(<= ~counter~0 12)} is VALID [2022-04-07 14:04:18,074 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-07 14:04:18,075 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-07 14:04:18,075 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-07 14:04:18,075 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-07 14:04:18,076 INFO L290 TraceCheckUtils]: 116: Hoare triple {128349#(<= ~counter~0 13)} ~cond := #in~cond; {128349#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:18,076 INFO L290 TraceCheckUtils]: 117: Hoare triple {128349#(<= ~counter~0 13)} assume !(0 == ~cond); {128349#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:18,076 INFO L290 TraceCheckUtils]: 118: Hoare triple {128349#(<= ~counter~0 13)} assume true; {128349#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:18,076 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {128349#(<= ~counter~0 13)} {128349#(<= ~counter~0 13)} #96#return; {128349#(<= ~counter~0 13)} is VALID [2022-04-07 14:04:18,077 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-07 14:04:18,077 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-07 14:04:18,078 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-07 14:04:18,078 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-07 14:04:18,078 INFO L290 TraceCheckUtils]: 124: Hoare triple {128374#(<= ~counter~0 14)} ~cond := #in~cond; {128374#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:18,078 INFO L290 TraceCheckUtils]: 125: Hoare triple {128374#(<= ~counter~0 14)} assume !(0 == ~cond); {128374#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:18,079 INFO L290 TraceCheckUtils]: 126: Hoare triple {128374#(<= ~counter~0 14)} assume true; {128374#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:18,079 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {128374#(<= ~counter~0 14)} {128374#(<= ~counter~0 14)} #96#return; {128374#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:18,079 INFO L290 TraceCheckUtils]: 128: Hoare triple {128374#(<= ~counter~0 14)} assume !(~r~0 > 0); {128374#(<= ~counter~0 14)} is VALID [2022-04-07 14:04:18,080 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-07 14:04:18,080 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-07 14:04:18,081 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-07 14:04:18,081 INFO L290 TraceCheckUtils]: 132: Hoare triple {128399#(<= ~counter~0 15)} ~cond := #in~cond; {128399#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:18,081 INFO L290 TraceCheckUtils]: 133: Hoare triple {128399#(<= ~counter~0 15)} assume !(0 == ~cond); {128399#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:18,081 INFO L290 TraceCheckUtils]: 134: Hoare triple {128399#(<= ~counter~0 15)} assume true; {128399#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:18,082 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {128399#(<= ~counter~0 15)} {128399#(<= ~counter~0 15)} #98#return; {128399#(<= ~counter~0 15)} is VALID [2022-04-07 14:04:18,082 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-07 14:04:18,083 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-07 14:04:18,083 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-07 14:04:18,083 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-07 14:04:18,084 INFO L290 TraceCheckUtils]: 140: Hoare triple {128424#(<= ~counter~0 16)} ~cond := #in~cond; {128424#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:18,084 INFO L290 TraceCheckUtils]: 141: Hoare triple {128424#(<= ~counter~0 16)} assume !(0 == ~cond); {128424#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:18,084 INFO L290 TraceCheckUtils]: 142: Hoare triple {128424#(<= ~counter~0 16)} assume true; {128424#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:18,085 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {128424#(<= ~counter~0 16)} {128424#(<= ~counter~0 16)} #98#return; {128424#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:18,085 INFO L290 TraceCheckUtils]: 144: Hoare triple {128424#(<= ~counter~0 16)} assume !(~r~0 < 0); {128424#(<= ~counter~0 16)} is VALID [2022-04-07 14:04:18,085 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-07 14:04:18,086 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-07 14:04:18,086 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-07 14:04:18,086 INFO L290 TraceCheckUtils]: 148: Hoare triple {128449#(<= ~counter~0 17)} ~cond := #in~cond; {128449#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:18,087 INFO L290 TraceCheckUtils]: 149: Hoare triple {128449#(<= ~counter~0 17)} assume !(0 == ~cond); {128449#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:18,087 INFO L290 TraceCheckUtils]: 150: Hoare triple {128449#(<= ~counter~0 17)} assume true; {128449#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:18,087 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {128449#(<= ~counter~0 17)} {128449#(<= ~counter~0 17)} #94#return; {128449#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:18,087 INFO L290 TraceCheckUtils]: 152: Hoare triple {128449#(<= ~counter~0 17)} assume !!(0 != ~r~0); {128449#(<= ~counter~0 17)} is VALID [2022-04-07 14:04:18,088 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-07 14:04:18,088 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-07 14:04:18,089 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-07 14:04:18,089 INFO L290 TraceCheckUtils]: 156: Hoare triple {128474#(<= ~counter~0 18)} ~cond := #in~cond; {128474#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:18,089 INFO L290 TraceCheckUtils]: 157: Hoare triple {128474#(<= ~counter~0 18)} assume !(0 == ~cond); {128474#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:18,089 INFO L290 TraceCheckUtils]: 158: Hoare triple {128474#(<= ~counter~0 18)} assume true; {128474#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:18,090 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {128474#(<= ~counter~0 18)} {128474#(<= ~counter~0 18)} #96#return; {128474#(<= ~counter~0 18)} is VALID [2022-04-07 14:04:18,090 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-07 14:04:18,091 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-07 14:04:18,091 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-07 14:04:18,092 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-07 14:04:18,092 INFO L290 TraceCheckUtils]: 164: Hoare triple {128499#(<= ~counter~0 19)} ~cond := #in~cond; {128499#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:18,092 INFO L290 TraceCheckUtils]: 165: Hoare triple {128499#(<= ~counter~0 19)} assume !(0 == ~cond); {128499#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:18,092 INFO L290 TraceCheckUtils]: 166: Hoare triple {128499#(<= ~counter~0 19)} assume true; {128499#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:18,093 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {128499#(<= ~counter~0 19)} {128499#(<= ~counter~0 19)} #96#return; {128499#(<= ~counter~0 19)} is VALID [2022-04-07 14:04:18,093 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-07 14:04:18,094 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-07 14:04:18,094 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-07 14:04:18,094 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-07 14:04:18,094 INFO L290 TraceCheckUtils]: 172: Hoare triple {128524#(<= ~counter~0 20)} ~cond := #in~cond; {128524#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:18,096 INFO L290 TraceCheckUtils]: 173: Hoare triple {128524#(<= ~counter~0 20)} assume !(0 == ~cond); {128524#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:18,096 INFO L290 TraceCheckUtils]: 174: Hoare triple {128524#(<= ~counter~0 20)} assume true; {128524#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:18,097 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {128524#(<= ~counter~0 20)} {128524#(<= ~counter~0 20)} #96#return; {128524#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:18,097 INFO L290 TraceCheckUtils]: 176: Hoare triple {128524#(<= ~counter~0 20)} assume !(~r~0 > 0); {128524#(<= ~counter~0 20)} is VALID [2022-04-07 14:04:18,098 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-07 14:04:18,098 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-07 14:04:18,098 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-07 14:04:18,098 INFO L290 TraceCheckUtils]: 180: Hoare triple {128549#(<= ~counter~0 21)} ~cond := #in~cond; {128549#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:18,099 INFO L290 TraceCheckUtils]: 181: Hoare triple {128549#(<= ~counter~0 21)} assume !(0 == ~cond); {128549#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:18,099 INFO L290 TraceCheckUtils]: 182: Hoare triple {128549#(<= ~counter~0 21)} assume true; {128549#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:18,099 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {128549#(<= ~counter~0 21)} {128549#(<= ~counter~0 21)} #98#return; {128549#(<= ~counter~0 21)} is VALID [2022-04-07 14:04:18,100 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-07 14:04:18,100 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-07 14:04:18,100 INFO L290 TraceCheckUtils]: 186: Hoare triple {128574#(<= |main_#t~post8| 21)} assume !(#t~post8 < 100);havoc #t~post8; {127993#false} is VALID [2022-04-07 14:04:18,100 INFO L290 TraceCheckUtils]: 187: Hoare triple {127993#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127993#false} is VALID [2022-04-07 14:04:18,100 INFO L290 TraceCheckUtils]: 188: Hoare triple {127993#false} assume !(#t~post6 < 100);havoc #t~post6; {127993#false} is VALID [2022-04-07 14:04:18,100 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-07 14:04:18,100 INFO L290 TraceCheckUtils]: 190: Hoare triple {127993#false} ~cond := #in~cond; {127993#false} is VALID [2022-04-07 14:04:18,100 INFO L290 TraceCheckUtils]: 191: Hoare triple {127993#false} assume 0 == ~cond; {127993#false} is VALID [2022-04-07 14:04:18,100 INFO L290 TraceCheckUtils]: 192: Hoare triple {127993#false} assume !false; {127993#false} is VALID [2022-04-07 14:04:18,101 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-07 14:04:18,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:04:19,355 INFO L290 TraceCheckUtils]: 192: Hoare triple {127993#false} assume !false; {127993#false} is VALID [2022-04-07 14:04:19,355 INFO L290 TraceCheckUtils]: 191: Hoare triple {127993#false} assume 0 == ~cond; {127993#false} is VALID [2022-04-07 14:04:19,355 INFO L290 TraceCheckUtils]: 190: Hoare triple {127993#false} ~cond := #in~cond; {127993#false} is VALID [2022-04-07 14:04:19,355 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-07 14:04:19,355 INFO L290 TraceCheckUtils]: 188: Hoare triple {127993#false} assume !(#t~post6 < 100);havoc #t~post6; {127993#false} is VALID [2022-04-07 14:04:19,355 INFO L290 TraceCheckUtils]: 187: Hoare triple {127993#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127993#false} is VALID [2022-04-07 14:04:19,356 INFO L290 TraceCheckUtils]: 186: Hoare triple {128614#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {127993#false} is VALID [2022-04-07 14:04:19,356 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-07 14:04:19,356 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-07 14:04:19,357 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {127992#true} {128618#(< ~counter~0 100)} #98#return; {128618#(< ~counter~0 100)} is VALID [2022-04-07 14:04:19,357 INFO L290 TraceCheckUtils]: 182: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,357 INFO L290 TraceCheckUtils]: 181: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,357 INFO L290 TraceCheckUtils]: 180: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,357 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-07 14:04:19,357 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-07 14:04:19,359 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-07 14:04:19,359 INFO L290 TraceCheckUtils]: 176: Hoare triple {128643#(< ~counter~0 99)} assume !(~r~0 > 0); {128643#(< ~counter~0 99)} is VALID [2022-04-07 14:04:19,359 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {127992#true} {128643#(< ~counter~0 99)} #96#return; {128643#(< ~counter~0 99)} is VALID [2022-04-07 14:04:19,359 INFO L290 TraceCheckUtils]: 174: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,359 INFO L290 TraceCheckUtils]: 173: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,359 INFO L290 TraceCheckUtils]: 172: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,359 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-07 14:04:19,360 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-07 14:04:19,360 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-07 14:04:19,361 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-07 14:04:19,361 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {127992#true} {128668#(< ~counter~0 98)} #96#return; {128668#(< ~counter~0 98)} is VALID [2022-04-07 14:04:19,361 INFO L290 TraceCheckUtils]: 166: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,361 INFO L290 TraceCheckUtils]: 165: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,361 INFO L290 TraceCheckUtils]: 164: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,361 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-07 14:04:19,361 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-07 14:04:19,362 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-07 14:04:19,362 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-07 14:04:19,363 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {127992#true} {128693#(< ~counter~0 97)} #96#return; {128693#(< ~counter~0 97)} is VALID [2022-04-07 14:04:19,363 INFO L290 TraceCheckUtils]: 158: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,363 INFO L290 TraceCheckUtils]: 157: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,363 INFO L290 TraceCheckUtils]: 156: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,363 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-07 14:04:19,363 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-07 14:04:19,364 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-07 14:04:19,364 INFO L290 TraceCheckUtils]: 152: Hoare triple {128718#(< ~counter~0 96)} assume !!(0 != ~r~0); {128718#(< ~counter~0 96)} is VALID [2022-04-07 14:04:19,365 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {127992#true} {128718#(< ~counter~0 96)} #94#return; {128718#(< ~counter~0 96)} is VALID [2022-04-07 14:04:19,365 INFO L290 TraceCheckUtils]: 150: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,365 INFO L290 TraceCheckUtils]: 149: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,365 INFO L290 TraceCheckUtils]: 148: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,365 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-07 14:04:19,365 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-07 14:04:19,366 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-07 14:04:19,366 INFO L290 TraceCheckUtils]: 144: Hoare triple {128743#(< ~counter~0 95)} assume !(~r~0 < 0); {128743#(< ~counter~0 95)} is VALID [2022-04-07 14:04:19,367 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {127992#true} {128743#(< ~counter~0 95)} #98#return; {128743#(< ~counter~0 95)} is VALID [2022-04-07 14:04:19,367 INFO L290 TraceCheckUtils]: 142: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,367 INFO L290 TraceCheckUtils]: 141: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,367 INFO L290 TraceCheckUtils]: 140: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,367 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-07 14:04:19,367 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-07 14:04:19,368 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-07 14:04:19,368 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-07 14:04:19,368 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {127992#true} {128768#(< ~counter~0 94)} #98#return; {128768#(< ~counter~0 94)} is VALID [2022-04-07 14:04:19,368 INFO L290 TraceCheckUtils]: 134: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,368 INFO L290 TraceCheckUtils]: 133: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,369 INFO L290 TraceCheckUtils]: 132: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,369 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-07 14:04:19,369 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-07 14:04:19,369 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-07 14:04:19,370 INFO L290 TraceCheckUtils]: 128: Hoare triple {128793#(< ~counter~0 93)} assume !(~r~0 > 0); {128793#(< ~counter~0 93)} is VALID [2022-04-07 14:04:19,370 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {127992#true} {128793#(< ~counter~0 93)} #96#return; {128793#(< ~counter~0 93)} is VALID [2022-04-07 14:04:19,370 INFO L290 TraceCheckUtils]: 126: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,370 INFO L290 TraceCheckUtils]: 125: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,370 INFO L290 TraceCheckUtils]: 124: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,370 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-07 14:04:19,371 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-07 14:04:19,371 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-07 14:04:19,372 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-07 14:04:19,372 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {127992#true} {128818#(< ~counter~0 92)} #96#return; {128818#(< ~counter~0 92)} is VALID [2022-04-07 14:04:19,372 INFO L290 TraceCheckUtils]: 118: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,372 INFO L290 TraceCheckUtils]: 117: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,372 INFO L290 TraceCheckUtils]: 116: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,372 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-07 14:04:19,372 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-07 14:04:19,373 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-07 14:04:19,375 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-07 14:04:19,376 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {127992#true} {128843#(< ~counter~0 91)} #96#return; {128843#(< ~counter~0 91)} is VALID [2022-04-07 14:04:19,376 INFO L290 TraceCheckUtils]: 110: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,376 INFO L290 TraceCheckUtils]: 109: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,376 INFO L290 TraceCheckUtils]: 108: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,376 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-07 14:04:19,376 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-07 14:04:19,377 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-07 14:04:19,377 INFO L290 TraceCheckUtils]: 104: Hoare triple {128868#(< ~counter~0 90)} assume !!(0 != ~r~0); {128868#(< ~counter~0 90)} is VALID [2022-04-07 14:04:19,378 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {127992#true} {128868#(< ~counter~0 90)} #94#return; {128868#(< ~counter~0 90)} is VALID [2022-04-07 14:04:19,378 INFO L290 TraceCheckUtils]: 102: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,378 INFO L290 TraceCheckUtils]: 101: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,378 INFO L290 TraceCheckUtils]: 100: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,378 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-07 14:04:19,378 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-07 14:04:19,379 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-07 14:04:19,379 INFO L290 TraceCheckUtils]: 96: Hoare triple {128893#(< ~counter~0 89)} assume !(~r~0 < 0); {128893#(< ~counter~0 89)} is VALID [2022-04-07 14:04:19,380 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {127992#true} {128893#(< ~counter~0 89)} #98#return; {128893#(< ~counter~0 89)} is VALID [2022-04-07 14:04:19,380 INFO L290 TraceCheckUtils]: 94: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,380 INFO L290 TraceCheckUtils]: 93: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,380 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-07 14:04:19,380 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-07 14:04:19,381 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-07 14:04:19,381 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-07 14:04:19,382 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {127992#true} {128918#(< ~counter~0 88)} #98#return; {128918#(< ~counter~0 88)} is VALID [2022-04-07 14:04:19,382 INFO L290 TraceCheckUtils]: 86: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,382 INFO L290 TraceCheckUtils]: 85: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,382 INFO L290 TraceCheckUtils]: 84: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,382 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-07 14:04:19,382 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-07 14:04:19,383 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-07 14:04:19,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {128943#(< ~counter~0 87)} assume !(~r~0 > 0); {128943#(< ~counter~0 87)} is VALID [2022-04-07 14:04:19,384 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {127992#true} {128943#(< ~counter~0 87)} #96#return; {128943#(< ~counter~0 87)} is VALID [2022-04-07 14:04:19,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,384 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-07 14:04:19,385 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-07 14:04:19,385 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-07 14:04:19,386 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-07 14:04:19,386 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {127992#true} {128968#(< ~counter~0 86)} #96#return; {128968#(< ~counter~0 86)} is VALID [2022-04-07 14:04:19,386 INFO L290 TraceCheckUtils]: 70: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,386 INFO L290 TraceCheckUtils]: 69: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,386 INFO L290 TraceCheckUtils]: 68: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,386 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-07 14:04:19,387 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-07 14:04:19,387 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-07 14:04:19,388 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-07 14:04:19,388 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {127992#true} {128993#(< ~counter~0 85)} #96#return; {128993#(< ~counter~0 85)} is VALID [2022-04-07 14:04:19,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,388 INFO L290 TraceCheckUtils]: 60: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,388 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-07 14:04:19,389 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-07 14:04:19,390 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-07 14:04:19,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {129018#(< ~counter~0 84)} assume !!(0 != ~r~0); {129018#(< ~counter~0 84)} is VALID [2022-04-07 14:04:19,390 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {127992#true} {129018#(< ~counter~0 84)} #94#return; {129018#(< ~counter~0 84)} is VALID [2022-04-07 14:04:19,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,391 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-07 14:04:19,391 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-07 14:04:19,392 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-07 14:04:19,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {129043#(< ~counter~0 83)} assume !(~r~0 < 0); {129043#(< ~counter~0 83)} is VALID [2022-04-07 14:04:19,393 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {127992#true} {129043#(< ~counter~0 83)} #98#return; {129043#(< ~counter~0 83)} is VALID [2022-04-07 14:04:19,393 INFO L290 TraceCheckUtils]: 46: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,393 INFO L290 TraceCheckUtils]: 45: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,393 INFO L290 TraceCheckUtils]: 44: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,393 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-07 14:04:19,393 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-07 14:04:19,394 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-07 14:04:19,394 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-07 14:04:19,395 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {127992#true} {129068#(< ~counter~0 82)} #98#return; {129068#(< ~counter~0 82)} is VALID [2022-04-07 14:04:19,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,395 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-07 14:04:19,395 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-07 14:04:19,396 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-07 14:04:19,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {129093#(< ~counter~0 81)} assume !(~r~0 > 0); {129093#(< ~counter~0 81)} is VALID [2022-04-07 14:04:19,397 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {127992#true} {129093#(< ~counter~0 81)} #96#return; {129093#(< ~counter~0 81)} is VALID [2022-04-07 14:04:19,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,397 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-07 14:04:19,397 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-07 14:04:19,398 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-07 14:04:19,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {129118#(< ~counter~0 80)} assume !!(0 != ~r~0); {129118#(< ~counter~0 80)} is VALID [2022-04-07 14:04:19,399 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {127992#true} {129118#(< ~counter~0 80)} #94#return; {129118#(< ~counter~0 80)} is VALID [2022-04-07 14:04:19,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,399 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-07 14:04:19,399 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-07 14:04:19,400 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-07 14:04:19,400 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-07 14:04:19,400 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {127992#true} {129143#(< ~counter~0 79)} #92#return; {129143#(< ~counter~0 79)} is VALID [2022-04-07 14:04:19,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,400 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-07 14:04:19,401 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {127992#true} {129143#(< ~counter~0 79)} #90#return; {129143#(< ~counter~0 79)} is VALID [2022-04-07 14:04:19,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {127992#true} assume true; {127992#true} is VALID [2022-04-07 14:04:19,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {127992#true} assume !(0 == ~cond); {127992#true} is VALID [2022-04-07 14:04:19,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {127992#true} ~cond := #in~cond; {127992#true} is VALID [2022-04-07 14:04:19,401 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-07 14:04:19,401 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-07 14:04:19,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {129143#(< ~counter~0 79)} call #t~ret9 := main(); {129143#(< ~counter~0 79)} is VALID [2022-04-07 14:04:19,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {129143#(< ~counter~0 79)} {127992#true} #102#return; {129143#(< ~counter~0 79)} is VALID [2022-04-07 14:04:19,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {129143#(< ~counter~0 79)} assume true; {129143#(< ~counter~0 79)} is VALID [2022-04-07 14:04:19,402 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-07 14:04:19,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {127992#true} call ULTIMATE.init(); {127992#true} is VALID [2022-04-07 14:04:19,403 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-07 14:04:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:04:19,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708129904] [2022-04-07 14:04:19,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:04:19,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266724513] [2022-04-07 14:04:19,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266724513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:04:19,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:04:19,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2022-04-07 14:04:19,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581618585] [2022-04-07 14:04:19,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:04:19,404 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-07 14:04:19,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:04:19,405 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-07 14:04:19,633 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-07 14:04:19,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-07 14:04:19,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:04:19,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-07 14:04:19,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2022-04-07 14:04:19,634 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-07 14:04:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:04:45,865 INFO L93 Difference]: Finished difference Result 14792 states and 21463 transitions. [2022-04-07 14:04:45,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-04-07 14:04:45,866 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-07 14:04:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:04:45,866 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-07 14:04:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-07 14:04:45,875 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-07 14:04:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1004 transitions. [2022-04-07 14:04:45,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 1004 transitions. [2022-04-07 14:04:46,699 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-07 14:04:48,990 INFO L225 Difference]: With dead ends: 14792 [2022-04-07 14:04:48,990 INFO L226 Difference]: Without dead ends: 7697 [2022-04-07 14:04:49,003 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2864, Invalid=4968, Unknown=0, NotChecked=0, Total=7832 [2022-04-07 14:04:49,004 INFO L913 BasicCegarLoop]: 159 mSDtfsCounter, 1857 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 1237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 1.7s IncrementalHoareTripleChecker+Time [2022-04-07 14:04:49,004 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1857 Valid, 843 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1237 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-07 14:04:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2022-04-07 14:05:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 7470. [2022-04-07 14:05:00,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:05:00,461 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-07 14:05:00,466 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-07 14:05:00,470 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-07 14:05:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:05:02,112 INFO L93 Difference]: Finished difference Result 7697 states and 10470 transitions. [2022-04-07 14:05:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 10470 transitions. [2022-04-07 14:05:02,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:05:02,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:05:02,127 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-07 14:05:02,131 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-07 14:05:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:05:03,803 INFO L93 Difference]: Finished difference Result 7697 states and 10470 transitions. [2022-04-07 14:05:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 7697 states and 10470 transitions. [2022-04-07 14:05:03,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:05:03,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:05:03,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:05:03,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:05:03,819 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-07 14:05:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 10264 transitions. [2022-04-07 14:05:06,024 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 10264 transitions. Word has length 193 [2022-04-07 14:05:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:05:06,024 INFO L478 AbstractCegarLoop]: Abstraction has 7470 states and 10264 transitions. [2022-04-07 14:05:06,024 INFO L479 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-07 14:05:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 10264 transitions. [2022-04-07 14:05:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-04-07 14:05:06,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:05:06,029 INFO L499 BasicCegarLoop]: 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-07 14:05:06,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-07 14:05:06,229 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:05:06,230 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:05:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:05:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1172412185, now seen corresponding path program 2 times [2022-04-07 14:05:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:05:06,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516036792] [2022-04-07 14:05:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:05:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:05:06,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:05:06,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744691364] [2022-04-07 14:05:06,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 14:05:06,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:05:06,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:05:06,251 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-07 14:05:06,252 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-07 14:05:06,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 14:05:06,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:05:06,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-07 14:05:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:05:06,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:05:07,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {176020#true} call ULTIMATE.init(); {176020#true} is VALID [2022-04-07 14:05:07,403 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-07 14:05:07,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {176028#(<= ~counter~0 0)} assume true; {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176028#(<= ~counter~0 0)} {176020#true} #102#return; {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {176028#(<= ~counter~0 0)} call #t~ret9 := main(); {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,404 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-07 14:05:07,404 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-07 14:05:07,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {176028#(<= ~counter~0 0)} ~cond := #in~cond; {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {176028#(<= ~counter~0 0)} assume !(0 == ~cond); {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {176028#(<= ~counter~0 0)} assume true; {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176028#(<= ~counter~0 0)} {176028#(<= ~counter~0 0)} #90#return; {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,405 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-07 14:05:07,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {176028#(<= ~counter~0 0)} ~cond := #in~cond; {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {176028#(<= ~counter~0 0)} assume !(0 == ~cond); {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {176028#(<= ~counter~0 0)} assume true; {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,407 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176028#(<= ~counter~0 0)} {176028#(<= ~counter~0 0)} #92#return; {176028#(<= ~counter~0 0)} is VALID [2022-04-07 14:05:07,407 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-07 14:05:07,409 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-07 14:05:07,409 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-07 14:05:07,409 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-07 14:05:07,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {176077#(<= ~counter~0 1)} ~cond := #in~cond; {176077#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:07,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {176077#(<= ~counter~0 1)} assume !(0 == ~cond); {176077#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:07,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {176077#(<= ~counter~0 1)} assume true; {176077#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:07,411 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176077#(<= ~counter~0 1)} {176077#(<= ~counter~0 1)} #94#return; {176077#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:07,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {176077#(<= ~counter~0 1)} assume !!(0 != ~r~0); {176077#(<= ~counter~0 1)} is VALID [2022-04-07 14:05:07,412 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-07 14:05:07,412 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-07 14:05:07,412 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-07 14:05:07,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {176102#(<= ~counter~0 2)} ~cond := #in~cond; {176102#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:07,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {176102#(<= ~counter~0 2)} assume !(0 == ~cond); {176102#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:07,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {176102#(<= ~counter~0 2)} assume true; {176102#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:07,413 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176102#(<= ~counter~0 2)} {176102#(<= ~counter~0 2)} #96#return; {176102#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:07,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {176102#(<= ~counter~0 2)} assume !(~r~0 > 0); {176102#(<= ~counter~0 2)} is VALID [2022-04-07 14:05:07,414 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-07 14:05:07,415 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-07 14:05:07,415 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-07 14:05:07,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {176127#(<= ~counter~0 3)} ~cond := #in~cond; {176127#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:07,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {176127#(<= ~counter~0 3)} assume !(0 == ~cond); {176127#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:07,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {176127#(<= ~counter~0 3)} assume true; {176127#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:07,416 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176127#(<= ~counter~0 3)} {176127#(<= ~counter~0 3)} #98#return; {176127#(<= ~counter~0 3)} is VALID [2022-04-07 14:05:07,417 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-07 14:05:07,417 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-07 14:05:07,418 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-07 14:05:07,418 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-07 14:05:07,418 INFO L290 TraceCheckUtils]: 44: Hoare triple {176152#(<= ~counter~0 4)} ~cond := #in~cond; {176152#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:07,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {176152#(<= ~counter~0 4)} assume !(0 == ~cond); {176152#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:07,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {176152#(<= ~counter~0 4)} assume true; {176152#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:07,419 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176152#(<= ~counter~0 4)} {176152#(<= ~counter~0 4)} #98#return; {176152#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:07,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {176152#(<= ~counter~0 4)} assume !(~r~0 < 0); {176152#(<= ~counter~0 4)} is VALID [2022-04-07 14:05:07,420 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-07 14:05:07,420 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-07 14:05:07,421 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-07 14:05:07,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {176177#(<= ~counter~0 5)} ~cond := #in~cond; {176177#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:07,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {176177#(<= ~counter~0 5)} assume !(0 == ~cond); {176177#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:07,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {176177#(<= ~counter~0 5)} assume true; {176177#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:07,422 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176177#(<= ~counter~0 5)} {176177#(<= ~counter~0 5)} #94#return; {176177#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:07,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {176177#(<= ~counter~0 5)} assume !!(0 != ~r~0); {176177#(<= ~counter~0 5)} is VALID [2022-04-07 14:05:07,423 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-07 14:05:07,423 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-07 14:05:07,424 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-07 14:05:07,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {176202#(<= ~counter~0 6)} ~cond := #in~cond; {176202#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:07,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {176202#(<= ~counter~0 6)} assume !(0 == ~cond); {176202#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:07,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {176202#(<= ~counter~0 6)} assume true; {176202#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:07,425 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176202#(<= ~counter~0 6)} {176202#(<= ~counter~0 6)} #96#return; {176202#(<= ~counter~0 6)} is VALID [2022-04-07 14:05:07,425 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-07 14:05:07,426 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-07 14:05:07,426 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-07 14:05:07,427 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-07 14:05:07,427 INFO L290 TraceCheckUtils]: 68: Hoare triple {176227#(<= ~counter~0 7)} ~cond := #in~cond; {176227#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:07,427 INFO L290 TraceCheckUtils]: 69: Hoare triple {176227#(<= ~counter~0 7)} assume !(0 == ~cond); {176227#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:07,427 INFO L290 TraceCheckUtils]: 70: Hoare triple {176227#(<= ~counter~0 7)} assume true; {176227#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:07,428 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176227#(<= ~counter~0 7)} {176227#(<= ~counter~0 7)} #96#return; {176227#(<= ~counter~0 7)} is VALID [2022-04-07 14:05:07,428 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-07 14:05:07,429 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-07 14:05:07,429 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-07 14:05:07,429 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-07 14:05:07,430 INFO L290 TraceCheckUtils]: 76: Hoare triple {176252#(<= ~counter~0 8)} ~cond := #in~cond; {176252#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:07,430 INFO L290 TraceCheckUtils]: 77: Hoare triple {176252#(<= ~counter~0 8)} assume !(0 == ~cond); {176252#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:07,430 INFO L290 TraceCheckUtils]: 78: Hoare triple {176252#(<= ~counter~0 8)} assume true; {176252#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:07,431 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176252#(<= ~counter~0 8)} {176252#(<= ~counter~0 8)} #96#return; {176252#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:07,431 INFO L290 TraceCheckUtils]: 80: Hoare triple {176252#(<= ~counter~0 8)} assume !(~r~0 > 0); {176252#(<= ~counter~0 8)} is VALID [2022-04-07 14:05:07,432 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-07 14:05:07,432 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-07 14:05:07,432 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-07 14:05:07,432 INFO L290 TraceCheckUtils]: 84: Hoare triple {176277#(<= ~counter~0 9)} ~cond := #in~cond; {176277#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:07,433 INFO L290 TraceCheckUtils]: 85: Hoare triple {176277#(<= ~counter~0 9)} assume !(0 == ~cond); {176277#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:07,433 INFO L290 TraceCheckUtils]: 86: Hoare triple {176277#(<= ~counter~0 9)} assume true; {176277#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:07,433 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176277#(<= ~counter~0 9)} {176277#(<= ~counter~0 9)} #98#return; {176277#(<= ~counter~0 9)} is VALID [2022-04-07 14:05:07,434 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-07 14:05:07,434 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-07 14:05:07,435 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-07 14:05:07,435 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-07 14:05:07,435 INFO L290 TraceCheckUtils]: 92: Hoare triple {176302#(<= ~counter~0 10)} ~cond := #in~cond; {176302#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:07,436 INFO L290 TraceCheckUtils]: 93: Hoare triple {176302#(<= ~counter~0 10)} assume !(0 == ~cond); {176302#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:07,436 INFO L290 TraceCheckUtils]: 94: Hoare triple {176302#(<= ~counter~0 10)} assume true; {176302#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:07,436 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176302#(<= ~counter~0 10)} {176302#(<= ~counter~0 10)} #98#return; {176302#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:07,436 INFO L290 TraceCheckUtils]: 96: Hoare triple {176302#(<= ~counter~0 10)} assume !(~r~0 < 0); {176302#(<= ~counter~0 10)} is VALID [2022-04-07 14:05:07,437 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-07 14:05:07,437 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-07 14:05:07,438 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-07 14:05:07,438 INFO L290 TraceCheckUtils]: 100: Hoare triple {176327#(<= ~counter~0 11)} ~cond := #in~cond; {176327#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:07,438 INFO L290 TraceCheckUtils]: 101: Hoare triple {176327#(<= ~counter~0 11)} assume !(0 == ~cond); {176327#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:07,439 INFO L290 TraceCheckUtils]: 102: Hoare triple {176327#(<= ~counter~0 11)} assume true; {176327#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:07,439 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176327#(<= ~counter~0 11)} {176327#(<= ~counter~0 11)} #94#return; {176327#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:07,439 INFO L290 TraceCheckUtils]: 104: Hoare triple {176327#(<= ~counter~0 11)} assume !!(0 != ~r~0); {176327#(<= ~counter~0 11)} is VALID [2022-04-07 14:05:07,440 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-07 14:05:07,440 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-07 14:05:07,441 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-07 14:05:07,441 INFO L290 TraceCheckUtils]: 108: Hoare triple {176352#(<= ~counter~0 12)} ~cond := #in~cond; {176352#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:07,441 INFO L290 TraceCheckUtils]: 109: Hoare triple {176352#(<= ~counter~0 12)} assume !(0 == ~cond); {176352#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:07,441 INFO L290 TraceCheckUtils]: 110: Hoare triple {176352#(<= ~counter~0 12)} assume true; {176352#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:07,443 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176352#(<= ~counter~0 12)} {176352#(<= ~counter~0 12)} #96#return; {176352#(<= ~counter~0 12)} is VALID [2022-04-07 14:05:07,444 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-07 14:05:07,445 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-07 14:05:07,445 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-07 14:05:07,445 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-07 14:05:07,445 INFO L290 TraceCheckUtils]: 116: Hoare triple {176377#(<= ~counter~0 13)} ~cond := #in~cond; {176377#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:07,446 INFO L290 TraceCheckUtils]: 117: Hoare triple {176377#(<= ~counter~0 13)} assume !(0 == ~cond); {176377#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:07,447 INFO L290 TraceCheckUtils]: 118: Hoare triple {176377#(<= ~counter~0 13)} assume true; {176377#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:07,447 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176377#(<= ~counter~0 13)} {176377#(<= ~counter~0 13)} #96#return; {176377#(<= ~counter~0 13)} is VALID [2022-04-07 14:05:07,447 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-07 14:05:07,448 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-07 14:05:07,448 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-07 14:05:07,449 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-07 14:05:07,449 INFO L290 TraceCheckUtils]: 124: Hoare triple {176402#(<= ~counter~0 14)} ~cond := #in~cond; {176402#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:07,449 INFO L290 TraceCheckUtils]: 125: Hoare triple {176402#(<= ~counter~0 14)} assume !(0 == ~cond); {176402#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:07,449 INFO L290 TraceCheckUtils]: 126: Hoare triple {176402#(<= ~counter~0 14)} assume true; {176402#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:07,450 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176402#(<= ~counter~0 14)} {176402#(<= ~counter~0 14)} #96#return; {176402#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:07,450 INFO L290 TraceCheckUtils]: 128: Hoare triple {176402#(<= ~counter~0 14)} assume !(~r~0 > 0); {176402#(<= ~counter~0 14)} is VALID [2022-04-07 14:05:07,451 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-07 14:05:07,451 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-07 14:05:07,452 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-07 14:05:07,452 INFO L290 TraceCheckUtils]: 132: Hoare triple {176427#(<= ~counter~0 15)} ~cond := #in~cond; {176427#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:07,452 INFO L290 TraceCheckUtils]: 133: Hoare triple {176427#(<= ~counter~0 15)} assume !(0 == ~cond); {176427#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:07,452 INFO L290 TraceCheckUtils]: 134: Hoare triple {176427#(<= ~counter~0 15)} assume true; {176427#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:07,453 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176427#(<= ~counter~0 15)} {176427#(<= ~counter~0 15)} #98#return; {176427#(<= ~counter~0 15)} is VALID [2022-04-07 14:05:07,453 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-07 14:05:07,454 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-07 14:05:07,454 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-07 14:05:07,454 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-07 14:05:07,455 INFO L290 TraceCheckUtils]: 140: Hoare triple {176452#(<= ~counter~0 16)} ~cond := #in~cond; {176452#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:07,455 INFO L290 TraceCheckUtils]: 141: Hoare triple {176452#(<= ~counter~0 16)} assume !(0 == ~cond); {176452#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:07,455 INFO L290 TraceCheckUtils]: 142: Hoare triple {176452#(<= ~counter~0 16)} assume true; {176452#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:07,456 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176452#(<= ~counter~0 16)} {176452#(<= ~counter~0 16)} #98#return; {176452#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:07,456 INFO L290 TraceCheckUtils]: 144: Hoare triple {176452#(<= ~counter~0 16)} assume !(~r~0 < 0); {176452#(<= ~counter~0 16)} is VALID [2022-04-07 14:05:07,457 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-07 14:05:07,457 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-07 14:05:07,457 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-07 14:05:07,457 INFO L290 TraceCheckUtils]: 148: Hoare triple {176477#(<= ~counter~0 17)} ~cond := #in~cond; {176477#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:07,458 INFO L290 TraceCheckUtils]: 149: Hoare triple {176477#(<= ~counter~0 17)} assume !(0 == ~cond); {176477#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:07,458 INFO L290 TraceCheckUtils]: 150: Hoare triple {176477#(<= ~counter~0 17)} assume true; {176477#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:07,458 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176477#(<= ~counter~0 17)} {176477#(<= ~counter~0 17)} #94#return; {176477#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:07,459 INFO L290 TraceCheckUtils]: 152: Hoare triple {176477#(<= ~counter~0 17)} assume !!(0 != ~r~0); {176477#(<= ~counter~0 17)} is VALID [2022-04-07 14:05:07,459 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-07 14:05:07,460 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-07 14:05:07,460 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-07 14:05:07,460 INFO L290 TraceCheckUtils]: 156: Hoare triple {176502#(<= ~counter~0 18)} ~cond := #in~cond; {176502#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:07,461 INFO L290 TraceCheckUtils]: 157: Hoare triple {176502#(<= ~counter~0 18)} assume !(0 == ~cond); {176502#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:07,461 INFO L290 TraceCheckUtils]: 158: Hoare triple {176502#(<= ~counter~0 18)} assume true; {176502#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:07,461 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {176502#(<= ~counter~0 18)} {176502#(<= ~counter~0 18)} #96#return; {176502#(<= ~counter~0 18)} is VALID [2022-04-07 14:05:07,461 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-07 14:05:07,462 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-07 14:05:07,462 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-07 14:05:07,463 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-07 14:05:07,463 INFO L290 TraceCheckUtils]: 164: Hoare triple {176527#(<= ~counter~0 19)} ~cond := #in~cond; {176527#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:07,463 INFO L290 TraceCheckUtils]: 165: Hoare triple {176527#(<= ~counter~0 19)} assume !(0 == ~cond); {176527#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:07,464 INFO L290 TraceCheckUtils]: 166: Hoare triple {176527#(<= ~counter~0 19)} assume true; {176527#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:07,464 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {176527#(<= ~counter~0 19)} {176527#(<= ~counter~0 19)} #96#return; {176527#(<= ~counter~0 19)} is VALID [2022-04-07 14:05:07,464 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-07 14:05:07,465 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-07 14:05:07,465 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-07 14:05:07,466 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-07 14:05:07,473 INFO L290 TraceCheckUtils]: 172: Hoare triple {176552#(<= ~counter~0 20)} ~cond := #in~cond; {176552#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:07,474 INFO L290 TraceCheckUtils]: 173: Hoare triple {176552#(<= ~counter~0 20)} assume !(0 == ~cond); {176552#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:07,474 INFO L290 TraceCheckUtils]: 174: Hoare triple {176552#(<= ~counter~0 20)} assume true; {176552#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:07,474 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {176552#(<= ~counter~0 20)} {176552#(<= ~counter~0 20)} #96#return; {176552#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:07,475 INFO L290 TraceCheckUtils]: 176: Hoare triple {176552#(<= ~counter~0 20)} assume !(~r~0 > 0); {176552#(<= ~counter~0 20)} is VALID [2022-04-07 14:05:07,476 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-07 14:05:07,476 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-07 14:05:07,476 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-07 14:05:07,477 INFO L290 TraceCheckUtils]: 180: Hoare triple {176577#(<= ~counter~0 21)} ~cond := #in~cond; {176577#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:07,477 INFO L290 TraceCheckUtils]: 181: Hoare triple {176577#(<= ~counter~0 21)} assume !(0 == ~cond); {176577#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:07,477 INFO L290 TraceCheckUtils]: 182: Hoare triple {176577#(<= ~counter~0 21)} assume true; {176577#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:07,478 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {176577#(<= ~counter~0 21)} {176577#(<= ~counter~0 21)} #98#return; {176577#(<= ~counter~0 21)} is VALID [2022-04-07 14:05:07,478 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-07 14:05:07,479 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-07 14:05:07,479 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-07 14:05:07,480 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-07 14:05:07,480 INFO L290 TraceCheckUtils]: 188: Hoare triple {176602#(<= ~counter~0 22)} ~cond := #in~cond; {176602#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:07,480 INFO L290 TraceCheckUtils]: 189: Hoare triple {176602#(<= ~counter~0 22)} assume !(0 == ~cond); {176602#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:07,480 INFO L290 TraceCheckUtils]: 190: Hoare triple {176602#(<= ~counter~0 22)} assume true; {176602#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:07,481 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {176602#(<= ~counter~0 22)} {176602#(<= ~counter~0 22)} #98#return; {176602#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:07,481 INFO L290 TraceCheckUtils]: 192: Hoare triple {176602#(<= ~counter~0 22)} assume !(~r~0 < 0); {176602#(<= ~counter~0 22)} is VALID [2022-04-07 14:05:07,481 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-07 14:05:07,482 INFO L290 TraceCheckUtils]: 194: Hoare triple {176627#(<= |main_#t~post6| 22)} assume !(#t~post6 < 100);havoc #t~post6; {176021#false} is VALID [2022-04-07 14:05:07,482 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-07 14:05:07,482 INFO L290 TraceCheckUtils]: 196: Hoare triple {176021#false} ~cond := #in~cond; {176021#false} is VALID [2022-04-07 14:05:07,482 INFO L290 TraceCheckUtils]: 197: Hoare triple {176021#false} assume 0 == ~cond; {176021#false} is VALID [2022-04-07 14:05:07,482 INFO L290 TraceCheckUtils]: 198: Hoare triple {176021#false} assume !false; {176021#false} is VALID [2022-04-07 14:05:07,483 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-07 14:05:07,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 14:05:08,755 INFO L290 TraceCheckUtils]: 198: Hoare triple {176021#false} assume !false; {176021#false} is VALID [2022-04-07 14:05:08,755 INFO L290 TraceCheckUtils]: 197: Hoare triple {176021#false} assume 0 == ~cond; {176021#false} is VALID [2022-04-07 14:05:08,756 INFO L290 TraceCheckUtils]: 196: Hoare triple {176021#false} ~cond := #in~cond; {176021#false} is VALID [2022-04-07 14:05:08,756 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-07 14:05:08,756 INFO L290 TraceCheckUtils]: 194: Hoare triple {176655#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {176021#false} is VALID [2022-04-07 14:05:08,756 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-07 14:05:08,756 INFO L290 TraceCheckUtils]: 192: Hoare triple {176659#(< ~counter~0 100)} assume !(~r~0 < 0); {176659#(< ~counter~0 100)} is VALID [2022-04-07 14:05:08,757 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {176020#true} {176659#(< ~counter~0 100)} #98#return; {176659#(< ~counter~0 100)} is VALID [2022-04-07 14:05:08,757 INFO L290 TraceCheckUtils]: 190: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,757 INFO L290 TraceCheckUtils]: 189: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,757 INFO L290 TraceCheckUtils]: 188: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,757 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-07 14:05:08,757 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-07 14:05:08,759 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-07 14:05:08,759 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-07 14:05:08,760 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {176020#true} {176684#(< ~counter~0 99)} #98#return; {176684#(< ~counter~0 99)} is VALID [2022-04-07 14:05:08,760 INFO L290 TraceCheckUtils]: 182: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,760 INFO L290 TraceCheckUtils]: 181: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,760 INFO L290 TraceCheckUtils]: 180: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,760 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-07 14:05:08,760 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-07 14:05:08,761 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-07 14:05:08,761 INFO L290 TraceCheckUtils]: 176: Hoare triple {176709#(< ~counter~0 98)} assume !(~r~0 > 0); {176709#(< ~counter~0 98)} is VALID [2022-04-07 14:05:08,762 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {176020#true} {176709#(< ~counter~0 98)} #96#return; {176709#(< ~counter~0 98)} is VALID [2022-04-07 14:05:08,762 INFO L290 TraceCheckUtils]: 174: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,762 INFO L290 TraceCheckUtils]: 173: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,762 INFO L290 TraceCheckUtils]: 172: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,762 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-07 14:05:08,762 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-07 14:05:08,763 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-07 14:05:08,763 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-07 14:05:08,764 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {176020#true} {176734#(< ~counter~0 97)} #96#return; {176734#(< ~counter~0 97)} is VALID [2022-04-07 14:05:08,764 INFO L290 TraceCheckUtils]: 166: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,764 INFO L290 TraceCheckUtils]: 165: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,764 INFO L290 TraceCheckUtils]: 164: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,764 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-07 14:05:08,767 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-07 14:05:08,768 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-07 14:05:08,768 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-07 14:05:08,768 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {176020#true} {176759#(< ~counter~0 96)} #96#return; {176759#(< ~counter~0 96)} is VALID [2022-04-07 14:05:08,768 INFO L290 TraceCheckUtils]: 158: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,769 INFO L290 TraceCheckUtils]: 157: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,769 INFO L290 TraceCheckUtils]: 156: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,769 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-07 14:05:08,769 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-07 14:05:08,770 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-07 14:05:08,770 INFO L290 TraceCheckUtils]: 152: Hoare triple {176784#(< ~counter~0 95)} assume !!(0 != ~r~0); {176784#(< ~counter~0 95)} is VALID [2022-04-07 14:05:08,770 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {176020#true} {176784#(< ~counter~0 95)} #94#return; {176784#(< ~counter~0 95)} is VALID [2022-04-07 14:05:08,770 INFO L290 TraceCheckUtils]: 150: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,770 INFO L290 TraceCheckUtils]: 149: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,770 INFO L290 TraceCheckUtils]: 148: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,771 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-07 14:05:08,771 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-07 14:05:08,772 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-07 14:05:08,772 INFO L290 TraceCheckUtils]: 144: Hoare triple {176809#(< ~counter~0 94)} assume !(~r~0 < 0); {176809#(< ~counter~0 94)} is VALID [2022-04-07 14:05:08,772 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {176020#true} {176809#(< ~counter~0 94)} #98#return; {176809#(< ~counter~0 94)} is VALID [2022-04-07 14:05:08,772 INFO L290 TraceCheckUtils]: 142: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,772 INFO L290 TraceCheckUtils]: 141: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,772 INFO L290 TraceCheckUtils]: 140: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,772 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-07 14:05:08,773 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-07 14:05:08,773 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-07 14:05:08,774 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-07 14:05:08,774 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {176020#true} {176834#(< ~counter~0 93)} #98#return; {176834#(< ~counter~0 93)} is VALID [2022-04-07 14:05:08,774 INFO L290 TraceCheckUtils]: 134: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,774 INFO L290 TraceCheckUtils]: 133: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,774 INFO L290 TraceCheckUtils]: 132: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,774 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-07 14:05:08,775 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-07 14:05:08,775 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-07 14:05:08,776 INFO L290 TraceCheckUtils]: 128: Hoare triple {176859#(< ~counter~0 92)} assume !(~r~0 > 0); {176859#(< ~counter~0 92)} is VALID [2022-04-07 14:05:08,776 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {176020#true} {176859#(< ~counter~0 92)} #96#return; {176859#(< ~counter~0 92)} is VALID [2022-04-07 14:05:08,776 INFO L290 TraceCheckUtils]: 126: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,776 INFO L290 TraceCheckUtils]: 125: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,776 INFO L290 TraceCheckUtils]: 124: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,776 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-07 14:05:08,776 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-07 14:05:08,777 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-07 14:05:08,777 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-07 14:05:08,778 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {176020#true} {176884#(< ~counter~0 91)} #96#return; {176884#(< ~counter~0 91)} is VALID [2022-04-07 14:05:08,778 INFO L290 TraceCheckUtils]: 118: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,778 INFO L290 TraceCheckUtils]: 117: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,778 INFO L290 TraceCheckUtils]: 116: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,778 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-07 14:05:08,778 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-07 14:05:08,779 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-07 14:05:08,779 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-07 14:05:08,780 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {176020#true} {176909#(< ~counter~0 90)} #96#return; {176909#(< ~counter~0 90)} is VALID [2022-04-07 14:05:08,780 INFO L290 TraceCheckUtils]: 110: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,780 INFO L290 TraceCheckUtils]: 109: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,780 INFO L290 TraceCheckUtils]: 108: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,780 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-07 14:05:08,780 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-07 14:05:08,781 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-07 14:05:08,781 INFO L290 TraceCheckUtils]: 104: Hoare triple {176934#(< ~counter~0 89)} assume !!(0 != ~r~0); {176934#(< ~counter~0 89)} is VALID [2022-04-07 14:05:08,782 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {176020#true} {176934#(< ~counter~0 89)} #94#return; {176934#(< ~counter~0 89)} is VALID [2022-04-07 14:05:08,782 INFO L290 TraceCheckUtils]: 102: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,782 INFO L290 TraceCheckUtils]: 101: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,782 INFO L290 TraceCheckUtils]: 100: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,782 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-07 14:05:08,782 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-07 14:05:08,783 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-07 14:05:08,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {176959#(< ~counter~0 88)} assume !(~r~0 < 0); {176959#(< ~counter~0 88)} is VALID [2022-04-07 14:05:08,784 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {176020#true} {176959#(< ~counter~0 88)} #98#return; {176959#(< ~counter~0 88)} is VALID [2022-04-07 14:05:08,784 INFO L290 TraceCheckUtils]: 94: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,784 INFO L290 TraceCheckUtils]: 93: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,784 INFO L290 TraceCheckUtils]: 92: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,784 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-07 14:05:08,784 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-07 14:05:08,785 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-07 14:05:08,785 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-07 14:05:08,785 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {176020#true} {176984#(< ~counter~0 87)} #98#return; {176984#(< ~counter~0 87)} is VALID [2022-04-07 14:05:08,786 INFO L290 TraceCheckUtils]: 86: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,786 INFO L290 TraceCheckUtils]: 85: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,786 INFO L290 TraceCheckUtils]: 84: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,786 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-07 14:05:08,786 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-07 14:05:08,787 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-07 14:05:08,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {177009#(< ~counter~0 86)} assume !(~r~0 > 0); {177009#(< ~counter~0 86)} is VALID [2022-04-07 14:05:08,787 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {176020#true} {177009#(< ~counter~0 86)} #96#return; {177009#(< ~counter~0 86)} is VALID [2022-04-07 14:05:08,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,788 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-07 14:05:08,788 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-07 14:05:08,788 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-07 14:05:08,789 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-07 14:05:08,789 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {176020#true} {177034#(< ~counter~0 85)} #96#return; {177034#(< ~counter~0 85)} is VALID [2022-04-07 14:05:08,789 INFO L290 TraceCheckUtils]: 70: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,789 INFO L290 TraceCheckUtils]: 69: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,789 INFO L290 TraceCheckUtils]: 68: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,789 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-07 14:05:08,790 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-07 14:05:08,790 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-07 14:05:08,791 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-07 14:05:08,791 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {176020#true} {177059#(< ~counter~0 84)} #96#return; {177059#(< ~counter~0 84)} is VALID [2022-04-07 14:05:08,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,791 INFO L290 TraceCheckUtils]: 61: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,791 INFO L290 TraceCheckUtils]: 60: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,791 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-07 14:05:08,791 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-07 14:05:08,792 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-07 14:05:08,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {177084#(< ~counter~0 83)} assume !!(0 != ~r~0); {177084#(< ~counter~0 83)} is VALID [2022-04-07 14:05:08,793 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {176020#true} {177084#(< ~counter~0 83)} #94#return; {177084#(< ~counter~0 83)} is VALID [2022-04-07 14:05:08,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,793 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-07 14:05:08,793 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-07 14:05:08,794 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-07 14:05:08,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {177109#(< ~counter~0 82)} assume !(~r~0 < 0); {177109#(< ~counter~0 82)} is VALID [2022-04-07 14:05:08,795 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {176020#true} {177109#(< ~counter~0 82)} #98#return; {177109#(< ~counter~0 82)} is VALID [2022-04-07 14:05:08,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,795 INFO L290 TraceCheckUtils]: 45: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,795 INFO L290 TraceCheckUtils]: 44: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,795 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-07 14:05:08,795 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-07 14:05:08,796 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-07 14:05:08,797 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-07 14:05:08,797 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {176020#true} {177134#(< ~counter~0 81)} #98#return; {177134#(< ~counter~0 81)} is VALID [2022-04-07 14:05:08,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,797 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-07 14:05:08,797 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-07 14:05:08,798 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-07 14:05:08,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {177159#(< ~counter~0 80)} assume !(~r~0 > 0); {177159#(< ~counter~0 80)} is VALID [2022-04-07 14:05:08,799 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {176020#true} {177159#(< ~counter~0 80)} #96#return; {177159#(< ~counter~0 80)} is VALID [2022-04-07 14:05:08,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,799 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-07 14:05:08,799 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-07 14:05:08,800 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-07 14:05:08,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {177184#(< ~counter~0 79)} assume !!(0 != ~r~0); {177184#(< ~counter~0 79)} is VALID [2022-04-07 14:05:08,801 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {176020#true} {177184#(< ~counter~0 79)} #94#return; {177184#(< ~counter~0 79)} is VALID [2022-04-07 14:05:08,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,801 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-07 14:05:08,801 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-07 14:05:08,802 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-07 14:05:08,802 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-07 14:05:08,803 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {176020#true} {177209#(< ~counter~0 78)} #92#return; {177209#(< ~counter~0 78)} is VALID [2022-04-07 14:05:08,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,803 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-07 14:05:08,803 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {176020#true} {177209#(< ~counter~0 78)} #90#return; {177209#(< ~counter~0 78)} is VALID [2022-04-07 14:05:08,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {176020#true} assume true; {176020#true} is VALID [2022-04-07 14:05:08,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {176020#true} assume !(0 == ~cond); {176020#true} is VALID [2022-04-07 14:05:08,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {176020#true} ~cond := #in~cond; {176020#true} is VALID [2022-04-07 14:05:08,804 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-07 14:05:08,804 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-07 14:05:08,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {177209#(< ~counter~0 78)} call #t~ret9 := main(); {177209#(< ~counter~0 78)} is VALID [2022-04-07 14:05:08,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177209#(< ~counter~0 78)} {176020#true} #102#return; {177209#(< ~counter~0 78)} is VALID [2022-04-07 14:05:08,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {177209#(< ~counter~0 78)} assume true; {177209#(< ~counter~0 78)} is VALID [2022-04-07 14:05:08,805 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-07 14:05:08,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {176020#true} call ULTIMATE.init(); {176020#true} is VALID [2022-04-07 14:05:08,806 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-07 14:05:08,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 14:05:08,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516036792] [2022-04-07 14:05:08,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 14:05:08,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744691364] [2022-04-07 14:05:08,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744691364] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 14:05:08,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 14:05:08,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-07 14:05:08,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742425865] [2022-04-07 14:05:08,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 14:05:08,814 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-07 14:05:08,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 14:05:08,815 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-07 14:05:09,067 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-07 14:05:09,068 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-07 14:05:09,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 14:05:09,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-07 14:05:09,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-07 14:05:09,069 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-07 14:05:31,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:05:31,455 INFO L93 Difference]: Finished difference Result 8076 states and 11149 transitions. [2022-04-07 14:05:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-04-07 14:05:31,455 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-07 14:05:31,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 14:05:31,456 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-07 14:05:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-07 14:05:31,463 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-07 14:05:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 940 transitions. [2022-04-07 14:05:31,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 940 transitions. [2022-04-07 14:05:32,265 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-07 14:05:34,602 INFO L225 Difference]: With dead ends: 8076 [2022-04-07 14:05:34,602 INFO L226 Difference]: Without dead ends: 7927 [2022-04-07 14:05:34,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3046, Invalid=5326, Unknown=0, NotChecked=0, Total=8372 [2022-04-07 14:05:34,605 INFO L913 BasicCegarLoop]: 165 mSDtfsCounter, 1759 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 1378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 14:05:34,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1759 Valid, 978 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1378 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-07 14:05:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2022-04-07 14:05:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 7220. [2022-04-07 14:05:46,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 14:05:46,431 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-07 14:05:46,435 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-07 14:05:46,440 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-07 14:05:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:05:48,126 INFO L93 Difference]: Finished difference Result 7927 states and 10483 transitions. [2022-04-07 14:05:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 10483 transitions. [2022-04-07 14:05:48,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:05:48,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:05:48,145 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-07 14:05:48,150 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-07 14:05:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 14:05:49,674 INFO L93 Difference]: Finished difference Result 7927 states and 10483 transitions. [2022-04-07 14:05:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 7927 states and 10483 transitions. [2022-04-07 14:05:49,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 14:05:49,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 14:05:49,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 14:05:49,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 14:05:49,691 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-07 14:05:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7220 states to 7220 states and 9583 transitions. [2022-04-07 14:05:51,739 INFO L78 Accepts]: Start accepts. Automaton has 7220 states and 9583 transitions. Word has length 199 [2022-04-07 14:05:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 14:05:51,740 INFO L478 AbstractCegarLoop]: Abstraction has 7220 states and 9583 transitions. [2022-04-07 14:05:51,740 INFO L479 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-07 14:05:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 7220 states and 9583 transitions. [2022-04-07 14:05:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-04-07 14:05:51,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 14:05:51,753 INFO L499 BasicCegarLoop]: 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-07 14:05:51,776 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-07 14:05:51,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:05:51,953 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 14:05:51,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 14:05:51,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2044709741, now seen corresponding path program 11 times [2022-04-07 14:05:51,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 14:05:51,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140985525] [2022-04-07 14:05:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 14:05:51,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 14:05:51,990 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 14:05:51,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402659860] [2022-04-07 14:05:51,990 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 14:05:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 14:05:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 14:05:51,991 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-07 14:05:51,992 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-07 14:05:52,392 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-07 14:05:52,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 14:05:52,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-07 14:05:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 14:05:52,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 14:06:32,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {214713#true} call ULTIMATE.init(); {214713#true} is VALID [2022-04-07 14:06:32,480 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-07 14:06:32,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {214713#true} {214713#true} #102#return; {214713#true} is VALID [2022-04-07 14:06:32,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {214713#true} call #t~ret9 := main(); {214713#true} is VALID [2022-04-07 14:06:32,480 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-07 14:06:32,480 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-07 14:06:32,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,480 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {214713#true} {214713#true} #90#return; {214713#true} is VALID [2022-04-07 14:06:32,480 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-07 14:06:32,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,480 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {214713#true} {214713#true} #92#return; {214713#true} is VALID [2022-04-07 14:06:32,481 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-07 14:06:32,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {214713#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {214713#true} assume !!(#t~post6 < 100);havoc #t~post6; {214713#true} is VALID [2022-04-07 14:06:32,481 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-07 14:06:32,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {214713#true} {214713#true} #94#return; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {214713#true} assume !!(0 != ~r~0); {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {214713#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {214713#true} assume !!(#t~post7 < 100);havoc #t~post7; {214713#true} is VALID [2022-04-07 14:06:32,481 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-07 14:06:32,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {214713#true} {214713#true} #96#return; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {214713#true} assume !(~r~0 > 0); {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {214713#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {214713#true} assume !!(#t~post8 < 100);havoc #t~post8; {214713#true} is VALID [2022-04-07 14:06:32,481 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-07 14:06:32,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,481 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {214713#true} {214713#true} #98#return; {214713#true} is VALID [2022-04-07 14:06:32,482 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-07 14:06:32,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {214713#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {214713#true} assume !!(#t~post8 < 100);havoc #t~post8; {214713#true} is VALID [2022-04-07 14:06:32,482 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-07 14:06:32,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {214713#true} {214713#true} #98#return; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {214713#true} assume !(~r~0 < 0); {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {214713#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {214713#true} assume !!(#t~post6 < 100);havoc #t~post6; {214713#true} is VALID [2022-04-07 14:06:32,482 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-07 14:06:32,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {214713#true} {214713#true} #94#return; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {214713#true} assume !!(0 != ~r~0); {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {214713#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {214713#true} assume !!(#t~post7 < 100);havoc #t~post7; {214713#true} is VALID [2022-04-07 14:06:32,482 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-07 14:06:32,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,483 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {214713#true} {214713#true} #96#return; {214713#true} is VALID [2022-04-07 14:06:32,484 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-07 14:06:32,484 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-07 14:06:32,484 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-07 14:06:32,484 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-07 14:06:32,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,485 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-07 14:06:32,486 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-07 14:06:32,486 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-07 14:06:32,486 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-07 14:06:32,486 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-07 14:06:32,486 INFO L290 TraceCheckUtils]: 76: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,486 INFO L290 TraceCheckUtils]: 77: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,486 INFO L290 TraceCheckUtils]: 78: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,487 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-07 14:06:32,487 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-07 14:06:32,487 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-07 14:06:32,488 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-07 14:06:32,488 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-07 14:06:32,488 INFO L290 TraceCheckUtils]: 84: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,488 INFO L290 TraceCheckUtils]: 85: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,488 INFO L290 TraceCheckUtils]: 86: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,488 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-07 14:06:32,490 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-07 14:06:32,491 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-07 14:06:32,491 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-07 14:06:32,491 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-07 14:06:32,491 INFO L290 TraceCheckUtils]: 92: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,491 INFO L290 TraceCheckUtils]: 93: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,491 INFO L290 TraceCheckUtils]: 94: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,492 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-07 14:06:32,492 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-07 14:06:32,493 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-07 14:06:32,493 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-07 14:06:32,493 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-07 14:06:32,493 INFO L290 TraceCheckUtils]: 100: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,493 INFO L290 TraceCheckUtils]: 101: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,493 INFO L290 TraceCheckUtils]: 102: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,493 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-07 14:06:32,494 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-07 14:06:32,494 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-07 14:06:32,494 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-07 14:06:32,494 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-07 14:06:32,495 INFO L290 TraceCheckUtils]: 108: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,495 INFO L290 TraceCheckUtils]: 109: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,495 INFO L290 TraceCheckUtils]: 110: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,495 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-07 14:06:32,496 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-07 14:06:32,496 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-07 14:06:32,496 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-07 14:06:32,497 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-07 14:06:32,497 INFO L290 TraceCheckUtils]: 116: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,497 INFO L290 TraceCheckUtils]: 117: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,497 INFO L290 TraceCheckUtils]: 118: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,497 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-07 14:06:32,497 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-07 14:06:32,498 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-07 14:06:32,498 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-07 14:06:32,498 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-07 14:06:32,498 INFO L290 TraceCheckUtils]: 124: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,498 INFO L290 TraceCheckUtils]: 125: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,498 INFO L290 TraceCheckUtils]: 126: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,499 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-07 14:06:32,500 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#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,500 INFO L290 TraceCheckUtils]: 129: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,501 INFO L290 TraceCheckUtils]: 130: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,501 INFO L272 TraceCheckUtils]: 131: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 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-07 14:06:32,501 INFO L290 TraceCheckUtils]: 132: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,501 INFO L290 TraceCheckUtils]: 133: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,501 INFO L290 TraceCheckUtils]: 134: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,501 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {214713#true} {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #98#return; {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,501 INFO L290 TraceCheckUtils]: 136: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !(~r~0 < 0); {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,502 INFO L290 TraceCheckUtils]: 137: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,502 INFO L290 TraceCheckUtils]: 138: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,502 INFO L272 TraceCheckUtils]: 139: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 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-07 14:06:32,502 INFO L290 TraceCheckUtils]: 140: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,502 INFO L290 TraceCheckUtils]: 141: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,502 INFO L290 TraceCheckUtils]: 142: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,503 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {214713#true} {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #94#return; {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,503 INFO L290 TraceCheckUtils]: 144: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(0 != ~r~0); {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,503 INFO L290 TraceCheckUtils]: 145: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,504 INFO L290 TraceCheckUtils]: 146: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,504 INFO L272 TraceCheckUtils]: 147: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 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-07 14:06:32,504 INFO L290 TraceCheckUtils]: 148: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,504 INFO L290 TraceCheckUtils]: 149: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,504 INFO L290 TraceCheckUtils]: 150: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,504 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {214713#true} {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} #96#return; {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} is VALID [2022-04-07 14:06:32,505 INFO L290 TraceCheckUtils]: 152: Hoare triple {215106#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) 1) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,505 INFO L290 TraceCheckUtils]: 153: Hoare triple {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,506 INFO L290 TraceCheckUtils]: 154: Hoare triple {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,506 INFO L272 TraceCheckUtils]: 155: Hoare triple {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) 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-07 14:06:32,506 INFO L290 TraceCheckUtils]: 156: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,506 INFO L290 TraceCheckUtils]: 157: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,506 INFO L290 TraceCheckUtils]: 158: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,506 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {214713#true} {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #96#return; {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,507 INFO L290 TraceCheckUtils]: 160: Hoare triple {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !(~r~0 > 0); {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,507 INFO L290 TraceCheckUtils]: 161: Hoare triple {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,507 INFO L290 TraceCheckUtils]: 162: Hoare triple {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,507 INFO L272 TraceCheckUtils]: 163: Hoare triple {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) 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-07 14:06:32,507 INFO L290 TraceCheckUtils]: 164: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,507 INFO L290 TraceCheckUtils]: 165: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,508 INFO L290 TraceCheckUtils]: 166: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,508 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {214713#true} {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} #98#return; {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,509 INFO L290 TraceCheckUtils]: 168: Hoare triple {215179#(< (+ 3 (div (+ main_~v~0 main_~r~0 (- 3) (* (- 2) main_~u~0)) (- 3))) main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,510 INFO L290 TraceCheckUtils]: 169: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,510 INFO L290 TraceCheckUtils]: 170: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,510 INFO L272 TraceCheckUtils]: 171: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) 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-07 14:06:32,510 INFO L290 TraceCheckUtils]: 172: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,510 INFO L290 TraceCheckUtils]: 173: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,510 INFO L290 TraceCheckUtils]: 174: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,511 INFO L284 TraceCheckUtils]: 175: Hoare quadruple {214713#true} {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #98#return; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,511 INFO L290 TraceCheckUtils]: 176: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !(~r~0 < 0); {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,511 INFO L290 TraceCheckUtils]: 177: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,512 INFO L290 TraceCheckUtils]: 178: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,512 INFO L272 TraceCheckUtils]: 179: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) 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-07 14:06:32,512 INFO L290 TraceCheckUtils]: 180: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,512 INFO L290 TraceCheckUtils]: 181: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,512 INFO L290 TraceCheckUtils]: 182: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,512 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {214713#true} {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #94#return; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,513 INFO L290 TraceCheckUtils]: 184: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(0 != ~r~0); {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,513 INFO L290 TraceCheckUtils]: 185: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,513 INFO L290 TraceCheckUtils]: 186: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,513 INFO L272 TraceCheckUtils]: 187: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) 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-07 14:06:32,513 INFO L290 TraceCheckUtils]: 188: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,513 INFO L290 TraceCheckUtils]: 189: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,513 INFO L290 TraceCheckUtils]: 190: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,514 INFO L284 TraceCheckUtils]: 191: Hoare quadruple {214713#true} {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} #96#return; {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} is VALID [2022-04-07 14:06:32,514 INFO L290 TraceCheckUtils]: 192: Hoare triple {215228#(< (+ main_~u~0 1 (div (+ main_~v~0 main_~r~0 (- 3)) (- 3))) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:06:32,515 INFO L290 TraceCheckUtils]: 193: Hoare triple {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:06:32,515 INFO L290 TraceCheckUtils]: 194: Hoare triple {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:06:32,515 INFO L272 TraceCheckUtils]: 195: Hoare triple {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) 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-07 14:06:32,515 INFO L290 TraceCheckUtils]: 196: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,515 INFO L290 TraceCheckUtils]: 197: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,515 INFO L290 TraceCheckUtils]: 198: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,516 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {214713#true} {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #96#return; {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:06:32,516 INFO L290 TraceCheckUtils]: 200: Hoare triple {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !(~r~0 > 0); {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:06:32,516 INFO L290 TraceCheckUtils]: 201: Hoare triple {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:06:32,517 INFO L290 TraceCheckUtils]: 202: Hoare triple {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:06:32,517 INFO L272 TraceCheckUtils]: 203: Hoare triple {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) 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-07 14:06:32,517 INFO L290 TraceCheckUtils]: 204: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,517 INFO L290 TraceCheckUtils]: 205: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,517 INFO L290 TraceCheckUtils]: 206: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,517 INFO L284 TraceCheckUtils]: 207: Hoare quadruple {214713#true} {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} #98#return; {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} is VALID [2022-04-07 14:06:32,518 INFO L290 TraceCheckUtils]: 208: Hoare triple {215301#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (- 7)) (- 3)) main_~u~0 3) main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,519 INFO L290 TraceCheckUtils]: 209: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,519 INFO L290 TraceCheckUtils]: 210: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,519 INFO L272 TraceCheckUtils]: 211: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-07 14:06:32,519 INFO L290 TraceCheckUtils]: 212: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,519 INFO L290 TraceCheckUtils]: 213: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,519 INFO L290 TraceCheckUtils]: 214: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,520 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {214713#true} {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #98#return; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,520 INFO L290 TraceCheckUtils]: 216: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !(~r~0 < 0); {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,520 INFO L290 TraceCheckUtils]: 217: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,521 INFO L290 TraceCheckUtils]: 218: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,521 INFO L272 TraceCheckUtils]: 219: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-07 14:06:32,521 INFO L290 TraceCheckUtils]: 220: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,521 INFO L290 TraceCheckUtils]: 221: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,521 INFO L290 TraceCheckUtils]: 222: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,521 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {214713#true} {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #94#return; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,522 INFO L290 TraceCheckUtils]: 224: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(0 != ~r~0); {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,522 INFO L290 TraceCheckUtils]: 225: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,522 INFO L290 TraceCheckUtils]: 226: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,522 INFO L272 TraceCheckUtils]: 227: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {214713#true} is VALID [2022-04-07 14:06:32,523 INFO L290 TraceCheckUtils]: 228: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,523 INFO L290 TraceCheckUtils]: 229: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,523 INFO L290 TraceCheckUtils]: 230: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,523 INFO L284 TraceCheckUtils]: 231: Hoare quadruple {214713#true} {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} #96#return; {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} is VALID [2022-04-07 14:06:32,524 INFO L290 TraceCheckUtils]: 232: Hoare triple {215350#(< (+ (div (+ (* main_~v~0 2) main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0 1) main_~v~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,524 INFO L290 TraceCheckUtils]: 233: Hoare triple {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,525 INFO L290 TraceCheckUtils]: 234: Hoare triple {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !!(#t~post7 < 100);havoc #t~post7; {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,525 INFO L272 TraceCheckUtils]: 235: Hoare triple {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~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)); {214713#true} is VALID [2022-04-07 14:06:32,525 INFO L290 TraceCheckUtils]: 236: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,525 INFO L290 TraceCheckUtils]: 237: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,525 INFO L290 TraceCheckUtils]: 238: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,525 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {214713#true} {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #96#return; {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,526 INFO L290 TraceCheckUtils]: 240: Hoare triple {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !(~r~0 > 0); {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,526 INFO L290 TraceCheckUtils]: 241: Hoare triple {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,526 INFO L290 TraceCheckUtils]: 242: Hoare triple {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !!(#t~post8 < 100);havoc #t~post8; {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,526 INFO L272 TraceCheckUtils]: 243: Hoare triple {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~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)); {214713#true} is VALID [2022-04-07 14:06:32,526 INFO L290 TraceCheckUtils]: 244: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,526 INFO L290 TraceCheckUtils]: 245: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,526 INFO L290 TraceCheckUtils]: 246: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,527 INFO L284 TraceCheckUtils]: 247: Hoare quadruple {214713#true} {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} #98#return; {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,528 INFO L290 TraceCheckUtils]: 248: Hoare triple {215423#(< (+ 5 (div (+ main_~r~0 (* (- 1) main_~u~0) (- 5)) (- 3)) main_~u~0) (* main_~v~0 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,529 INFO L290 TraceCheckUtils]: 249: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,529 INFO L290 TraceCheckUtils]: 250: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(#t~post8 < 100);havoc #t~post8; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,529 INFO L272 TraceCheckUtils]: 251: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~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)); {214713#true} is VALID [2022-04-07 14:06:32,529 INFO L290 TraceCheckUtils]: 252: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,529 INFO L290 TraceCheckUtils]: 253: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,529 INFO L290 TraceCheckUtils]: 254: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,530 INFO L284 TraceCheckUtils]: 255: Hoare quadruple {214713#true} {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #98#return; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,530 INFO L290 TraceCheckUtils]: 256: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !(~r~0 < 0); {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,530 INFO L290 TraceCheckUtils]: 257: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,531 INFO L290 TraceCheckUtils]: 258: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(#t~post6 < 100);havoc #t~post6; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,531 INFO L272 TraceCheckUtils]: 259: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~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)); {214713#true} is VALID [2022-04-07 14:06:32,531 INFO L290 TraceCheckUtils]: 260: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,531 INFO L290 TraceCheckUtils]: 261: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,531 INFO L290 TraceCheckUtils]: 262: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,531 INFO L284 TraceCheckUtils]: 263: Hoare quadruple {214713#true} {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #94#return; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,532 INFO L290 TraceCheckUtils]: 264: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(0 != ~r~0); {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,532 INFO L290 TraceCheckUtils]: 265: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,532 INFO L290 TraceCheckUtils]: 266: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(#t~post7 < 100);havoc #t~post7; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,532 INFO L272 TraceCheckUtils]: 267: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~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)); {214713#true} is VALID [2022-04-07 14:06:32,532 INFO L290 TraceCheckUtils]: 268: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,532 INFO L290 TraceCheckUtils]: 269: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,532 INFO L290 TraceCheckUtils]: 270: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,533 INFO L284 TraceCheckUtils]: 271: Hoare quadruple {214713#true} {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} #96#return; {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} is VALID [2022-04-07 14:06:32,536 INFO L290 TraceCheckUtils]: 272: Hoare triple {215472#(< (+ (div (+ (- 1) main_~r~0 (* (- 2) main_~u~0)) (- 3)) main_~u~0 3) (* main_~v~0 2))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:06:32,537 INFO L290 TraceCheckUtils]: 273: Hoare triple {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:06:32,538 INFO L290 TraceCheckUtils]: 274: Hoare triple {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:06:32,538 INFO L272 TraceCheckUtils]: 275: Hoare triple {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) 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-07 14:06:32,538 INFO L290 TraceCheckUtils]: 276: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,538 INFO L290 TraceCheckUtils]: 277: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,538 INFO L290 TraceCheckUtils]: 278: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,539 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {214713#true} {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #96#return; {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:06:32,540 INFO L290 TraceCheckUtils]: 280: Hoare triple {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !(~r~0 > 0); {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:06:32,541 INFO L290 TraceCheckUtils]: 281: Hoare triple {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:06:32,541 INFO L290 TraceCheckUtils]: 282: Hoare triple {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:06:32,541 INFO L272 TraceCheckUtils]: 283: Hoare triple {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) 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-07 14:06:32,542 INFO L290 TraceCheckUtils]: 284: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:32,542 INFO L290 TraceCheckUtils]: 285: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:32,542 INFO L290 TraceCheckUtils]: 286: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:32,542 INFO L284 TraceCheckUtils]: 287: Hoare quadruple {214713#true} {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} #98#return; {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} is VALID [2022-04-07 14:06:34,550 WARN L290 TraceCheckUtils]: 288: Hoare triple {215545#(exists ((v_main_~v~0_99 Int) (aux_div_v_main_~r~0_152_57 Int)) (and (<= (+ (* main_~u~0 2) 1) (+ v_main_~v~0_99 main_~r~0 (* aux_div_v_main_~r~0_152_57 3))) (< (+ aux_div_v_main_~r~0_152_57 main_~u~0 3) (* v_main_~v~0_99 2)) (<= (+ v_main_~v~0_99 2) main_~v~0)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is UNKNOWN [2022-04-07 14:06:34,557 INFO L290 TraceCheckUtils]: 289: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,558 INFO L290 TraceCheckUtils]: 290: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,558 INFO L272 TraceCheckUtils]: 291: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 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-07 14:06:34,558 INFO L290 TraceCheckUtils]: 292: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:34,558 INFO L290 TraceCheckUtils]: 293: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:34,558 INFO L290 TraceCheckUtils]: 294: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:34,565 INFO L284 TraceCheckUtils]: 295: Hoare quadruple {214713#true} {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #98#return; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,566 INFO L290 TraceCheckUtils]: 296: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !(~r~0 < 0); {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,567 INFO L290 TraceCheckUtils]: 297: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,568 INFO L290 TraceCheckUtils]: 298: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(#t~post6 < 100);havoc #t~post6; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,568 INFO L272 TraceCheckUtils]: 299: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 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-07 14:06:34,568 INFO L290 TraceCheckUtils]: 300: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:34,568 INFO L290 TraceCheckUtils]: 301: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:34,568 INFO L290 TraceCheckUtils]: 302: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:34,569 INFO L284 TraceCheckUtils]: 303: Hoare quadruple {214713#true} {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #94#return; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,570 INFO L290 TraceCheckUtils]: 304: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(0 != ~r~0); {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,571 INFO L290 TraceCheckUtils]: 305: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,572 INFO L290 TraceCheckUtils]: 306: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,572 INFO L272 TraceCheckUtils]: 307: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 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-07 14:06:34,572 INFO L290 TraceCheckUtils]: 308: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:34,572 INFO L290 TraceCheckUtils]: 309: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:34,572 INFO L290 TraceCheckUtils]: 310: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:34,572 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {214713#true} {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} #96#return; {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} is VALID [2022-04-07 14:06:34,573 INFO L290 TraceCheckUtils]: 312: Hoare triple {215594#(exists ((aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 Int) (aux_div_aux_div_v_main_~v~0_99_46_53 Int)) (and (< (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (+ (* aux_div_aux_div_v_main_~v~0_99_46_53 2) 2)) (<= (* aux_div_aux_div_v_main_~v~0_99_46_53 2) (+ (* 2 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (<= (+ (* 6 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 15 (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91)) (+ main_~v~0 main_~r~0)) (<= 0 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (< main_~u~0 (+ aux_div_aux_div_v_main_~v~0_99_46_53 main_~v~0 1)) (< (+ main_~u~0 main_~r~0) (+ (* 7 aux_div_aux_mod_aux_div_v_main_~v~0_99_46_53_91) (* 3 aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91) 18)) (< aux_mod_aux_mod_aux_div_v_main_~v~0_99_46_53_91 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:06:34,574 INFO L290 TraceCheckUtils]: 313: Hoare triple {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:06:34,574 INFO L290 TraceCheckUtils]: 314: Hoare triple {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:06:34,574 INFO L272 TraceCheckUtils]: 315: Hoare triple {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 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-07 14:06:34,574 INFO L290 TraceCheckUtils]: 316: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:34,574 INFO L290 TraceCheckUtils]: 317: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:34,574 INFO L290 TraceCheckUtils]: 318: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:34,574 INFO L284 TraceCheckUtils]: 319: Hoare quadruple {214713#true} {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #96#return; {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:06:34,583 INFO L290 TraceCheckUtils]: 320: Hoare triple {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !(~r~0 > 0); {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:06:34,583 INFO L290 TraceCheckUtils]: 321: Hoare triple {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:06:34,584 INFO L290 TraceCheckUtils]: 322: Hoare triple {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:06:34,584 INFO L272 TraceCheckUtils]: 323: Hoare triple {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 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-07 14:06:34,584 INFO L290 TraceCheckUtils]: 324: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:34,584 INFO L290 TraceCheckUtils]: 325: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:34,584 INFO L290 TraceCheckUtils]: 326: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:34,584 INFO L284 TraceCheckUtils]: 327: Hoare quadruple {214713#true} {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} #98#return; {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} is VALID [2022-04-07 14:06:34,587 INFO L290 TraceCheckUtils]: 328: Hoare triple {215667#(< (+ main_~u~0 1) (+ main_~v~0 (div (div (+ (* main_~v~0 2) main_~r~0 (- 19)) 3) 2)))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,588 INFO L290 TraceCheckUtils]: 329: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,588 INFO L290 TraceCheckUtils]: 330: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,588 INFO L272 TraceCheckUtils]: 331: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 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-07 14:06:34,588 INFO L290 TraceCheckUtils]: 332: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:34,588 INFO L290 TraceCheckUtils]: 333: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:34,588 INFO L290 TraceCheckUtils]: 334: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:34,589 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {214713#true} {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #98#return; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,589 INFO L290 TraceCheckUtils]: 336: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !(~r~0 < 0); {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,590 INFO L290 TraceCheckUtils]: 337: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,590 INFO L290 TraceCheckUtils]: 338: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(#t~post6 < 100);havoc #t~post6; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,590 INFO L272 TraceCheckUtils]: 339: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 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-07 14:06:34,590 INFO L290 TraceCheckUtils]: 340: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:34,590 INFO L290 TraceCheckUtils]: 341: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:34,590 INFO L290 TraceCheckUtils]: 342: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:34,591 INFO L284 TraceCheckUtils]: 343: Hoare quadruple {214713#true} {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #94#return; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,591 INFO L290 TraceCheckUtils]: 344: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(0 != ~r~0); {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,592 INFO L290 TraceCheckUtils]: 345: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,592 INFO L290 TraceCheckUtils]: 346: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:34,592 INFO L272 TraceCheckUtils]: 347: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 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-07 14:06:34,592 INFO L290 TraceCheckUtils]: 348: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:34,592 INFO L290 TraceCheckUtils]: 349: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:34,592 INFO L290 TraceCheckUtils]: 350: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:34,593 INFO L284 TraceCheckUtils]: 351: Hoare quadruple {214713#true} {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} #96#return; {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} is VALID [2022-04-07 14:06:36,598 WARN L290 TraceCheckUtils]: 352: Hoare triple {215716#(exists ((aux_div_aux_div_v_main_~r~0_155_50_34 Int)) (and (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (- 20) (* main_~v~0 2)) 3) 1)) (< (+ main_~r~0 2) (+ main_~v~0 aux_div_aux_div_v_main_~r~0_155_50_34)) (< (div (+ 19 (* (- 1) main_~v~0) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34) (* (- 1) main_~r~0)) (- 3)) 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215789#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is UNKNOWN [2022-04-07 14:06:36,600 INFO L290 TraceCheckUtils]: 353: Hoare triple {215789#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215789#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is VALID [2022-04-07 14:06:38,604 WARN L290 TraceCheckUtils]: 354: Hoare triple {215789#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} assume !!(#t~post7 < 100);havoc #t~post7; {215789#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is UNKNOWN [2022-04-07 14:06:38,605 INFO L272 TraceCheckUtils]: 355: Hoare triple {215789#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 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)); {214713#true} is VALID [2022-04-07 14:06:38,605 INFO L290 TraceCheckUtils]: 356: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:38,605 INFO L290 TraceCheckUtils]: 357: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:38,605 INFO L290 TraceCheckUtils]: 358: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:38,605 INFO L284 TraceCheckUtils]: 359: Hoare quadruple {214713#true} {215789#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} #96#return; {215789#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} is VALID [2022-04-07 14:06:38,655 INFO L290 TraceCheckUtils]: 360: Hoare triple {215789#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_mod_v_main_~v~0_101_114 Int) (aux_div_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ 21 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ main_~v~0 aux_mod_v_main_~v~0_101_114 v_main_~r~0_156)) (<= (+ 19 main_~r~0 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114)) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {215814#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-07 14:06:38,724 INFO L290 TraceCheckUtils]: 361: Hoare triple {215814#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {215814#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-07 14:06:38,730 INFO L290 TraceCheckUtils]: 362: Hoare triple {215814#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} assume !!(#t~post7 < 100);havoc #t~post7; {215814#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-07 14:06:38,730 INFO L272 TraceCheckUtils]: 363: Hoare triple {215814#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} call __VERIFIER_assert((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-07 14:06:38,730 INFO L290 TraceCheckUtils]: 364: Hoare triple {214713#true} ~cond := #in~cond; {214713#true} is VALID [2022-04-07 14:06:38,730 INFO L290 TraceCheckUtils]: 365: Hoare triple {214713#true} assume !(0 == ~cond); {214713#true} is VALID [2022-04-07 14:06:38,730 INFO L290 TraceCheckUtils]: 366: Hoare triple {214713#true} assume true; {214713#true} is VALID [2022-04-07 14:06:38,731 INFO L284 TraceCheckUtils]: 367: Hoare quadruple {214713#true} {215814#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} #96#return; {215814#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} is VALID [2022-04-07 14:06:38,732 INFO L290 TraceCheckUtils]: 368: Hoare triple {215814#(exists ((v_main_~r~0_156 Int) (aux_div_aux_div_v_main_~r~0_155_50_34 Int) (aux_div_v_main_~v~0_101_114 Int) (aux_mod_v_main_~v~0_101_114 Int)) (and (< (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114) (+ (* aux_div_aux_div_v_main_~r~0_155_50_34 8) (* 3 aux_div_v_main_~v~0_101_114) 17)) (< aux_div_v_main_~v~0_101_114 2) (<= 0 aux_mod_v_main_~v~0_101_114) (<= (+ (* 6 aux_div_v_main_~v~0_101_114) 40 main_~r~0 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 3 v_main_~r~0_156) (* 2 aux_mod_v_main_~v~0_101_114))) (< (* 2 aux_div_aux_div_v_main_~r~0_155_50_34) (+ (div (+ (* 6 aux_div_v_main_~v~0_101_114) (* (- 2) v_main_~r~0_156) (* (- 2) aux_mod_v_main_~v~0_101_114) 18 (* 14 aux_div_aux_div_v_main_~r~0_155_50_34)) 3) 1)) (< aux_mod_v_main_~v~0_101_114 3) (< (+ 19 (* 3 aux_div_v_main_~v~0_101_114) (* 7 aux_div_aux_div_v_main_~r~0_155_50_34)) (+ (* 2 v_main_~r~0_156) aux_mod_v_main_~v~0_101_114))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {214714#false} is VALID [2022-04-07 14:06:38,732 INFO L290 TraceCheckUtils]: 369: Hoare triple {214714#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {214714#false} is VALID [2022-04-07 14:06:38,732 INFO L290 TraceCheckUtils]: 370: Hoare triple {214714#false} assume !(#t~post7 < 100);havoc #t~post7; {214714#false} is VALID [2022-04-07 14:06:38,732 INFO L290 TraceCheckUtils]: 371: Hoare triple {214714#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {214714#false} is VALID [2022-04-07 14:06:38,732 INFO L290 TraceCheckUtils]: 372: Hoare triple {214714#false} assume !(#t~post8 < 100);havoc #t~post8; {214714#false} is VALID [2022-04-07 14:06:38,732 INFO L290 TraceCheckUtils]: 373: Hoare triple {214714#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {214714#false} is VALID [2022-04-07 14:06:38,732 INFO L290 TraceCheckUtils]: 374: Hoare triple {214714#false} assume !(#t~post6 < 100);havoc #t~post6; {214714#false} is VALID [2022-04-07 14:06:38,732 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-07 14:06:38,732 INFO L290 TraceCheckUtils]: 376: Hoare triple {214714#false} ~cond := #in~cond; {214714#false} is VALID [2022-04-07 14:06:38,732 INFO L290 TraceCheckUtils]: 377: Hoare triple {214714#false} assume 0 == ~cond; {214714#false} is VALID [2022-04-07 14:06:38,732 INFO L290 TraceCheckUtils]: 378: Hoare triple {214714#false} assume !false; {214714#false} is VALID [2022-04-07 14:06:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5272 backedges. 480 proven. 992 refuted. 0 times theorem prover too weak. 3800 trivial. 0 not checked. [2022-04-07 14:06:38,734 INFO L328 TraceCheckSpWp]: Computing backward predicates...