/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/cohencu-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:12:16,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:12:16,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:12:16,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:12:16,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:12:16,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:12:16,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:12:16,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:12:16,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:12:16,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:12:16,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:12:16,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:12:16,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:12:16,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:12:16,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:12:16,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:12:16,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:12:16,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:12:16,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:12:16,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:12:16,692 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:12:16,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:12:16,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:12:16,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:12:16,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:12:16,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:12:16,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:12:16,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:12:16,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:12:16,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:12:16,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:12:16,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:12:16,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:12:16,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:12:16,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:12:16,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:12:16,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:12:16,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:12:16,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:12:16,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:12:16,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:12:16,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:12:16,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:12:16,724 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:12:16,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:12:16,725 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:12:16,725 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:12:16,726 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:12:16,726 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:12:16,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:12:16,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:12:16,726 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:12:16,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:12:16,727 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:12:16,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:12:16,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:12:16,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:12:16,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:12:16,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:12:16,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:12:16,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:12:16,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:12:16,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:12:16,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:12:16,729 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:12:16,729 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:12:16,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:12:16,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:12:16,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:12:16,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:12:16,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:12:16,900 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:12:16,901 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:12:16,902 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-27 12:12:16,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98f50697/9c17f5187d244823bc915b1bf9aea071/FLAGffcb070c1 [2022-04-27 12:12:17,238 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:12:17,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-27 12:12:17,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98f50697/9c17f5187d244823bc915b1bf9aea071/FLAGffcb070c1 [2022-04-27 12:12:17,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98f50697/9c17f5187d244823bc915b1bf9aea071 [2022-04-27 12:12:17,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:12:17,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:12:17,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:12:17,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:12:17,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:12:17,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:12:17" (1/1) ... [2022-04-27 12:12:17,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34689c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:17, skipping insertion in model container [2022-04-27 12:12:17,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:12:17" (1/1) ... [2022-04-27 12:12:17,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:12:17,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:12:17,941 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/cohencu-ll_unwindbound50.c[588,601] [2022-04-27 12:12:17,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:12:17,989 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:12:18,005 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/cohencu-ll_unwindbound50.c[588,601] [2022-04-27 12:12:18,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:12:18,034 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:12:18,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18 WrapperNode [2022-04-27 12:12:18,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:12:18,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:12:18,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:12:18,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:12:18,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18" (1/1) ... [2022-04-27 12:12:18,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18" (1/1) ... [2022-04-27 12:12:18,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18" (1/1) ... [2022-04-27 12:12:18,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18" (1/1) ... [2022-04-27 12:12:18,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18" (1/1) ... [2022-04-27 12:12:18,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18" (1/1) ... [2022-04-27 12:12:18,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18" (1/1) ... [2022-04-27 12:12:18,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:12:18,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:12:18,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:12:18,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:12:18,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18" (1/1) ... [2022-04-27 12:12:18,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:12:18,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:18,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:12:18,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:12:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:12:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:12:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:12:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:12:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:12:18,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:12:18,114 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:12:18,115 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:12:18,115 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:12:18,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:12:18,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-27 12:12:18,115 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:12:18,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:12:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:12:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:12:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:12:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:12:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:12:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:12:18,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:12:18,160 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:12:18,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:12:18,275 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:12:18,279 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:12:18,280 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 12:12:18,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:12:18 BoogieIcfgContainer [2022-04-27 12:12:18,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:12:18,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:12:18,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:12:18,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:12:18,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:12:17" (1/3) ... [2022-04-27 12:12:18,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2860b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:12:18, skipping insertion in model container [2022-04-27 12:12:18,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:12:18" (2/3) ... [2022-04-27 12:12:18,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2860b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:12:18, skipping insertion in model container [2022-04-27 12:12:18,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:12:18" (3/3) ... [2022-04-27 12:12:18,286 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2022-04-27 12:12:18,297 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:12:18,297 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:12:18,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:12:18,333 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@21295c18, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fc25903 [2022-04-27 12:12:18,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:12:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 12:12:18,344 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:18,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:18,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:18,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-27 12:12:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:18,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352432716] [2022-04-27 12:12:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:18,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:18,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:12:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:18,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-27 12:12:18,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 12:12:18,476 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-27 12:12:18,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:12:18,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-27 12:12:18,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-27 12:12:18,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-27 12:12:18,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-27 12:12:18,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-27 12:12:18,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-27 12:12:18,479 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-27 12:12:18,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-27 12:12:18,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-27 12:12:18,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-27 12:12:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:12:18,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:18,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352432716] [2022-04-27 12:12:18,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352432716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:18,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:18,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:12:18,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450383813] [2022-04-27 12:12:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 12:12:18,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:18,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:18,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:18,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:12:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:18,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:12:18,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:12:18,521 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:18,745 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-27 12:12:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:12:18,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 12:12:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 12:12:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 12:12:18,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-27 12:12:18,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:18,889 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:12:18,889 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 12:12:18,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:12:18,895 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:18,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 12:12:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 12:12:18,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:18,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:18,921 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:18,921 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:18,924 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-27 12:12:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-27 12:12:18,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:18,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:18,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-27 12:12:18,925 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-27 12:12:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:18,928 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-27 12:12:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-27 12:12:18,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:18,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:18,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:18,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-27 12:12:18,942 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-27 12:12:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:18,943 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-27 12:12:18,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-27 12:12:18,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 12:12:18,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:18,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:18,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:12:18,944 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-27 12:12:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:18,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667732158] [2022-04-27 12:12:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:18,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:12:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:19,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:19,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:19,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:19,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:12:19,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:19,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:19,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:19,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:19,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {232#(= ~counter~0 0)} is VALID [2022-04-27 12:12:19,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {233#(= |main_#t~post5| 0)} is VALID [2022-04-27 12:12:19,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {228#false} is VALID [2022-04-27 12:12:19,009 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {228#false} is VALID [2022-04-27 12:12:19,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-27 12:12:19,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-27 12:12:19,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-27 12:12:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:12:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:19,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667732158] [2022-04-27 12:12:19,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667732158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:19,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:19,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:12:19,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122740875] [2022-04-27 12:12:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:12:19,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:19,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:19,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:12:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:12:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:12:19,023 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:19,257 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-27 12:12:19,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:12:19,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:12:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-27 12:12:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-27 12:12:19,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-27 12:12:19,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:19,320 INFO L225 Difference]: With dead ends: 40 [2022-04-27 12:12:19,320 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 12:12:19,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:12:19,321 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:19,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 12:12:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 12:12:19,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:19,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:19,326 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:19,326 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:19,328 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 12:12:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 12:12:19,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:19,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:19,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-27 12:12:19,330 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-27 12:12:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:19,331 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-27 12:12:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 12:12:19,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:19,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:19,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:19,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-27 12:12:19,334 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-27 12:12:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:19,334 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-27 12:12:19,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-27 12:12:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 12:12:19,335 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:19,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:19,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:12:19,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:19,336 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-27 12:12:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:19,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070066493] [2022-04-27 12:12:19,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:19,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:12:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:19,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-27 12:12:19,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-27 12:12:19,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-27 12:12:19,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {406#true} call ULTIMATE.init(); {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:12:19,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {406#true} is VALID [2022-04-27 12:12:19,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-27 12:12:19,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-27 12:12:19,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-27 12:12:19,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:12:19,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:12:19,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 50);havoc #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-27 12:12:19,467 INFO L272 TraceCheckUtils]: 8: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:19,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:12:19,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-27 12:12:19,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-27 12:12:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:12:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:19,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070066493] [2022-04-27 12:12:19,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070066493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:19,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:19,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:12:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161617316] [2022-04-27 12:12:19,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:19,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:12:19,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:19,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:19,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:12:19,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:12:19,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:12:19,478 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:19,755 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-27 12:12:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:12:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:12:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 12:12:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-27 12:12:19,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-27 12:12:19,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:19,799 INFO L225 Difference]: With dead ends: 34 [2022-04-27 12:12:19,799 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:12:19,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:12:19,800 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:19,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:12:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:12:19,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:19,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:19,806 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:19,806 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:19,815 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 12:12:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 12:12:19,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:19,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:19,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 12:12:19,818 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-27 12:12:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:19,819 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-27 12:12:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 12:12:19,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:19,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:19,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:19,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:12:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 12:12:19,822 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-27 12:12:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:19,822 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 12:12:19,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:12:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 12:12:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:12:19,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:19,823 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:19,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 12:12:19,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:19,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-27 12:12:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:19,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625286937] [2022-04-27 12:12:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:19,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:19,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297106093] [2022-04-27 12:12:19,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:19,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:19,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:19,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:19,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:12:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:19,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:12:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:19,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:20,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-27 12:12:20,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {593#true} is VALID [2022-04-27 12:12:20,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-27 12:12:20,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-27 12:12:20,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-27 12:12:20,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:20,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:20,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:20,079 INFO L272 TraceCheckUtils]: 8: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {593#true} is VALID [2022-04-27 12:12:20,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-27 12:12:20,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-27 12:12:20,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-27 12:12:20,080 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {593#true} {613#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:20,080 INFO L272 TraceCheckUtils]: 13: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:20,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:20,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-27 12:12:20,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-27 12:12:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:12:20,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:12:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:20,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625286937] [2022-04-27 12:12:20,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:20,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297106093] [2022-04-27 12:12:20,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297106093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:20,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:20,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:12:20,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257653652] [2022-04-27 12:12:20,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:20,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 12:12:20,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:20,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:20,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:20,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:12:20,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:20,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:12:20,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:12:20,096 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:20,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:20,281 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-27 12:12:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:12:20,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 12:12:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:20,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:12:20,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:20,347 INFO L225 Difference]: With dead ends: 50 [2022-04-27 12:12:20,347 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 12:12:20,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:12:20,348 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:20,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:12:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 12:12:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-27 12:12:20,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:20,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:20,356 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:20,356 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:20,358 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 12:12:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-27 12:12:20,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:20,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:20,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-27 12:12:20,360 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-27 12:12:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:20,362 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-27 12:12:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-27 12:12:20,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:20,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:20,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:20,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:12:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-27 12:12:20,364 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-27 12:12:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:20,365 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-27 12:12:20,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:12:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-27 12:12:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 12:12:20,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:20,365 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:20,398 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-27 12:12:20,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:20,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:20,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-27 12:12:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:20,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902672047] [2022-04-27 12:12:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:20,612 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:20,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241297229] [2022-04-27 12:12:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:20,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:20,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:20,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:20,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:12:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:20,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:12:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:20,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:20,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-27 12:12:20,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {887#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {887#true} is VALID [2022-04-27 12:12:20,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-27 12:12:20,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-27 12:12:20,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-27 12:12:20,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {887#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:20,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:20,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:20,794 INFO L272 TraceCheckUtils]: 8: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {887#true} is VALID [2022-04-27 12:12:20,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-27 12:12:20,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-27 12:12:20,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-27 12:12:20,795 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:20,796 INFO L272 TraceCheckUtils]: 13: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {887#true} is VALID [2022-04-27 12:12:20,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-27 12:12:20,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-27 12:12:20,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-27 12:12:20,799 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {887#true} {907#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-27 12:12:20,800 INFO L272 TraceCheckUtils]: 18: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {947#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:20,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:20,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-27 12:12:20,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-27 12:12:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:12:20,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:12:20,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:20,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902672047] [2022-04-27 12:12:20,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:20,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241297229] [2022-04-27 12:12:20,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241297229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:20,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:20,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:12:20,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060152440] [2022-04-27 12:12:20,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:20,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:12:20,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:20,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:20,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:20,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:12:20,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:20,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:12:20,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:12:20,817 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:21,060 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-27 12:12:21,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:12:21,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:12:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:21,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:12:21,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:21,128 INFO L225 Difference]: With dead ends: 54 [2022-04-27 12:12:21,128 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 12:12:21,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:12:21,131 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:21,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 12:12:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-27 12:12:21,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:21,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:12:21,149 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:12:21,151 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:12:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:21,155 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 12:12:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 12:12:21,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:21,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:21,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-27 12:12:21,158 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-27 12:12:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:21,161 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 12:12:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 12:12:21,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:21,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:21,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:21,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:12:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-27 12:12:21,165 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-27 12:12:21,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:21,166 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-27 12:12:21,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:12:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-27 12:12:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:12:21,169 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:21,169 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:21,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:21,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:21,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-27 12:12:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:21,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777535941] [2022-04-27 12:12:21,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:21,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:21,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135231711] [2022-04-27 12:12:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:21,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:21,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:12:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:21,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:12:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:21,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:21,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-27 12:12:21,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {1225#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1225#true} is VALID [2022-04-27 12:12:21,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-27 12:12:21,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-27 12:12:21,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-27 12:12:21,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {1225#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:21,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:21,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:21,651 INFO L272 TraceCheckUtils]: 8: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-27 12:12:21,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-27 12:12:21,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-27 12:12:21,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-27 12:12:21,652 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:21,653 INFO L272 TraceCheckUtils]: 13: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1225#true} is VALID [2022-04-27 12:12:21,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-27 12:12:21,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-27 12:12:21,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-27 12:12:21,653 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:21,654 INFO L272 TraceCheckUtils]: 18: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1225#true} is VALID [2022-04-27 12:12:21,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-27 12:12:21,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-27 12:12:21,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-27 12:12:21,656 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1225#true} {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:21,657 INFO L272 TraceCheckUtils]: 23: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:21,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:21,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-27 12:12:21,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-27 12:12:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 12:12:21,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:12:21,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:21,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777535941] [2022-04-27 12:12:21,658 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:21,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135231711] [2022-04-27 12:12:21,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135231711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:12:21,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:12:21,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:12:21,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010515897] [2022-04-27 12:12:21,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:12:21,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 12:12:21,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:21,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:21,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:21,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:12:21,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:12:21,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:12:21,695 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:21,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:21,966 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-27 12:12:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:12:21,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 12:12:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-27 12:12:21,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-27 12:12:22,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:22,017 INFO L225 Difference]: With dead ends: 62 [2022-04-27 12:12:22,017 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 12:12:22,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:12:22,018 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:22,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 12:12:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-27 12:12:22,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:22,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:12:22,024 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:12:22,024 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:12:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:22,026 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-27 12:12:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 12:12:22,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:22,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:22,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-27 12:12:22,027 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-27 12:12:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:22,028 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-27 12:12:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 12:12:22,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:22,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:22,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:22,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:12:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-27 12:12:22,030 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-27 12:12:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:22,030 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-27 12:12:22,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:12:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-27 12:12:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 12:12:22,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:22,031 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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] [2022-04-27 12:12:22,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:22,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:22,248 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:22,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-27 12:12:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:22,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350958700] [2022-04-27 12:12:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:22,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:22,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467922234] [2022-04-27 12:12:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:22,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:22,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:22,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:22,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:12:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:22,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:12:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:22,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:22,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-27 12:12:22,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:22,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:22,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:22,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:22,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {1593#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1593#(<= ~counter~0 0)} is VALID [2022-04-27 12:12:22,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,515 INFO L272 TraceCheckUtils]: 8: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,517 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #59#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,524 INFO L272 TraceCheckUtils]: 13: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,525 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #61#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,525 INFO L272 TraceCheckUtils]: 18: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,527 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #63#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,527 INFO L272 TraceCheckUtils]: 23: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,529 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #65#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,529 INFO L272 TraceCheckUtils]: 28: Hoare triple {1609#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,530 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #67#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {1609#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1609#(<= ~counter~0 1)} is VALID [2022-04-27 12:12:22,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {1609#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1694#(<= |main_#t~post5| 1)} is VALID [2022-04-27 12:12:22,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-27 12:12:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-27 12:12:22,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:22,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-27 12:12:22,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-27 12:12:22,731 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-27 12:12:22,731 INFO L272 TraceCheckUtils]: 41: Hoare triple {1586#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {1586#false} is VALID [2022-04-27 12:12:22,731 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-27 12:12:22,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:22,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:22,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:22,731 INFO L272 TraceCheckUtils]: 36: Hoare triple {1586#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:22,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {1586#false} is VALID [2022-04-27 12:12:22,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {1756#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1752#(< |main_#t~post5| 50)} is VALID [2022-04-27 12:12:22,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {1756#(< ~counter~0 50)} is VALID [2022-04-27 12:12:22,733 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #67#return; {1756#(< ~counter~0 50)} is VALID [2022-04-27 12:12:22,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:22,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:22,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:22,733 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:22,734 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #65#return; {1756#(< ~counter~0 50)} is VALID [2022-04-27 12:12:22,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:22,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:22,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:22,734 INFO L272 TraceCheckUtils]: 23: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:22,735 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #63#return; {1756#(< ~counter~0 50)} is VALID [2022-04-27 12:12:22,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:22,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:22,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:22,735 INFO L272 TraceCheckUtils]: 18: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:22,735 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #61#return; {1756#(< ~counter~0 50)} is VALID [2022-04-27 12:12:22,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:22,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:22,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:22,736 INFO L272 TraceCheckUtils]: 13: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:22,736 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #59#return; {1756#(< ~counter~0 50)} is VALID [2022-04-27 12:12:22,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-27 12:12:22,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-27 12:12:22,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-27 12:12:22,736 INFO L272 TraceCheckUtils]: 8: Hoare triple {1756#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-27 12:12:22,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1756#(< ~counter~0 50)} is VALID [2022-04-27 12:12:22,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1756#(< ~counter~0 50)} is VALID [2022-04-27 12:12:22,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(< ~counter~0 49)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1841#(< ~counter~0 49)} is VALID [2022-04-27 12:12:22,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#(< ~counter~0 49)} call #t~ret6 := main(); {1841#(< ~counter~0 49)} is VALID [2022-04-27 12:12:22,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#(< ~counter~0 49)} {1585#true} #81#return; {1841#(< ~counter~0 49)} is VALID [2022-04-27 12:12:22,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#(< ~counter~0 49)} assume true; {1841#(< ~counter~0 49)} is VALID [2022-04-27 12:12:22,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1841#(< ~counter~0 49)} is VALID [2022-04-27 12:12:22,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-27 12:12:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:12:22,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:22,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350958700] [2022-04-27 12:12:22,741 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:22,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467922234] [2022-04-27 12:12:22,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467922234] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:22,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:22,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:12:22,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600877413] [2022-04-27 12:12:22,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:22,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-27 12:12:22,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:22,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:22,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:22,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:12:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:12:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:12:22,790 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:23,688 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-27 12:12:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:12:23,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 45 [2022-04-27 12:12:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-27 12:12:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-27 12:12:23,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-04-27 12:12:23,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:23,820 INFO L225 Difference]: With dead ends: 120 [2022-04-27 12:12:23,820 INFO L226 Difference]: Without dead ends: 104 [2022-04-27 12:12:23,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:12:23,820 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:23,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 194 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:12:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-27 12:12:23,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-27 12:12:23,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:23,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:23,851 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:23,852 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:23,855 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-27 12:12:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-27 12:12:23,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:23,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:23,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-27 12:12:23,856 INFO L87 Difference]: Start difference. First operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 104 states. [2022-04-27 12:12:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:23,859 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-27 12:12:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-27 12:12:23,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:23,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:23,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:23,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 40 states have call successors, (40), 12 states have call predecessors, (40), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-27 12:12:23,862 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-27 12:12:23,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:23,862 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-27 12:12:23,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 6 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-27 12:12:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-27 12:12:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 12:12:23,863 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:23,863 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:23,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:24,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:24,080 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:24,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:24,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-27 12:12:24,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:24,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964289658] [2022-04-27 12:12:24,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:24,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:24,090 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:24,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455102227] [2022-04-27 12:12:24,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:24,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:24,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:24,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:24,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:12:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:24,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:12:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:24,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:24,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-27 12:12:24,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#true} is VALID [2022-04-27 12:12:24,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-27 12:12:24,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-27 12:12:24,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:24,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:24,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:24,369 INFO L272 TraceCheckUtils]: 8: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,370 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:24,370 INFO L272 TraceCheckUtils]: 13: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,371 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:24,371 INFO L272 TraceCheckUtils]: 18: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,372 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:24,372 INFO L272 TraceCheckUtils]: 23: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,372 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:24,372 INFO L272 TraceCheckUtils]: 28: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,373 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:24,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:24,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:24,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:24,374 INFO L272 TraceCheckUtils]: 36: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,375 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} #59#return; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-27 12:12:24,375 INFO L272 TraceCheckUtils]: 41: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:24,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:24,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-27 12:12:24,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-27 12:12:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:12:24,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:24,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-27 12:12:24,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-27 12:12:24,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:24,552 INFO L272 TraceCheckUtils]: 41: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:24,554 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2418#true} {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #59#return; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:24,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,561 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,561 INFO L272 TraceCheckUtils]: 36: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !!(#t~post5 < 50);havoc #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:24,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:24,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {2568#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:24,569 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #67#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:24,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,570 INFO L272 TraceCheckUtils]: 28: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,570 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #65#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:24,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,570 INFO L272 TraceCheckUtils]: 23: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,571 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #63#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:24,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,571 INFO L272 TraceCheckUtils]: 18: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,571 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #61#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:24,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,572 INFO L272 TraceCheckUtils]: 13: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,572 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2418#true} {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #59#return; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:24,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-27 12:12:24,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-27 12:12:24,572 INFO L272 TraceCheckUtils]: 8: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2418#true} is VALID [2022-04-27 12:12:24,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:24,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:24,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {2418#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2593#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 3) 4) (+ main_~z~0 main_~y~0))} is VALID [2022-04-27 12:12:24,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-27 12:12:24,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-27 12:12:24,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-27 12:12:24,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {2418#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2418#true} is VALID [2022-04-27 12:12:24,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-27 12:12:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-27 12:12:24,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:24,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964289658] [2022-04-27 12:12:24,576 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:24,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455102227] [2022-04-27 12:12:24,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455102227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:24,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:24,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:12:24,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897970321] [2022-04-27 12:12:24,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:24,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-27 12:12:24,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:24,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:24,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:24,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:12:24,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:12:24,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:12:24,638 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:25,359 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-27 12:12:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:12:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 45 [2022-04-27 12:12:25,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 12:12:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 12:12:25,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 12:12:25,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:25,450 INFO L225 Difference]: With dead ends: 118 [2022-04-27 12:12:25,451 INFO L226 Difference]: Without dead ends: 116 [2022-04-27 12:12:25,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:12:25,451 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:25,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:12:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-27 12:12:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-27 12:12:25,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:25,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:25,516 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:25,516 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:25,519 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-27 12:12:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-27 12:12:25,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:25,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:25,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-27 12:12:25,521 INFO L87 Difference]: Start difference. First operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 116 states. [2022-04-27 12:12:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:25,524 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-27 12:12:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-27 12:12:25,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:25,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:25,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:25,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-27 12:12:25,528 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-27 12:12:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:25,528 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-27 12:12:25,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-27 12:12:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-27 12:12:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 12:12:25,529 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:25,529 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:25,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:25,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:25,746 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-27 12:12:25,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:25,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478634765] [2022-04-27 12:12:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:25,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:25,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:25,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403480244] [2022-04-27 12:12:25,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:12:25,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:25,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:25,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:25,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:12:25,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:12:25,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:12:25,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:12:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:25,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:25,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-27 12:12:25,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3289#true} is VALID [2022-04-27 12:12:25,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:25,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-27 12:12:25,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-27 12:12:25,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:25,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:25,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:25,985 INFO L272 TraceCheckUtils]: 8: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:25,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:25,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:25,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:25,986 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #59#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:25,986 INFO L272 TraceCheckUtils]: 13: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:25,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:25,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:25,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:25,987 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #61#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:25,987 INFO L272 TraceCheckUtils]: 18: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:25,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:25,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:25,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:25,987 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #63#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:25,988 INFO L272 TraceCheckUtils]: 23: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:25,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:25,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:25,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:25,988 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #65#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:25,988 INFO L272 TraceCheckUtils]: 28: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:25,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:25,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:25,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:25,989 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #67#return; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-27 12:12:25,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:25,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:25,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:25,990 INFO L272 TraceCheckUtils]: 36: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:25,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:25,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:25,991 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:25,991 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #59#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:25,991 INFO L272 TraceCheckUtils]: 41: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:25,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:25,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:25,991 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:25,992 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} #61#return; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-27 12:12:25,992 INFO L272 TraceCheckUtils]: 46: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:25,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:25,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-27 12:12:25,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-27 12:12:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 12:12:25,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:26,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-27 12:12:26,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-27 12:12:26,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:26,162 INFO L272 TraceCheckUtils]: 46: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:26,162 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #61#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:26,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:26,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:26,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:26,163 INFO L272 TraceCheckUtils]: 41: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:26,163 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3289#true} {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #59#return; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:26,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:26,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:26,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:26,163 INFO L272 TraceCheckUtils]: 36: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:26,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !!(#t~post5 < 50);havoc #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:26,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:26,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:26,166 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #67#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:26,166 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:26,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:26,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:26,167 INFO L272 TraceCheckUtils]: 28: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:26,167 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #65#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:26,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:26,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:26,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:26,167 INFO L272 TraceCheckUtils]: 23: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:26,168 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #63#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:26,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:26,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:26,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:26,168 INFO L272 TraceCheckUtils]: 18: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:26,169 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #61#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:26,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:26,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:26,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:26,169 INFO L272 TraceCheckUtils]: 13: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:26,169 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3289#true} {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #59#return; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:26,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:26,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-27 12:12:26,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-27 12:12:26,169 INFO L272 TraceCheckUtils]: 8: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3289#true} is VALID [2022-04-27 12:12:26,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:26,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:26,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {3289#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3494#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-27 12:12:26,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-27 12:12:26,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-27 12:12:26,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-27 12:12:26,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {3289#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3289#true} is VALID [2022-04-27 12:12:26,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-27 12:12:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 12:12:26,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:26,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478634765] [2022-04-27 12:12:26,172 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:26,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403480244] [2022-04-27 12:12:26,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403480244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:26,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:26,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:12:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673441184] [2022-04-27 12:12:26,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:26,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-27 12:12:26,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:26,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:26,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:26,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:12:26,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:12:26,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:12:26,220 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:26,662 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-27 12:12:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:12:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 50 [2022-04-27 12:12:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-27 12:12:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-27 12:12:26,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-27 12:12:26,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:26,727 INFO L225 Difference]: With dead ends: 122 [2022-04-27 12:12:26,727 INFO L226 Difference]: Without dead ends: 120 [2022-04-27 12:12:26,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:12:26,728 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:26,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 232 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-27 12:12:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-27 12:12:26,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:26,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:26,762 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:26,762 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:26,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:26,765 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-27 12:12:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-27 12:12:26,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:26,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:26,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-27 12:12:26,766 INFO L87 Difference]: Start difference. First operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand 120 states. [2022-04-27 12:12:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:26,768 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-27 12:12:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-27 12:12:26,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:26,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:26,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:26,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 66 states have internal predecessors, (70), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:12:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-27 12:12:26,771 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-27 12:12:26,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:26,771 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-27 12:12:26,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-27 12:12:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-27 12:12:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 12:12:26,771 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:26,771 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:26,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:26,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:26,987 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:26,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-27 12:12:26,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:26,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637227298] [2022-04-27 12:12:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:26,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:26,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425754568] [2022-04-27 12:12:26,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:12:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:26,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:26,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:12:27,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 12:12:27,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:12:27,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 12:12:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:27,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:27,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-27 12:12:27,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4204#true} is VALID [2022-04-27 12:12:27,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-27 12:12:27,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-27 12:12:27,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:27,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:27,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:27,313 INFO L272 TraceCheckUtils]: 8: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,314 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:27,314 INFO L272 TraceCheckUtils]: 13: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,314 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:27,314 INFO L272 TraceCheckUtils]: 18: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,315 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:27,315 INFO L272 TraceCheckUtils]: 23: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,316 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:27,316 INFO L272 TraceCheckUtils]: 28: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,316 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:27,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {4224#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:27,317 INFO L290 TraceCheckUtils]: 34: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:27,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} assume !!(#t~post5 < 50);havoc #t~post5; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:27,318 INFO L272 TraceCheckUtils]: 36: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,318 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,318 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #59#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:27,318 INFO L272 TraceCheckUtils]: 41: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,319 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,319 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,319 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #61#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:27,319 INFO L272 TraceCheckUtils]: 46: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,319 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,320 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} #63#return; {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-27 12:12:27,320 INFO L272 TraceCheckUtils]: 51: Hoare triple {4309#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:27,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:27,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-27 12:12:27,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-27 12:12:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 12:12:27,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:27,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-27 12:12:27,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-27 12:12:27,550 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:27,550 INFO L272 TraceCheckUtils]: 51: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:27,551 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #63#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:27,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,551 INFO L272 TraceCheckUtils]: 46: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,552 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #61#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:27,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,552 INFO L272 TraceCheckUtils]: 41: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,552 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4204#true} {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #59#return; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:27,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,553 INFO L272 TraceCheckUtils]: 36: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !!(#t~post5 < 50);havoc #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:27,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:27,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {4384#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-27 12:12:27,557 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #67#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:27,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,557 INFO L272 TraceCheckUtils]: 28: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,557 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #65#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:27,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,558 INFO L272 TraceCheckUtils]: 23: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,558 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #63#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:27,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,558 INFO L272 TraceCheckUtils]: 18: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,559 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #61#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:27,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,559 INFO L272 TraceCheckUtils]: 13: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,559 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4204#true} {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #59#return; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:27,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-27 12:12:27,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-27 12:12:27,560 INFO L272 TraceCheckUtils]: 8: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4204#true} is VALID [2022-04-27 12:12:27,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} assume !!(#t~post5 < 50);havoc #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:27,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:27,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {4204#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4439#(= (+ (* main_~z~0 main_~z~0) 6 (* main_~z~0 main_~y~0)) (+ (* main_~x~0 18) (* main_~z~0 4) (* main_~y~0 24)))} is VALID [2022-04-27 12:12:27,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-27 12:12:27,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-27 12:12:27,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-27 12:12:27,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {4204#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4204#true} is VALID [2022-04-27 12:12:27,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-27 12:12:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-27 12:12:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637227298] [2022-04-27 12:12:27,562 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:27,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425754568] [2022-04-27 12:12:27,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425754568] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:27,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:27,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:12:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103634332] [2022-04-27 12:12:27,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:27,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-27 12:12:27,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:27,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:27,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:27,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:12:27,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:12:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:12:27,613 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:28,513 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-27 12:12:28,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:12:28,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 55 [2022-04-27 12:12:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 12:12:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:28,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 12:12:28,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 12:12:28,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:28,607 INFO L225 Difference]: With dead ends: 146 [2022-04-27 12:12:28,607 INFO L226 Difference]: Without dead ends: 135 [2022-04-27 12:12:28,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:12:28,608 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:28,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 120 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 12:12:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-27 12:12:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-27 12:12:28,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:28,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:28,645 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:28,645 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:28,647 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-27 12:12:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-27 12:12:28,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:28,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:28,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-27 12:12:28,648 INFO L87 Difference]: Start difference. First operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 135 states. [2022-04-27 12:12:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:28,650 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-27 12:12:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-27 12:12:28,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:28,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:28,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:28,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 84 states have internal predecessors, (88), 31 states have call successors, (31), 23 states have call predecessors, (31), 22 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-27 12:12:28,652 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-27 12:12:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:28,653 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-27 12:12:28,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-27 12:12:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-27 12:12:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-27 12:12:28,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:28,653 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:28,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:28,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:28,867 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-27 12:12:28,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:28,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743439325] [2022-04-27 12:12:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:28,876 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:28,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739622423] [2022-04-27 12:12:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:28,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:28,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:28,888 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:28,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:12:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:28,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 12:12:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:28,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:34,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-27 12:12:34,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#true} is VALID [2022-04-27 12:12:34,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-27 12:12:35,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-27 12:12:35,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:35,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:35,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:35,003 INFO L272 TraceCheckUtils]: 8: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,004 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #59#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:35,004 INFO L272 TraceCheckUtils]: 13: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,004 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #61#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:35,005 INFO L272 TraceCheckUtils]: 18: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,006 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #63#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:35,006 INFO L272 TraceCheckUtils]: 23: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,006 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #65#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:35,006 INFO L272 TraceCheckUtils]: 28: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,007 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} #67#return; {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} is VALID [2022-04-27 12:12:35,008 INFO L290 TraceCheckUtils]: 33: Hoare triple {5243#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (or (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,008 INFO L290 TraceCheckUtils]: 34: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,009 INFO L272 TraceCheckUtils]: 36: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,009 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,009 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,009 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #59#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,009 INFO L272 TraceCheckUtils]: 41: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,013 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #61#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,013 INFO L272 TraceCheckUtils]: 46: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,015 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #63#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,015 INFO L272 TraceCheckUtils]: 51: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,015 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #65#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,016 INFO L272 TraceCheckUtils]: 56: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,016 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,016 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} #67#return; {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:35,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {5328#(and (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ (* (- 1) main_~a~0) 32767) 65536)) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:35,017 INFO L272 TraceCheckUtils]: 62: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,017 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,017 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,018 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #69#return; {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:35,018 INFO L272 TraceCheckUtils]: 67: Hoare triple {5413#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:35,018 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:35,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-27 12:12:35,019 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-27 12:12:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 12:12:35,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:35,565 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-27 12:12:35,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-27 12:12:35,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:35,566 INFO L272 TraceCheckUtils]: 67: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:35,566 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5223#true} {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} #69#return; {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-27 12:12:35,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,567 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,567 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,567 INFO L272 TraceCheckUtils]: 62: Hoare triple {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,567 INFO L290 TraceCheckUtils]: 61: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !(~n~0 <= ~a~0); {5452#(= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))} is VALID [2022-04-27 12:12:35,567 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #67#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:35,567 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,567 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,567 INFO L272 TraceCheckUtils]: 56: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,568 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #65#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:35,568 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,568 INFO L272 TraceCheckUtils]: 51: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,568 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #63#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:35,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,568 INFO L272 TraceCheckUtils]: 46: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,569 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #61#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:35,569 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,569 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,569 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,569 INFO L272 TraceCheckUtils]: 41: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,569 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5223#true} {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #59#return; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:35,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,569 INFO L272 TraceCheckUtils]: 36: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} assume !!(#t~post5 < 50);havoc #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:35,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:35,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {5471#(or (<= main_~n~0 main_~a~0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-27 12:12:35,573 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #67#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:35,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,573 INFO L272 TraceCheckUtils]: 28: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,573 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #65#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:35,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,573 INFO L272 TraceCheckUtils]: 23: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,574 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #63#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:35,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,574 INFO L272 TraceCheckUtils]: 18: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,574 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #61#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:35,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,574 INFO L272 TraceCheckUtils]: 13: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,575 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5223#true} {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #59#return; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:35,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-27 12:12:35,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-27 12:12:35,575 INFO L272 TraceCheckUtils]: 8: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5223#true} is VALID [2022-04-27 12:12:35,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} assume !!(#t~post5 < 50);havoc #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:35,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:35,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5556#(or (= (+ (* main_~x~0 12) (* main_~y~0 12) (* (* main_~a~0 (+ main_~y~0 main_~x~0)) 6)) (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0))) (not (<= main_~n~0 main_~a~0)) (<= (+ main_~n~0 1) main_~a~0))} is VALID [2022-04-27 12:12:35,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-27 12:12:35,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-27 12:12:35,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-27 12:12:35,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {5223#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5223#true} is VALID [2022-04-27 12:12:35,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-27 12:12:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-27 12:12:35,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:35,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743439325] [2022-04-27 12:12:35,577 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:35,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739622423] [2022-04-27 12:12:35,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739622423] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:35,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:35,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-27 12:12:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040456881] [2022-04-27 12:12:35,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:35,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-27 12:12:35,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:35,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:35,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:35,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:12:35,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:35,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:12:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:12:35,638 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:36,832 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-27 12:12:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:12:36,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 71 [2022-04-27 12:12:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:36,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:12:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:12:36,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-27 12:12:36,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:36,939 INFO L225 Difference]: With dead ends: 148 [2022-04-27 12:12:36,939 INFO L226 Difference]: Without dead ends: 144 [2022-04-27 12:12:36,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:12:36,940 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:36,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 189 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:12:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-27 12:12:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-27 12:12:37,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:37,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:37,023 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:37,023 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:37,025 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-27 12:12:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-27 12:12:37,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:37,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:37,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-27 12:12:37,026 INFO L87 Difference]: Start difference. First operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 144 states. [2022-04-27 12:12:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:37,028 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-27 12:12:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-27 12:12:37,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:37,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:37,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:37,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.069767441860465) internal successors, (92), 88 states have internal predecessors, (92), 31 states have call successors, (31), 25 states have call predecessors, (31), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:12:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-27 12:12:37,031 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-27 12:12:37,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:37,031 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-27 12:12:37,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-27 12:12:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-27 12:12:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-27 12:12:37,032 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:37,032 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:37,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:37,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 12:12:37,248 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:37,248 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-27 12:12:37,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:37,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216580540] [2022-04-27 12:12:37,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:37,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:37,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847169403] [2022-04-27 12:12:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:37,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:37,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:37,279 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:37,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:12:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:37,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:12:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:37,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:37,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6368#true} is VALID [2022-04-27 12:12:37,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {6368#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6368#true} is VALID [2022-04-27 12:12:37,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #81#return; {6368#true} is VALID [2022-04-27 12:12:37,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret6 := main(); {6368#true} is VALID [2022-04-27 12:12:37,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {6368#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:37,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:37,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 50);havoc #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:37,961 INFO L272 TraceCheckUtils]: 8: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,961 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #59#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:37,961 INFO L272 TraceCheckUtils]: 13: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,962 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #61#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:37,962 INFO L272 TraceCheckUtils]: 18: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,962 INFO L290 TraceCheckUtils]: 21: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,962 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #63#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:37,963 INFO L272 TraceCheckUtils]: 23: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,963 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #65#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:37,963 INFO L272 TraceCheckUtils]: 28: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,964 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6368#true} {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} #67#return; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-27 12:12:37,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:37,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:37,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:37,966 INFO L272 TraceCheckUtils]: 36: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,966 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #59#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:37,966 INFO L272 TraceCheckUtils]: 41: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,966 INFO L290 TraceCheckUtils]: 42: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,967 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #61#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:37,967 INFO L272 TraceCheckUtils]: 46: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,967 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #63#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:37,967 INFO L272 TraceCheckUtils]: 51: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,968 INFO L290 TraceCheckUtils]: 52: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,968 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #65#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:37,968 INFO L272 TraceCheckUtils]: 56: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,968 INFO L290 TraceCheckUtils]: 59: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,969 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6368#true} {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} #67#return; {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} is VALID [2022-04-27 12:12:37,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {6473#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:37,969 INFO L272 TraceCheckUtils]: 62: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,969 INFO L290 TraceCheckUtils]: 63: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,969 INFO L290 TraceCheckUtils]: 64: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,980 INFO L290 TraceCheckUtils]: 65: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,989 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #69#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:37,989 INFO L272 TraceCheckUtils]: 67: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {6368#true} is VALID [2022-04-27 12:12:37,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-27 12:12:37,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-27 12:12:37,989 INFO L290 TraceCheckUtils]: 70: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-27 12:12:37,989 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6368#true} {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} #71#return; {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} is VALID [2022-04-27 12:12:37,991 INFO L272 TraceCheckUtils]: 72: Hoare triple {6558#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (<= 0 main_~a~0) (<= 12 main_~z~0) (< main_~a~0 1))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:37,991 INFO L290 TraceCheckUtils]: 73: Hoare triple {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:37,991 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6369#false} is VALID [2022-04-27 12:12:37,992 INFO L290 TraceCheckUtils]: 75: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-27 12:12:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-27 12:12:37,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:45,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:45,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216580540] [2022-04-27 12:12:45,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:45,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847169403] [2022-04-27 12:12:45,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847169403] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:12:45,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:12:45,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-27 12:12:45,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092269993] [2022-04-27 12:12:45,863 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:45,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-27 12:12:45,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:45,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:45,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:45,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:12:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:12:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:12:45,902 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:46,390 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-27 12:12:46,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:12:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 76 [2022-04-27 12:12:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 12:12:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-27 12:12:46,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-27 12:12:46,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:46,451 INFO L225 Difference]: With dead ends: 143 [2022-04-27 12:12:46,451 INFO L226 Difference]: Without dead ends: 132 [2022-04-27 12:12:46,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:12:46,452 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:46,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 177 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:12:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-27 12:12:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-27 12:12:46,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:46,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:46,528 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:46,529 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:46,530 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-27 12:12:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-27 12:12:46,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:46,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:46,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-27 12:12:46,531 INFO L87 Difference]: Start difference. First operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 132 states. [2022-04-27 12:12:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:46,533 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-27 12:12:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-27 12:12:46,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:46,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:46,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:46,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 83 states have internal predecessors, (86), 28 states have call successors, (28), 23 states have call predecessors, (28), 22 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-27 12:12:46,535 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-27 12:12:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:46,535 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-27 12:12:46,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 4 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-27 12:12:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-27 12:12:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-27 12:12:46,536 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:46,536 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:46,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:46,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:46,752 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-04-27 12:12:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:46,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283831428] [2022-04-27 12:12:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:46,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:46,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1741868967] [2022-04-27 12:12:46,760 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:12:46,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:46,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:46,761 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:46,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 12:12:48,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:12:48,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:12:48,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-27 12:12:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:48,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:49,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 50);havoc #t~post5; {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-27 12:12:49,569 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:49,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,571 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #61#return; {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:12:49,571 INFO L272 TraceCheckUtils]: 18: Hoare triple {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:49,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,572 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7455#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:49,572 INFO L272 TraceCheckUtils]: 23: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:49,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:49,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:49,573 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:49,573 INFO L272 TraceCheckUtils]: 28: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:49,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:49,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:49,573 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:49,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(#t~post5 < 50);havoc #t~post5; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,589 INFO L272 TraceCheckUtils]: 36: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:49,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:49,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:49,590 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #59#return; {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,590 INFO L272 TraceCheckUtils]: 41: Hoare triple {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:49,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,591 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7505#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #61#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,591 INFO L272 TraceCheckUtils]: 46: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:49,592 INFO L290 TraceCheckUtils]: 48: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,592 INFO L290 TraceCheckUtils]: 49: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,592 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #63#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,592 INFO L272 TraceCheckUtils]: 51: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,593 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:49,593 INFO L290 TraceCheckUtils]: 53: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,593 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,593 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #65#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,594 INFO L272 TraceCheckUtils]: 56: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:49,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:49,594 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:49,594 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #67#return; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} assume !!(#t~post5 < 50);havoc #t~post5; {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} is VALID [2022-04-27 12:12:49,601 INFO L272 TraceCheckUtils]: 64: Hoare triple {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:49,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,603 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7542#(and (= (+ main_~y~0 8 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (- 3)) (* main_~n~0 (- 3))) main_~z~0) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= main_~x~0 (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3) (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0)))))} #59#return; {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:49,603 INFO L272 TraceCheckUtils]: 69: Hoare triple {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:49,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:49,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,603 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:49,604 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7471#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:49,604 INFO L272 TraceCheckUtils]: 74: Hoare triple {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:49,605 INFO L290 TraceCheckUtils]: 75: Hoare triple {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:49,605 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-27 12:12:49,605 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-27 12:12:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 104 proven. 43 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2022-04-27 12:12:49,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:12:50,624 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-27 12:12:50,624 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-27 12:12:50,624 INFO L290 TraceCheckUtils]: 75: Hoare triple {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:50,625 INFO L272 TraceCheckUtils]: 74: Hoare triple {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:50,625 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7654#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {7627#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-27 12:12:50,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,626 INFO L290 TraceCheckUtils]: 71: Hoare triple {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,626 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:12:50,626 INFO L272 TraceCheckUtils]: 69: Hoare triple {7654#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,627 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {7654#(or (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,627 INFO L290 TraceCheckUtils]: 67: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,628 INFO L290 TraceCheckUtils]: 66: Hoare triple {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:12:50,628 INFO L272 TraceCheckUtils]: 64: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,628 INFO L290 TraceCheckUtils]: 63: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,629 INFO L290 TraceCheckUtils]: 62: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,634 INFO L290 TraceCheckUtils]: 61: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,635 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7397#true} {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,635 INFO L272 TraceCheckUtils]: 56: Hoare triple {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,638 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} {7397#true} #65#return; {7671#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:12:50,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7448#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:12:50,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7664#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:12:50,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,639 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-27 12:12:50,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,639 INFO L272 TraceCheckUtils]: 46: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L272 TraceCheckUtils]: 41: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L272 TraceCheckUtils]: 36: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {7397#true} assume !!(#t~post5 < 50);havoc #t~post5; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {7397#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7397#true} #67#return; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L272 TraceCheckUtils]: 28: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7397#true} #65#return; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L272 TraceCheckUtils]: 23: Hoare triple {7397#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L272 TraceCheckUtils]: 18: Hoare triple {7397#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L272 TraceCheckUtils]: 13: Hoare triple {7397#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L272 TraceCheckUtils]: 8: Hoare triple {7397#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 50);havoc #t~post5; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {7397#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7397#true} is VALID [2022-04-27 12:12:50,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-27 12:12:50,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-27 12:12:50,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-27 12:12:50,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {7397#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7397#true} is VALID [2022-04-27 12:12:50,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-27 12:12:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-04-27 12:12:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:12:50,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283831428] [2022-04-27 12:12:50,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:12:50,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741868967] [2022-04-27 12:12:50,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741868967] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:12:50,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:12:50,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-04-27 12:12:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134589485] [2022-04-27 12:12:50,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:12:50,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-04-27 12:12:50,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:12:50,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 12:12:50,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:50,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 12:12:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:12:50,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 12:12:50,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:12:50,732 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 12:12:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:51,613 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-27 12:12:51,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:12:51,613 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 78 [2022-04-27 12:12:51,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:12:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 12:12:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 12:12:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 12:12:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-27 12:12:51,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-27 12:12:51,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:12:51,666 INFO L225 Difference]: With dead ends: 142 [2022-04-27 12:12:51,666 INFO L226 Difference]: Without dead ends: 138 [2022-04-27 12:12:51,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-27 12:12:51,667 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:12:51,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 88 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:12:51,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-27 12:12:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-27 12:12:51,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:12:51,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:51,752 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:51,753 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:51,755 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-27 12:12:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-27 12:12:51,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:51,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:51,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-27 12:12:51,755 INFO L87 Difference]: Start difference. First operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 138 states. [2022-04-27 12:12:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:12:51,757 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-27 12:12:51,757 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-27 12:12:51,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:12:51,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:12:51,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:12:51,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:12:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.0465116279069768) internal successors, (90), 87 states have internal predecessors, (90), 28 states have call successors, (28), 25 states have call predecessors, (28), 23 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 12:12:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-27 12:12:51,760 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-27 12:12:51,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:12:51,760 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-27 12:12:51,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 9 states have internal predecessors, (26), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2022-04-27 12:12:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-27 12:12:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-27 12:12:51,761 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:12:51,761 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:12:51,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 12:12:51,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 12:12:51,977 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:12:51,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:12:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-04-27 12:12:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:12:51,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046875515] [2022-04-27 12:12:51,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:12:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:12:51,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:12:51,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356676018] [2022-04-27 12:12:51,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:12:51,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:12:51,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:12:52,012 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:12:52,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 12:12:52,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:12:52,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:12:52,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 12:12:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:12:52,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:12:52,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {8554#true} call ULTIMATE.init(); {8554#true} is VALID [2022-04-27 12:12:52,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {8554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8554#true} is VALID [2022-04-27 12:12:52,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8554#true} {8554#true} #81#return; {8554#true} is VALID [2022-04-27 12:12:52,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {8554#true} call #t~ret6 := main(); {8554#true} is VALID [2022-04-27 12:12:52,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {8554#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:52,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:52,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:52,672 INFO L272 TraceCheckUtils]: 8: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,672 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:52,673 INFO L272 TraceCheckUtils]: 13: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,673 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:52,673 INFO L272 TraceCheckUtils]: 18: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,674 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:52,674 INFO L272 TraceCheckUtils]: 23: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,674 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:52,674 INFO L272 TraceCheckUtils]: 28: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,675 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8554#true} {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:12:52,675 INFO L290 TraceCheckUtils]: 33: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,676 INFO L272 TraceCheckUtils]: 36: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,676 INFO L290 TraceCheckUtils]: 37: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,676 INFO L290 TraceCheckUtils]: 39: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,677 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #59#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,677 INFO L272 TraceCheckUtils]: 41: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,677 INFO L290 TraceCheckUtils]: 42: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,677 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #61#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,677 INFO L272 TraceCheckUtils]: 46: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,677 INFO L290 TraceCheckUtils]: 47: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,678 INFO L290 TraceCheckUtils]: 48: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,678 INFO L290 TraceCheckUtils]: 49: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,678 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #63#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,678 INFO L272 TraceCheckUtils]: 51: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,678 INFO L290 TraceCheckUtils]: 52: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,678 INFO L290 TraceCheckUtils]: 53: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,679 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #65#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,679 INFO L272 TraceCheckUtils]: 56: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,679 INFO L290 TraceCheckUtils]: 59: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,679 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8554#true} {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} #67#return; {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,680 INFO L290 TraceCheckUtils]: 62: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,680 INFO L290 TraceCheckUtils]: 63: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,681 INFO L272 TraceCheckUtils]: 64: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,681 INFO L290 TraceCheckUtils]: 67: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,681 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #59#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,681 INFO L272 TraceCheckUtils]: 69: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,681 INFO L290 TraceCheckUtils]: 70: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,681 INFO L290 TraceCheckUtils]: 71: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,681 INFO L290 TraceCheckUtils]: 72: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,682 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #61#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,682 INFO L272 TraceCheckUtils]: 74: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,682 INFO L290 TraceCheckUtils]: 75: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,682 INFO L290 TraceCheckUtils]: 76: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,682 INFO L290 TraceCheckUtils]: 77: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,683 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #63#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,683 INFO L272 TraceCheckUtils]: 79: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,683 INFO L290 TraceCheckUtils]: 80: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,683 INFO L290 TraceCheckUtils]: 81: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,683 INFO L290 TraceCheckUtils]: 82: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,683 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #65#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,683 INFO L272 TraceCheckUtils]: 84: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,683 INFO L290 TraceCheckUtils]: 85: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,683 INFO L290 TraceCheckUtils]: 86: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,683 INFO L290 TraceCheckUtils]: 87: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,684 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {8554#true} {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} #67#return; {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-27 12:12:52,684 INFO L290 TraceCheckUtils]: 89: Hoare triple {8744#(and (<= main_~n~0 (+ main_~a~0 1)) (= main_~z~0 18) (= 7 (+ main_~y~0 (- 12))) (= (+ (- 2) main_~n~0) 0))} assume !(~n~0 <= ~a~0); {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} is VALID [2022-04-27 12:12:52,684 INFO L272 TraceCheckUtils]: 90: Hoare triple {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,684 INFO L290 TraceCheckUtils]: 91: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,684 INFO L290 TraceCheckUtils]: 92: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,684 INFO L290 TraceCheckUtils]: 93: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,685 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {8554#true} {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} #69#return; {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} is VALID [2022-04-27 12:12:52,685 INFO L272 TraceCheckUtils]: 95: Hoare triple {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {8554#true} is VALID [2022-04-27 12:12:52,685 INFO L290 TraceCheckUtils]: 96: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-27 12:12:52,685 INFO L290 TraceCheckUtils]: 97: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-27 12:12:52,685 INFO L290 TraceCheckUtils]: 98: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-27 12:12:52,686 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {8554#true} {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} #71#return; {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} is VALID [2022-04-27 12:12:52,686 INFO L272 TraceCheckUtils]: 100: Hoare triple {8829#(and (not (<= 2 main_~a~0)) (= main_~z~0 18) (<= 1 main_~a~0) (= 7 (+ main_~y~0 (- 12))))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {8863#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:12:52,687 INFO L290 TraceCheckUtils]: 101: Hoare triple {8863#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8867#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:12:52,687 INFO L290 TraceCheckUtils]: 102: Hoare triple {8867#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8555#false} is VALID [2022-04-27 12:12:52,687 INFO L290 TraceCheckUtils]: 103: Hoare triple {8555#false} assume !false; {8555#false} is VALID [2022-04-27 12:12:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-27 12:12:52,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:02,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046875515] [2022-04-27 12:13:02,090 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:02,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356676018] [2022-04-27 12:13:02,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356676018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:13:02,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:13:02,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 12:13:02,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590319394] [2022-04-27 12:13:02,090 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:02,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-27 12:13:02,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:02,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:02,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:02,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:13:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:02,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:13:02,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:13:02,146 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:02,964 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-27 12:13:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:13:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 104 [2022-04-27 12:13:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 12:13:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 12:13:02,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-27 12:13:03,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:03,040 INFO L225 Difference]: With dead ends: 140 [2022-04-27 12:13:03,040 INFO L226 Difference]: Without dead ends: 129 [2022-04-27 12:13:03,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:13:03,040 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:03,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:13:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-27 12:13:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-27 12:13:03,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:03,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:13:03,115 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:13:03,115 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:13:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:03,118 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-27 12:13:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-27 12:13:03,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:03,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:03,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-27 12:13:03,119 INFO L87 Difference]: Start difference. First operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 129 states. [2022-04-27 12:13:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:03,120 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-27 12:13:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-27 12:13:03,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:03,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:03,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:03,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 25 states have call successors, (25), 23 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:13:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-27 12:13:03,123 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-27 12:13:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:03,123 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-27 12:13:03,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-27 12:13:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-27 12:13:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-27 12:13:03,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:03,126 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:03,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:03,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 12:13:03,339 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:03,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-04-27 12:13:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:03,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127369871] [2022-04-27 12:13:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:03,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:03,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308420878] [2022-04-27 12:13:03,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:13:03,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:03,359 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:03,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 12:13:03,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:13:03,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:13:03,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-27 12:13:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:03,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:04,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {9650#true} call ULTIMATE.init(); {9650#true} is VALID [2022-04-27 12:13:04,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {9650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9650#true} is VALID [2022-04-27 12:13:04,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9650#true} {9650#true} #81#return; {9650#true} is VALID [2022-04-27 12:13:04,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {9650#true} call #t~ret6 := main(); {9650#true} is VALID [2022-04-27 12:13:04,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {9650#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:04,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:04,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:04,120 INFO L272 TraceCheckUtils]: 8: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,121 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:04,121 INFO L272 TraceCheckUtils]: 13: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,121 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:04,121 INFO L272 TraceCheckUtils]: 18: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,122 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:04,122 INFO L272 TraceCheckUtils]: 23: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,122 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:04,122 INFO L272 TraceCheckUtils]: 28: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,123 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9650#true} {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:04,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {9670#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 12:13:04,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 12:13:04,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 12:13:04,124 INFO L272 TraceCheckUtils]: 36: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,125 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #59#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 12:13:04,125 INFO L272 TraceCheckUtils]: 41: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,127 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #61#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 12:13:04,127 INFO L272 TraceCheckUtils]: 46: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,127 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #63#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 12:13:04,127 INFO L272 TraceCheckUtils]: 51: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,130 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #65#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 12:13:04,130 INFO L272 TraceCheckUtils]: 56: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,130 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9650#true} {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #67#return; {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-27 12:13:04,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {9755#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-27 12:13:04,131 INFO L290 TraceCheckUtils]: 62: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-27 12:13:04,131 INFO L290 TraceCheckUtils]: 63: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-27 12:13:04,131 INFO L272 TraceCheckUtils]: 64: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,131 INFO L290 TraceCheckUtils]: 65: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,131 INFO L290 TraceCheckUtils]: 66: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,132 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #59#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-27 12:13:04,132 INFO L272 TraceCheckUtils]: 69: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,132 INFO L290 TraceCheckUtils]: 70: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,132 INFO L290 TraceCheckUtils]: 71: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,132 INFO L290 TraceCheckUtils]: 72: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,132 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #61#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-27 12:13:04,132 INFO L272 TraceCheckUtils]: 74: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,132 INFO L290 TraceCheckUtils]: 75: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,132 INFO L290 TraceCheckUtils]: 76: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,132 INFO L290 TraceCheckUtils]: 77: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,133 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #63#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-27 12:13:04,133 INFO L272 TraceCheckUtils]: 79: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,133 INFO L290 TraceCheckUtils]: 80: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,133 INFO L290 TraceCheckUtils]: 81: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,133 INFO L290 TraceCheckUtils]: 82: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,133 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #65#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-27 12:13:04,133 INFO L272 TraceCheckUtils]: 84: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,133 INFO L290 TraceCheckUtils]: 85: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,133 INFO L290 TraceCheckUtils]: 86: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,133 INFO L290 TraceCheckUtils]: 87: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,134 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9650#true} {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} #67#return; {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} is VALID [2022-04-27 12:13:04,134 INFO L290 TraceCheckUtils]: 89: Hoare triple {9840#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ main_~y~0 (- 18)) 1) (= (+ (* main_~y~0 2) (- 30)) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,163 INFO L290 TraceCheckUtils]: 90: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,163 INFO L290 TraceCheckUtils]: 91: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} assume !!(#t~post5 < 50);havoc #t~post5; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,163 INFO L272 TraceCheckUtils]: 92: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,163 INFO L290 TraceCheckUtils]: 93: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,163 INFO L290 TraceCheckUtils]: 94: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,163 INFO L290 TraceCheckUtils]: 95: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,164 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #59#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,164 INFO L272 TraceCheckUtils]: 97: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,164 INFO L290 TraceCheckUtils]: 98: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,164 INFO L290 TraceCheckUtils]: 99: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,164 INFO L290 TraceCheckUtils]: 100: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,164 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #61#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,164 INFO L272 TraceCheckUtils]: 102: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,165 INFO L290 TraceCheckUtils]: 103: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,165 INFO L290 TraceCheckUtils]: 104: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,165 INFO L290 TraceCheckUtils]: 105: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,165 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #63#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,165 INFO L272 TraceCheckUtils]: 107: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,165 INFO L290 TraceCheckUtils]: 108: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,165 INFO L290 TraceCheckUtils]: 109: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,165 INFO L290 TraceCheckUtils]: 110: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,166 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #65#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,166 INFO L272 TraceCheckUtils]: 112: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,166 INFO L290 TraceCheckUtils]: 113: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,166 INFO L290 TraceCheckUtils]: 114: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,166 INFO L290 TraceCheckUtils]: 115: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,167 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {9650#true} {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} #67#return; {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,167 INFO L290 TraceCheckUtils]: 117: Hoare triple {9925#(and (= main_~n~0 3) (= main_~z~0 24) (<= 2 main_~a~0) (= main_~x~0 27))} assume !(~n~0 <= ~a~0); {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,167 INFO L272 TraceCheckUtils]: 118: Hoare triple {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9650#true} is VALID [2022-04-27 12:13:04,167 INFO L290 TraceCheckUtils]: 119: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-27 12:13:04,167 INFO L290 TraceCheckUtils]: 120: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-27 12:13:04,167 INFO L290 TraceCheckUtils]: 121: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-27 12:13:04,168 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {9650#true} {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} #69#return; {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} is VALID [2022-04-27 12:13:04,168 INFO L272 TraceCheckUtils]: 123: Hoare triple {10010#(and (= main_~z~0 24) (not (<= 3 main_~a~0)) (<= 2 main_~a~0) (= main_~x~0 27))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10029#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:04,169 INFO L290 TraceCheckUtils]: 124: Hoare triple {10029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:04,169 INFO L290 TraceCheckUtils]: 125: Hoare triple {10033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9651#false} is VALID [2022-04-27 12:13:04,169 INFO L290 TraceCheckUtils]: 126: Hoare triple {9651#false} assume !false; {9651#false} is VALID [2022-04-27 12:13:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 42 proven. 48 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-27 12:13:04,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127369871] [2022-04-27 12:13:04,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308420878] [2022-04-27 12:13:04,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308420878] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:13:04,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:13:04,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 12:13:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652852987] [2022-04-27 12:13:04,484 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-27 12:13:04,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:04,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:04,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:04,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:13:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:04,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:13:04,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:13:04,534 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:05,480 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-27 12:13:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:13:05,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 127 [2022-04-27 12:13:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-27 12:13:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-27 12:13:05,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-27 12:13:05,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:05,548 INFO L225 Difference]: With dead ends: 152 [2022-04-27 12:13:05,549 INFO L226 Difference]: Without dead ends: 150 [2022-04-27 12:13:05,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:13:05,551 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:05,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:13:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-27 12:13:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-27 12:13:05,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:05,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:13:05,626 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:13:05,628 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:13:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:05,636 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-27 12:13:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-27 12:13:05,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:05,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:05,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-27 12:13:05,636 INFO L87 Difference]: Start difference. First operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 150 states. [2022-04-27 12:13:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:05,638 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-27 12:13:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-27 12:13:05,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:05,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:05,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:05,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 32 states have call successors, (32), 26 states have call predecessors, (32), 25 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-27 12:13:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-27 12:13:05,641 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-27 12:13:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:05,641 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-27 12:13:05,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2022-04-27 12:13:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-27 12:13:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-27 12:13:05,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:05,642 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:05,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-27 12:13:05,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 12:13:05,854 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-04-27 12:13:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:05,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134475622] [2022-04-27 12:13:05,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:05,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:05,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:05,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225201407] [2022-04-27 12:13:05,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:13:05,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:05,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:05,871 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:05,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 12:13:05,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:13:05,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:13:05,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:13:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:05,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:06,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-27 12:13:06,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {10891#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10899#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:06,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {10899#(<= ~counter~0 0)} assume true; {10899#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:06,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10899#(<= ~counter~0 0)} {10891#true} #81#return; {10899#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:06,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {10899#(<= ~counter~0 0)} call #t~ret6 := main(); {10899#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:06,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {10899#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10899#(<= ~counter~0 0)} is VALID [2022-04-27 12:13:06,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {10899#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {10915#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,399 INFO L272 TraceCheckUtils]: 8: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,400 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #59#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,400 INFO L272 TraceCheckUtils]: 13: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,401 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #61#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,401 INFO L272 TraceCheckUtils]: 18: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,401 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #63#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,402 INFO L272 TraceCheckUtils]: 23: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,402 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #65#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,403 INFO L272 TraceCheckUtils]: 28: Hoare triple {10915#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,403 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #67#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {10915#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {10915#(<= ~counter~0 1)} is VALID [2022-04-27 12:13:06,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {10915#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {11000#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,404 INFO L272 TraceCheckUtils]: 36: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,405 INFO L290 TraceCheckUtils]: 39: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,405 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #59#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,405 INFO L272 TraceCheckUtils]: 41: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,406 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #61#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,406 INFO L272 TraceCheckUtils]: 46: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,407 INFO L290 TraceCheckUtils]: 47: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,407 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #63#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,407 INFO L272 TraceCheckUtils]: 51: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,408 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,408 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #65#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,408 INFO L272 TraceCheckUtils]: 56: Hoare triple {11000#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,409 INFO L290 TraceCheckUtils]: 58: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,409 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,409 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #67#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {11000#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11000#(<= ~counter~0 2)} is VALID [2022-04-27 12:13:06,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {11000#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {11085#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,410 INFO L272 TraceCheckUtils]: 64: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,411 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #59#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,411 INFO L272 TraceCheckUtils]: 69: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,411 INFO L290 TraceCheckUtils]: 70: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,412 INFO L290 TraceCheckUtils]: 71: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,412 INFO L290 TraceCheckUtils]: 72: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,413 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #61#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,413 INFO L272 TraceCheckUtils]: 74: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,413 INFO L290 TraceCheckUtils]: 75: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,413 INFO L290 TraceCheckUtils]: 76: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,413 INFO L290 TraceCheckUtils]: 77: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,414 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #63#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,414 INFO L272 TraceCheckUtils]: 79: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,414 INFO L290 TraceCheckUtils]: 80: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,414 INFO L290 TraceCheckUtils]: 81: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,414 INFO L290 TraceCheckUtils]: 82: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,415 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #65#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,415 INFO L272 TraceCheckUtils]: 84: Hoare triple {11085#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,415 INFO L290 TraceCheckUtils]: 85: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,415 INFO L290 TraceCheckUtils]: 87: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,416 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #67#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,416 INFO L290 TraceCheckUtils]: 89: Hoare triple {11085#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11085#(<= ~counter~0 3)} is VALID [2022-04-27 12:13:06,416 INFO L290 TraceCheckUtils]: 90: Hoare triple {11085#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,416 INFO L290 TraceCheckUtils]: 91: Hoare triple {11170#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,417 INFO L272 TraceCheckUtils]: 92: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,417 INFO L290 TraceCheckUtils]: 93: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,417 INFO L290 TraceCheckUtils]: 94: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,417 INFO L290 TraceCheckUtils]: 95: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,417 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #59#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,417 INFO L272 TraceCheckUtils]: 97: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,421 INFO L290 TraceCheckUtils]: 98: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,422 INFO L290 TraceCheckUtils]: 99: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,422 INFO L290 TraceCheckUtils]: 100: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,422 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #61#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,422 INFO L272 TraceCheckUtils]: 102: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,423 INFO L290 TraceCheckUtils]: 103: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,423 INFO L290 TraceCheckUtils]: 104: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,423 INFO L290 TraceCheckUtils]: 105: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,423 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #63#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,423 INFO L272 TraceCheckUtils]: 107: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,424 INFO L290 TraceCheckUtils]: 108: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,424 INFO L290 TraceCheckUtils]: 109: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,424 INFO L290 TraceCheckUtils]: 110: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,424 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #65#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,424 INFO L272 TraceCheckUtils]: 112: Hoare triple {11170#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,424 INFO L290 TraceCheckUtils]: 113: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,425 INFO L290 TraceCheckUtils]: 114: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,425 INFO L290 TraceCheckUtils]: 115: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,425 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #67#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,425 INFO L290 TraceCheckUtils]: 117: Hoare triple {11170#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11170#(<= ~counter~0 4)} is VALID [2022-04-27 12:13:06,425 INFO L290 TraceCheckUtils]: 118: Hoare triple {11170#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11255#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:13:06,426 INFO L290 TraceCheckUtils]: 119: Hoare triple {11255#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {10892#false} is VALID [2022-04-27 12:13:06,426 INFO L272 TraceCheckUtils]: 120: Hoare triple {10892#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10892#false} is VALID [2022-04-27 12:13:06,426 INFO L290 TraceCheckUtils]: 121: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-27 12:13:06,426 INFO L290 TraceCheckUtils]: 122: Hoare triple {10892#false} assume !(0 == ~cond); {10892#false} is VALID [2022-04-27 12:13:06,426 INFO L290 TraceCheckUtils]: 123: Hoare triple {10892#false} assume true; {10892#false} is VALID [2022-04-27 12:13:06,426 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10892#false} {10892#false} #69#return; {10892#false} is VALID [2022-04-27 12:13:06,426 INFO L272 TraceCheckUtils]: 125: Hoare triple {10892#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10892#false} is VALID [2022-04-27 12:13:06,426 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-27 12:13:06,426 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-27 12:13:06,426 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-27 12:13:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-04-27 12:13:06,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:06,780 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-27 12:13:06,780 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-27 12:13:06,780 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-27 12:13:06,780 INFO L272 TraceCheckUtils]: 125: Hoare triple {10892#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10892#false} is VALID [2022-04-27 12:13:06,780 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10891#true} {10892#false} #69#return; {10892#false} is VALID [2022-04-27 12:13:06,780 INFO L290 TraceCheckUtils]: 123: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,781 INFO L290 TraceCheckUtils]: 122: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,781 INFO L290 TraceCheckUtils]: 121: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,781 INFO L272 TraceCheckUtils]: 120: Hoare triple {10892#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,781 INFO L290 TraceCheckUtils]: 119: Hoare triple {11313#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {10892#false} is VALID [2022-04-27 12:13:06,781 INFO L290 TraceCheckUtils]: 118: Hoare triple {11317#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11313#(< |main_#t~post5| 50)} is VALID [2022-04-27 12:13:06,781 INFO L290 TraceCheckUtils]: 117: Hoare triple {11317#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11317#(< ~counter~0 50)} is VALID [2022-04-27 12:13:06,782 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #67#return; {11317#(< ~counter~0 50)} is VALID [2022-04-27 12:13:06,782 INFO L290 TraceCheckUtils]: 115: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,782 INFO L290 TraceCheckUtils]: 114: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,782 INFO L290 TraceCheckUtils]: 113: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,782 INFO L272 TraceCheckUtils]: 112: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,782 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #65#return; {11317#(< ~counter~0 50)} is VALID [2022-04-27 12:13:06,782 INFO L290 TraceCheckUtils]: 110: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,782 INFO L290 TraceCheckUtils]: 109: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,782 INFO L290 TraceCheckUtils]: 108: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,782 INFO L272 TraceCheckUtils]: 107: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,782 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #63#return; {11317#(< ~counter~0 50)} is VALID [2022-04-27 12:13:06,782 INFO L290 TraceCheckUtils]: 105: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L290 TraceCheckUtils]: 104: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L290 TraceCheckUtils]: 103: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L272 TraceCheckUtils]: 102: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #61#return; {11317#(< ~counter~0 50)} is VALID [2022-04-27 12:13:06,783 INFO L290 TraceCheckUtils]: 100: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L290 TraceCheckUtils]: 99: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L290 TraceCheckUtils]: 98: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L272 TraceCheckUtils]: 97: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #59#return; {11317#(< ~counter~0 50)} is VALID [2022-04-27 12:13:06,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L290 TraceCheckUtils]: 94: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L290 TraceCheckUtils]: 93: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,783 INFO L272 TraceCheckUtils]: 92: Hoare triple {11317#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,784 INFO L290 TraceCheckUtils]: 91: Hoare triple {11317#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {11317#(< ~counter~0 50)} is VALID [2022-04-27 12:13:06,784 INFO L290 TraceCheckUtils]: 90: Hoare triple {11402#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11317#(< ~counter~0 50)} is VALID [2022-04-27 12:13:06,784 INFO L290 TraceCheckUtils]: 89: Hoare triple {11402#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11402#(< ~counter~0 49)} is VALID [2022-04-27 12:13:06,784 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #67#return; {11402#(< ~counter~0 49)} is VALID [2022-04-27 12:13:06,785 INFO L290 TraceCheckUtils]: 87: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,785 INFO L290 TraceCheckUtils]: 86: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,785 INFO L290 TraceCheckUtils]: 85: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,785 INFO L272 TraceCheckUtils]: 84: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,785 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #65#return; {11402#(< ~counter~0 49)} is VALID [2022-04-27 12:13:06,785 INFO L290 TraceCheckUtils]: 82: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,785 INFO L290 TraceCheckUtils]: 81: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,785 INFO L290 TraceCheckUtils]: 80: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,785 INFO L272 TraceCheckUtils]: 79: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,785 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #63#return; {11402#(< ~counter~0 49)} is VALID [2022-04-27 12:13:06,785 INFO L290 TraceCheckUtils]: 77: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L272 TraceCheckUtils]: 74: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #61#return; {11402#(< ~counter~0 49)} is VALID [2022-04-27 12:13:06,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L272 TraceCheckUtils]: 69: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #59#return; {11402#(< ~counter~0 49)} is VALID [2022-04-27 12:13:06,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L290 TraceCheckUtils]: 66: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,786 INFO L272 TraceCheckUtils]: 64: Hoare triple {11402#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,787 INFO L290 TraceCheckUtils]: 63: Hoare triple {11402#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {11402#(< ~counter~0 49)} is VALID [2022-04-27 12:13:06,787 INFO L290 TraceCheckUtils]: 62: Hoare triple {11487#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11402#(< ~counter~0 49)} is VALID [2022-04-27 12:13:06,787 INFO L290 TraceCheckUtils]: 61: Hoare triple {11487#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11487#(< ~counter~0 48)} is VALID [2022-04-27 12:13:06,787 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #67#return; {11487#(< ~counter~0 48)} is VALID [2022-04-27 12:13:06,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,788 INFO L272 TraceCheckUtils]: 56: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,788 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #65#return; {11487#(< ~counter~0 48)} is VALID [2022-04-27 12:13:06,788 INFO L290 TraceCheckUtils]: 54: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,788 INFO L290 TraceCheckUtils]: 53: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,788 INFO L272 TraceCheckUtils]: 51: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,789 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #63#return; {11487#(< ~counter~0 48)} is VALID [2022-04-27 12:13:06,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,789 INFO L272 TraceCheckUtils]: 46: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,789 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #61#return; {11487#(< ~counter~0 48)} is VALID [2022-04-27 12:13:06,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,789 INFO L272 TraceCheckUtils]: 41: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,790 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #59#return; {11487#(< ~counter~0 48)} is VALID [2022-04-27 12:13:06,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,790 INFO L272 TraceCheckUtils]: 36: Hoare triple {11487#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {11487#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {11487#(< ~counter~0 48)} is VALID [2022-04-27 12:13:06,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {11572#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11487#(< ~counter~0 48)} is VALID [2022-04-27 12:13:06,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {11572#(< ~counter~0 47)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {11572#(< ~counter~0 47)} is VALID [2022-04-27 12:13:06,791 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #67#return; {11572#(< ~counter~0 47)} is VALID [2022-04-27 12:13:06,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,791 INFO L272 TraceCheckUtils]: 28: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,792 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #65#return; {11572#(< ~counter~0 47)} is VALID [2022-04-27 12:13:06,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,792 INFO L272 TraceCheckUtils]: 23: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,792 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #63#return; {11572#(< ~counter~0 47)} is VALID [2022-04-27 12:13:06,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,792 INFO L272 TraceCheckUtils]: 18: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,792 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #61#return; {11572#(< ~counter~0 47)} is VALID [2022-04-27 12:13:06,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,793 INFO L272 TraceCheckUtils]: 13: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,793 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #59#return; {11572#(< ~counter~0 47)} is VALID [2022-04-27 12:13:06,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-27 12:13:06,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-27 12:13:06,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-27 12:13:06,793 INFO L272 TraceCheckUtils]: 8: Hoare triple {11572#(< ~counter~0 47)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-27 12:13:06,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {11572#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {11572#(< ~counter~0 47)} is VALID [2022-04-27 12:13:06,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {11657#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11572#(< ~counter~0 47)} is VALID [2022-04-27 12:13:06,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {11657#(< ~counter~0 46)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11657#(< ~counter~0 46)} is VALID [2022-04-27 12:13:06,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {11657#(< ~counter~0 46)} call #t~ret6 := main(); {11657#(< ~counter~0 46)} is VALID [2022-04-27 12:13:06,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11657#(< ~counter~0 46)} {10891#true} #81#return; {11657#(< ~counter~0 46)} is VALID [2022-04-27 12:13:06,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {11657#(< ~counter~0 46)} assume true; {11657#(< ~counter~0 46)} is VALID [2022-04-27 12:13:06,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {10891#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11657#(< ~counter~0 46)} is VALID [2022-04-27 12:13:06,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-27 12:13:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2022-04-27 12:13:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:06,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134475622] [2022-04-27 12:13:06,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:06,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225201407] [2022-04-27 12:13:06,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225201407] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:13:06,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:13:06,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 12:13:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526387645] [2022-04-27 12:13:06,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-27 12:13:06,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:06,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-27 12:13:06,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:06,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 12:13:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:06,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 12:13:06,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:13:06,866 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-27 12:13:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:08,319 INFO L93 Difference]: Finished difference Result 368 states and 388 transitions. [2022-04-27 12:13:08,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 12:13:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) Word has length 129 [2022-04-27 12:13:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-27 12:13:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-27 12:13:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-27 12:13:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-27 12:13:08,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 241 transitions. [2022-04-27 12:13:08,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:08,524 INFO L225 Difference]: With dead ends: 368 [2022-04-27 12:13:08,524 INFO L226 Difference]: Without dead ends: 353 [2022-04-27 12:13:08,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 12:13:08,525 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 149 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:08,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 267 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:13:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-27 12:13:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-04-27 12:13:08,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:08,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-27 12:13:08,699 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-27 12:13:08,699 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-27 12:13:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:08,705 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-27 12:13:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-27 12:13:08,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:08,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:08,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) Second operand 353 states. [2022-04-27 12:13:08,707 INFO L87 Difference]: Start difference. First operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) Second operand 353 states. [2022-04-27 12:13:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:08,712 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-27 12:13:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-27 12:13:08,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:08,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:08,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:08,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.0463917525773196) internal successors, (203), 200 states have internal predecessors, (203), 63 states have call successors, (63), 55 states have call predecessors, (63), 53 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-27 12:13:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-04-27 12:13:08,719 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-04-27 12:13:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:08,719 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-04-27 12:13:08,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 12 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (44), 11 states have call predecessors, (44), 10 states have call successors, (44) [2022-04-27 12:13:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-04-27 12:13:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 12:13:08,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:08,720 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:08,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:08,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 12:13:08,937 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:08,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-27 12:13:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:08,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117058089] [2022-04-27 12:13:08,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:08,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:08,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990639942] [2022-04-27 12:13:08,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:13:08,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:08,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:08,948 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:08,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 12:13:09,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 12:13:09,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:13:09,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 12:13:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:09,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:10,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {13359#true} call ULTIMATE.init(); {13359#true} is VALID [2022-04-27 12:13:10,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {13359#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13359#true} is VALID [2022-04-27 12:13:10,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13359#true} {13359#true} #81#return; {13359#true} is VALID [2022-04-27 12:13:10,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {13359#true} call #t~ret6 := main(); {13359#true} is VALID [2022-04-27 12:13:10,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {13359#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:10,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:10,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 50);havoc #t~post5; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:10,158 INFO L272 TraceCheckUtils]: 8: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,159 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:10,159 INFO L272 TraceCheckUtils]: 13: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,159 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:10,159 INFO L272 TraceCheckUtils]: 18: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,160 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:10,160 INFO L272 TraceCheckUtils]: 23: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,161 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #65#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:10,161 INFO L272 TraceCheckUtils]: 28: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,161 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13359#true} {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #67#return; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-27 12:13:10,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-27 12:13:10,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-27 12:13:10,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-27 12:13:10,162 INFO L272 TraceCheckUtils]: 36: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,163 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #59#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-27 12:13:10,163 INFO L272 TraceCheckUtils]: 41: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,163 INFO L290 TraceCheckUtils]: 42: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,163 INFO L290 TraceCheckUtils]: 43: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,163 INFO L290 TraceCheckUtils]: 44: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,164 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #61#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-27 12:13:10,164 INFO L272 TraceCheckUtils]: 46: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,164 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #63#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-27 12:13:10,164 INFO L272 TraceCheckUtils]: 51: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,165 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #65#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-27 12:13:10,165 INFO L272 TraceCheckUtils]: 56: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,165 INFO L290 TraceCheckUtils]: 59: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,166 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {13359#true} {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} #67#return; {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} is VALID [2022-04-27 12:13:10,166 INFO L290 TraceCheckUtils]: 61: Hoare triple {13464#(and (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1) (= (+ main_~z~0 (- 5)) main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:13:10,166 INFO L290 TraceCheckUtils]: 62: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:13:10,167 INFO L290 TraceCheckUtils]: 63: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(#t~post5 < 50);havoc #t~post5; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:13:10,167 INFO L272 TraceCheckUtils]: 64: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,167 INFO L290 TraceCheckUtils]: 65: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,167 INFO L290 TraceCheckUtils]: 66: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,167 INFO L290 TraceCheckUtils]: 67: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,167 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #59#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:13:10,167 INFO L272 TraceCheckUtils]: 69: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,167 INFO L290 TraceCheckUtils]: 71: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,168 INFO L290 TraceCheckUtils]: 72: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,168 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #61#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:13:10,168 INFO L272 TraceCheckUtils]: 74: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,168 INFO L290 TraceCheckUtils]: 75: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,168 INFO L290 TraceCheckUtils]: 76: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,168 INFO L290 TraceCheckUtils]: 77: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,169 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #63#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:13:10,169 INFO L272 TraceCheckUtils]: 79: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,169 INFO L290 TraceCheckUtils]: 80: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,169 INFO L290 TraceCheckUtils]: 81: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,169 INFO L290 TraceCheckUtils]: 82: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,169 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #65#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:13:10,169 INFO L272 TraceCheckUtils]: 84: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,170 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13359#true} {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #67#return; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-27 12:13:10,170 INFO L290 TraceCheckUtils]: 89: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-27 12:13:10,171 INFO L290 TraceCheckUtils]: 90: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-27 12:13:10,171 INFO L290 TraceCheckUtils]: 91: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} assume !!(#t~post5 < 50);havoc #t~post5; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-27 12:13:10,171 INFO L272 TraceCheckUtils]: 92: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,171 INFO L290 TraceCheckUtils]: 93: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,171 INFO L290 TraceCheckUtils]: 94: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,171 INFO L290 TraceCheckUtils]: 95: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,172 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #59#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-27 12:13:10,172 INFO L272 TraceCheckUtils]: 97: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,172 INFO L290 TraceCheckUtils]: 98: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,172 INFO L290 TraceCheckUtils]: 99: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,172 INFO L290 TraceCheckUtils]: 100: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,172 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #61#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-27 12:13:10,173 INFO L272 TraceCheckUtils]: 102: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,173 INFO L290 TraceCheckUtils]: 103: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,173 INFO L290 TraceCheckUtils]: 104: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,173 INFO L290 TraceCheckUtils]: 105: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,173 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #63#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-27 12:13:10,173 INFO L272 TraceCheckUtils]: 107: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,173 INFO L290 TraceCheckUtils]: 108: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,173 INFO L290 TraceCheckUtils]: 109: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,173 INFO L290 TraceCheckUtils]: 110: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,174 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #65#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-27 12:13:10,174 INFO L272 TraceCheckUtils]: 112: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,174 INFO L290 TraceCheckUtils]: 113: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,174 INFO L290 TraceCheckUtils]: 114: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,174 INFO L290 TraceCheckUtils]: 115: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,174 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {13359#true} {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} #67#return; {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} is VALID [2022-04-27 12:13:10,175 INFO L290 TraceCheckUtils]: 117: Hoare triple {13634#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (- 13) main_~y~0) main_~z~0) (= (+ main_~y~0 (- 19)) 18) (= (+ (- 2) main_~n~0) 1))} assume !(~n~0 <= ~a~0); {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:10,175 INFO L272 TraceCheckUtils]: 118: Hoare triple {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,175 INFO L290 TraceCheckUtils]: 119: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,175 INFO L290 TraceCheckUtils]: 120: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,175 INFO L290 TraceCheckUtils]: 121: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,175 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13359#true} {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} #69#return; {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:10,176 INFO L272 TraceCheckUtils]: 123: Hoare triple {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {13359#true} is VALID [2022-04-27 12:13:10,176 INFO L290 TraceCheckUtils]: 124: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-27 12:13:10,176 INFO L290 TraceCheckUtils]: 125: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-27 12:13:10,176 INFO L290 TraceCheckUtils]: 126: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-27 12:13:10,176 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {13359#true} {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} #71#return; {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} is VALID [2022-04-27 12:13:10,177 INFO L272 TraceCheckUtils]: 128: Hoare triple {13719#(and (= (+ (- 13) main_~y~0) main_~z~0) (not (<= 3 main_~a~0)) (= (+ main_~y~0 (- 19)) 18) (<= 2 main_~a~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {13753#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:13:10,177 INFO L290 TraceCheckUtils]: 129: Hoare triple {13753#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13757#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:10,177 INFO L290 TraceCheckUtils]: 130: Hoare triple {13757#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13360#false} is VALID [2022-04-27 12:13:10,178 INFO L290 TraceCheckUtils]: 131: Hoare triple {13360#false} assume !false; {13360#false} is VALID [2022-04-27 12:13:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-27 12:13:10,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:21,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:21,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117058089] [2022-04-27 12:13:21,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:21,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990639942] [2022-04-27 12:13:21,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990639942] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:13:21,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:13:21,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 12:13:21,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20746697] [2022-04-27 12:13:21,278 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:21,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-27 12:13:21,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:21,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:13:21,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:21,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:13:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:21,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:13:21,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:13:21,346 INFO L87 Difference]: Start difference. First operand 311 states and 326 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:13:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:22,579 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2022-04-27 12:13:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:13:22,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) Word has length 132 [2022-04-27 12:13:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:13:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-27 12:13:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:13:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-27 12:13:22,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-27 12:13:22,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:22,697 INFO L225 Difference]: With dead ends: 313 [2022-04-27 12:13:22,697 INFO L226 Difference]: Without dead ends: 302 [2022-04-27 12:13:22,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:13:22,698 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:22,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:13:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-27 12:13:22,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-04-27 12:13:22,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:22,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 12:13:22,864 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 12:13:22,864 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 12:13:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:22,869 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-27 12:13:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-27 12:13:22,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:22,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:22,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 302 states. [2022-04-27 12:13:22,870 INFO L87 Difference]: Start difference. First operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) Second operand 302 states. [2022-04-27 12:13:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:22,875 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-27 12:13:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-27 12:13:22,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:22,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:22,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:22,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 189 states have (on average 1.0423280423280423) internal successors, (197), 195 states have internal predecessors, (197), 60 states have call successors, (60), 53 states have call predecessors, (60), 52 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 12:13:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-04-27 12:13:22,881 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-04-27 12:13:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:22,881 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-04-27 12:13:22,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 6 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (23), 6 states have call predecessors, (23), 6 states have call successors, (23) [2022-04-27 12:13:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-27 12:13:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-27 12:13:22,882 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:22,882 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:22,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:23,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:23,089 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:23,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-04-27 12:13:23,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:23,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146859075] [2022-04-27 12:13:23,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:23,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:23,106 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:23,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655684737] [2022-04-27 12:13:23,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:13:23,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:23,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:23,109 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:23,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 12:13:23,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 12:13:23,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:13:23,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:13:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:23,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:13:25,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {15374#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #81#return; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret6 := main(); {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {15374#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L272 TraceCheckUtils]: 8: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L272 TraceCheckUtils]: 13: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L272 TraceCheckUtils]: 18: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L272 TraceCheckUtils]: 23: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L272 TraceCheckUtils]: 28: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L272 TraceCheckUtils]: 36: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L272 TraceCheckUtils]: 41: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L272 TraceCheckUtils]: 46: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 47: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L272 TraceCheckUtils]: 51: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L272 TraceCheckUtils]: 56: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L272 TraceCheckUtils]: 64: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 65: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 66: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 67: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L272 TraceCheckUtils]: 69: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 70: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 71: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 72: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L272 TraceCheckUtils]: 74: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 75: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L272 TraceCheckUtils]: 79: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,265 INFO L290 TraceCheckUtils]: 80: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 82: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L272 TraceCheckUtils]: 84: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 85: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 86: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 87: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 89: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 90: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 91: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L272 TraceCheckUtils]: 92: Hoare triple {15374#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 93: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L272 TraceCheckUtils]: 97: Hoare triple {15374#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 99: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L290 TraceCheckUtils]: 100: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-27 12:13:25,266 INFO L272 TraceCheckUtils]: 102: Hoare triple {15374#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L290 TraceCheckUtils]: 103: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L290 TraceCheckUtils]: 104: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L290 TraceCheckUtils]: 105: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L272 TraceCheckUtils]: 107: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L290 TraceCheckUtils]: 108: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L290 TraceCheckUtils]: 109: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L290 TraceCheckUtils]: 110: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L272 TraceCheckUtils]: 112: Hoare triple {15374#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L290 TraceCheckUtils]: 113: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L290 TraceCheckUtils]: 114: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L290 TraceCheckUtils]: 115: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,267 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-27 12:13:25,269 INFO L290 TraceCheckUtils]: 117: Hoare triple {15374#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-27 12:13:25,269 INFO L290 TraceCheckUtils]: 118: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-27 12:13:25,269 INFO L290 TraceCheckUtils]: 119: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-27 12:13:25,270 INFO L272 TraceCheckUtils]: 120: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,270 INFO L290 TraceCheckUtils]: 121: Hoare triple {15374#true} ~cond := #in~cond; {15743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:25,270 INFO L290 TraceCheckUtils]: 122: Hoare triple {15743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:13:25,270 INFO L290 TraceCheckUtils]: 123: Hoare triple {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:13:25,271 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} {15730#(<= main_~n~0 (+ main_~a~0 1))} #59#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:13:25,271 INFO L272 TraceCheckUtils]: 125: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,271 INFO L290 TraceCheckUtils]: 126: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,271 INFO L290 TraceCheckUtils]: 127: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,271 INFO L290 TraceCheckUtils]: 128: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,272 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #61#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:13:25,272 INFO L272 TraceCheckUtils]: 130: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,272 INFO L290 TraceCheckUtils]: 131: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,272 INFO L290 TraceCheckUtils]: 132: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,272 INFO L290 TraceCheckUtils]: 133: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,272 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #63#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:13:25,272 INFO L272 TraceCheckUtils]: 135: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,272 INFO L290 TraceCheckUtils]: 136: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,272 INFO L290 TraceCheckUtils]: 137: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,272 INFO L290 TraceCheckUtils]: 138: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,273 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #65#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:13:25,273 INFO L272 TraceCheckUtils]: 140: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,273 INFO L290 TraceCheckUtils]: 141: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,273 INFO L290 TraceCheckUtils]: 142: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,273 INFO L290 TraceCheckUtils]: 143: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,273 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15374#true} {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} #67#return; {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-27 12:13:25,274 INFO L290 TraceCheckUtils]: 145: Hoare triple {15754#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~n~0 6) 6) main_~z~0))} assume !(~n~0 <= ~a~0); {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:13:25,274 INFO L272 TraceCheckUtils]: 146: Hoare triple {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-27 12:13:25,275 INFO L290 TraceCheckUtils]: 147: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-27 12:13:25,275 INFO L290 TraceCheckUtils]: 148: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-27 12:13:25,275 INFO L290 TraceCheckUtils]: 149: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-27 12:13:25,275 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {15374#true} {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #69#return; {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:13:27,278 WARN L272 TraceCheckUtils]: 151: Hoare triple {15818#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 12:13:27,278 INFO L290 TraceCheckUtils]: 152: Hoare triple {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15841#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:13:27,279 INFO L290 TraceCheckUtils]: 153: Hoare triple {15841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15375#false} is VALID [2022-04-27 12:13:27,279 INFO L290 TraceCheckUtils]: 154: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-27 12:13:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 143 proven. 16 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2022-04-27 12:13:27,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:13:29,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:13:29,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146859075] [2022-04-27 12:13:29,359 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:13:29,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655684737] [2022-04-27 12:13:29,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655684737] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:13:29,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:13:29,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-27 12:13:29,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152330535] [2022-04-27 12:13:29,359 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:13:29,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-04-27 12:13:29,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:13:29,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:13:31,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:31,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:13:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:13:31,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:13:31,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2022-04-27 12:13:31,309 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:13:35,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:13:38,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:13:42,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:13:44,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:13:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:44,838 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-27 12:13:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:13:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 155 [2022-04-27 12:13:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:13:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:13:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-27 12:13:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:13:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-27 12:13:44,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-27 12:13:46,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:13:46,312 INFO L225 Difference]: With dead ends: 311 [2022-04-27 12:13:46,313 INFO L226 Difference]: Without dead ends: 309 [2022-04-27 12:13:46,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2022-04-27 12:13:46,313 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:13:46,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 116 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 168 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-04-27 12:13:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-27 12:13:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-04-27 12:13:46,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:13:46,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-27 12:13:46,515 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-27 12:13:46,515 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-27 12:13:46,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:46,520 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-27 12:13:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-27 12:13:46,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:46,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:46,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) Second operand 309 states. [2022-04-27 12:13:46,522 INFO L87 Difference]: Start difference. First operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) Second operand 309 states. [2022-04-27 12:13:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:13:46,526 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-27 12:13:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-27 12:13:46,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:13:46,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:13:46,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:13:46,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:13:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 192 states have (on average 1.0416666666666667) internal successors, (200), 199 states have internal predecessors, (200), 62 states have call successors, (62), 54 states have call predecessors, (62), 53 states have return successors, (60), 54 states have call predecessors, (60), 60 states have call successors, (60) [2022-04-27 12:13:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-04-27 12:13:46,532 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-04-27 12:13:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:13:46,533 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-04-27 12:13:46,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-27 12:13:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-04-27 12:13:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-27 12:13:46,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:13:46,534 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:13:46,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 12:13:46,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 12:13:46,739 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:13:46,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:13:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2056924759, now seen corresponding path program 4 times [2022-04-27 12:13:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:13:46,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138870957] [2022-04-27 12:13:46,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:13:46,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:13:46,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:13:46,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986880921] [2022-04-27 12:13:46,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:13:46,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:13:46,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:13:46,754 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:13:46,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 12:13:48,617 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:13:48,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:13:48,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-27 12:13:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:13:48,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:14:33,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {17361#true} call ULTIMATE.init(); {17361#true} is VALID [2022-04-27 12:14:33,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {17361#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17361#true} is VALID [2022-04-27 12:14:33,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:33,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17361#true} {17361#true} #81#return; {17361#true} is VALID [2022-04-27 12:14:33,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {17361#true} call #t~ret6 := main(); {17361#true} is VALID [2022-04-27 12:14:33,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {17361#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17361#true} is VALID [2022-04-27 12:14:33,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-27 12:14:33,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {17361#true} assume !!(#t~post5 < 50);havoc #t~post5; {17361#true} is VALID [2022-04-27 12:14:33,678 INFO L272 TraceCheckUtils]: 8: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:33,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:33,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:33,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:33,679 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-27 12:14:33,679 INFO L272 TraceCheckUtils]: 13: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:33,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:33,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:33,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:33,680 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17361#true} #61#return; {17419#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-27 12:14:33,680 INFO L272 TraceCheckUtils]: 18: Hoare triple {17419#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:33,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:33,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:33,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:33,681 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17419#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {17435#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:14:33,681 INFO L272 TraceCheckUtils]: 23: Hoare triple {17435#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:33,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:33,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:33,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:33,683 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17435#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #65#return; {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:14:33,683 INFO L272 TraceCheckUtils]: 28: Hoare triple {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:33,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:33,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:33,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:33,684 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17361#true} {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #67#return; {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:14:35,685 WARN L290 TraceCheckUtils]: 33: Hoare triple {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is UNKNOWN [2022-04-27 12:14:35,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:14:35,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} assume !!(#t~post5 < 50);havoc #t~post5; {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:14:35,687 INFO L272 TraceCheckUtils]: 36: Hoare triple {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:35,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:35,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:35,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:35,687 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17361#true} {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #59#return; {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:14:35,687 INFO L272 TraceCheckUtils]: 41: Hoare triple {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:35,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:35,688 INFO L290 TraceCheckUtils]: 43: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:35,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:35,689 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #61#return; {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} is VALID [2022-04-27 12:14:35,689 INFO L272 TraceCheckUtils]: 46: Hoare triple {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:35,689 INFO L290 TraceCheckUtils]: 47: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:35,689 INFO L290 TraceCheckUtils]: 48: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:35,689 INFO L290 TraceCheckUtils]: 49: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:35,691 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17451#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0))} #63#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:35,691 INFO L272 TraceCheckUtils]: 51: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:35,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:35,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:35,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:35,691 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #65#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:35,691 INFO L272 TraceCheckUtils]: 56: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:35,691 INFO L290 TraceCheckUtils]: 57: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:35,691 INFO L290 TraceCheckUtils]: 58: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:35,691 INFO L290 TraceCheckUtils]: 59: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:35,692 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #67#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:37,601 INFO L290 TraceCheckUtils]: 61: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:37,602 INFO L290 TraceCheckUtils]: 62: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:37,602 INFO L290 TraceCheckUtils]: 63: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(#t~post5 < 50);havoc #t~post5; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:37,602 INFO L272 TraceCheckUtils]: 64: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:37,602 INFO L290 TraceCheckUtils]: 65: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:37,602 INFO L290 TraceCheckUtils]: 66: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:37,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:37,603 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #59#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:37,603 INFO L272 TraceCheckUtils]: 69: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:37,603 INFO L290 TraceCheckUtils]: 70: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:37,603 INFO L290 TraceCheckUtils]: 71: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:37,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:37,604 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #61#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:37,604 INFO L272 TraceCheckUtils]: 74: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:37,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:37,604 INFO L290 TraceCheckUtils]: 76: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:37,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:37,605 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #63#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:37,605 INFO L272 TraceCheckUtils]: 79: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:37,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:37,605 INFO L290 TraceCheckUtils]: 81: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:37,605 INFO L290 TraceCheckUtils]: 82: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:37,605 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #65#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:37,605 INFO L272 TraceCheckUtils]: 84: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:37,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:37,606 INFO L290 TraceCheckUtils]: 86: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:37,606 INFO L290 TraceCheckUtils]: 87: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:37,606 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #67#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:39,608 WARN L290 TraceCheckUtils]: 89: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is UNKNOWN [2022-04-27 12:14:39,609 INFO L290 TraceCheckUtils]: 90: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:39,609 INFO L290 TraceCheckUtils]: 91: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(#t~post5 < 50);havoc #t~post5; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:39,609 INFO L272 TraceCheckUtils]: 92: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,609 INFO L290 TraceCheckUtils]: 93: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:39,610 INFO L290 TraceCheckUtils]: 94: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:39,610 INFO L290 TraceCheckUtils]: 95: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:39,610 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #59#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:39,610 INFO L272 TraceCheckUtils]: 97: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,610 INFO L290 TraceCheckUtils]: 98: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:39,611 INFO L290 TraceCheckUtils]: 99: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:39,611 INFO L290 TraceCheckUtils]: 100: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:39,611 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #61#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:39,611 INFO L272 TraceCheckUtils]: 102: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,611 INFO L290 TraceCheckUtils]: 103: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:39,611 INFO L290 TraceCheckUtils]: 104: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:39,611 INFO L290 TraceCheckUtils]: 105: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:39,612 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #63#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:39,612 INFO L272 TraceCheckUtils]: 107: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,612 INFO L290 TraceCheckUtils]: 108: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:39,612 INFO L290 TraceCheckUtils]: 109: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:39,612 INFO L290 TraceCheckUtils]: 110: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:39,613 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #65#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:39,613 INFO L272 TraceCheckUtils]: 112: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,613 INFO L290 TraceCheckUtils]: 113: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:39,613 INFO L290 TraceCheckUtils]: 114: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:39,613 INFO L290 TraceCheckUtils]: 115: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:39,613 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17361#true} {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #67#return; {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-27 12:14:39,626 INFO L290 TraceCheckUtils]: 117: Hoare triple {17521#(and (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0) (= (+ (* main_~y~0 12) (* (* main_~n~0 main_~n~0 main_~n~0) 18) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-27 12:14:39,627 INFO L290 TraceCheckUtils]: 118: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-27 12:14:39,627 INFO L290 TraceCheckUtils]: 119: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} assume !!(#t~post5 < 50);havoc #t~post5; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-27 12:14:39,628 INFO L272 TraceCheckUtils]: 120: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,628 INFO L290 TraceCheckUtils]: 121: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:39,628 INFO L290 TraceCheckUtils]: 122: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:39,628 INFO L290 TraceCheckUtils]: 123: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:39,628 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17361#true} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #59#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-27 12:14:39,628 INFO L272 TraceCheckUtils]: 125: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,628 INFO L290 TraceCheckUtils]: 126: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:39,629 INFO L290 TraceCheckUtils]: 127: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:39,629 INFO L290 TraceCheckUtils]: 128: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:39,630 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #61#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-27 12:14:39,630 INFO L272 TraceCheckUtils]: 130: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,630 INFO L290 TraceCheckUtils]: 131: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:39,630 INFO L290 TraceCheckUtils]: 132: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:39,630 INFO L290 TraceCheckUtils]: 133: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:39,630 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17361#true} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #63#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-27 12:14:39,630 INFO L272 TraceCheckUtils]: 135: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,630 INFO L290 TraceCheckUtils]: 136: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:39,630 INFO L290 TraceCheckUtils]: 137: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:39,630 INFO L290 TraceCheckUtils]: 138: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:39,631 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17361#true} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #65#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-27 12:14:39,631 INFO L272 TraceCheckUtils]: 140: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,631 INFO L290 TraceCheckUtils]: 141: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:39,631 INFO L290 TraceCheckUtils]: 142: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:39,631 INFO L290 TraceCheckUtils]: 143: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:39,632 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17361#true} {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #67#return; {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-27 12:14:39,632 INFO L290 TraceCheckUtils]: 145: Hoare triple {17723#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} assume !(~n~0 <= ~a~0); {17808#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} is VALID [2022-04-27 12:14:39,632 INFO L272 TraceCheckUtils]: 146: Hoare triple {17808#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,632 INFO L290 TraceCheckUtils]: 147: Hoare triple {17361#true} ~cond := #in~cond; {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:39,633 INFO L290 TraceCheckUtils]: 148: Hoare triple {17408#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:39,633 INFO L290 TraceCheckUtils]: 149: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:39,958 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17808#(and (<= main_~n~0 (+ main_~a~0 1)) (not (<= main_~n~0 main_~a~0)) (= (+ (* (+ main_~z~0 (- 6)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3))) (- 12) (* main_~z~0 2)) (+ (* 18 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* 36 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 36) (- 18))) (= main_~y~0 (+ (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) main_~z~0 (* main_~n~0 3) (- 8))))} #69#return; {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:14:39,958 INFO L272 TraceCheckUtils]: 151: Hoare triple {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:39,958 INFO L290 TraceCheckUtils]: 152: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:39,958 INFO L290 TraceCheckUtils]: 153: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:39,958 INFO L290 TraceCheckUtils]: 154: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:39,959 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17361#true} {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} #71#return; {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-27 12:14:41,119 INFO L272 TraceCheckUtils]: 156: Hoare triple {17824#(and (= (+ 5 (* (div (+ main_~z~0 (- 6)) 6) 3) main_~y~0) (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {17843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:41,120 INFO L290 TraceCheckUtils]: 157: Hoare triple {17843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:41,120 INFO L290 TraceCheckUtils]: 158: Hoare triple {17847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17362#false} is VALID [2022-04-27 12:14:41,120 INFO L290 TraceCheckUtils]: 159: Hoare triple {17362#false} assume !false; {17362#false} is VALID [2022-04-27 12:14:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 252 proven. 354 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2022-04-27 12:14:41,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:14:52,098 INFO L290 TraceCheckUtils]: 159: Hoare triple {17362#false} assume !false; {17362#false} is VALID [2022-04-27 12:14:52,098 INFO L290 TraceCheckUtils]: 158: Hoare triple {17847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17362#false} is VALID [2022-04-27 12:14:52,098 INFO L290 TraceCheckUtils]: 157: Hoare triple {17843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:14:52,099 INFO L272 TraceCheckUtils]: 156: Hoare triple {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {17843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:14:52,099 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17361#true} {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #71#return; {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-27 12:14:52,100 INFO L290 TraceCheckUtils]: 154: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,100 INFO L290 TraceCheckUtils]: 153: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,100 INFO L290 TraceCheckUtils]: 152: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,100 INFO L272 TraceCheckUtils]: 151: Hoare triple {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,100 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17882#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} #69#return; {17863#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-27 12:14:52,101 INFO L290 TraceCheckUtils]: 149: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:52,101 INFO L290 TraceCheckUtils]: 148: Hoare triple {17892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:52,101 INFO L290 TraceCheckUtils]: 147: Hoare triple {17361#true} ~cond := #in~cond; {17892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:14:52,101 INFO L272 TraceCheckUtils]: 146: Hoare triple {17882#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,102 INFO L290 TraceCheckUtils]: 145: Hoare triple {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !(~n~0 <= ~a~0); {17882#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))))} is VALID [2022-04-27 12:14:52,102 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17361#true} {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #67#return; {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:14:52,102 INFO L290 TraceCheckUtils]: 143: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,102 INFO L290 TraceCheckUtils]: 142: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,102 INFO L290 TraceCheckUtils]: 141: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,102 INFO L272 TraceCheckUtils]: 140: Hoare triple {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,103 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17361#true} {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #65#return; {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:14:52,103 INFO L290 TraceCheckUtils]: 138: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,103 INFO L290 TraceCheckUtils]: 137: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,103 INFO L290 TraceCheckUtils]: 136: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,103 INFO L272 TraceCheckUtils]: 135: Hoare triple {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,103 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17361#true} {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #63#return; {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:14:52,103 INFO L290 TraceCheckUtils]: 133: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,104 INFO L290 TraceCheckUtils]: 132: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,104 INFO L290 TraceCheckUtils]: 131: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,104 INFO L272 TraceCheckUtils]: 130: Hoare triple {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,104 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #61#return; {17899#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:14:52,105 INFO L290 TraceCheckUtils]: 128: Hoare triple {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:52,105 INFO L290 TraceCheckUtils]: 127: Hoare triple {17892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:14:52,105 INFO L290 TraceCheckUtils]: 126: Hoare triple {17361#true} ~cond := #in~cond; {17892#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:14:52,105 INFO L272 TraceCheckUtils]: 125: Hoare triple {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,106 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17361#true} {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #59#return; {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:14:52,106 INFO L290 TraceCheckUtils]: 123: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,106 INFO L290 TraceCheckUtils]: 122: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,106 INFO L290 TraceCheckUtils]: 121: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,106 INFO L272 TraceCheckUtils]: 120: Hoare triple {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,106 INFO L290 TraceCheckUtils]: 119: Hoare triple {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} assume !!(#t~post5 < 50);havoc #t~post5; {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:14:52,107 INFO L290 TraceCheckUtils]: 118: Hoare triple {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:14:52,112 INFO L290 TraceCheckUtils]: 117: Hoare triple {17361#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17948#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)) (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2))) (<= main_~n~0 main_~a~0))} is VALID [2022-04-27 12:14:52,112 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17361#true} {17361#true} #67#return; {17361#true} is VALID [2022-04-27 12:14:52,112 INFO L290 TraceCheckUtils]: 115: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,112 INFO L290 TraceCheckUtils]: 114: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,112 INFO L290 TraceCheckUtils]: 113: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,112 INFO L272 TraceCheckUtils]: 112: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,112 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17361#true} {17361#true} #65#return; {17361#true} is VALID [2022-04-27 12:14:52,112 INFO L290 TraceCheckUtils]: 110: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,112 INFO L290 TraceCheckUtils]: 109: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 108: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L272 TraceCheckUtils]: 107: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17361#true} {17361#true} #63#return; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 105: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 104: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 103: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L272 TraceCheckUtils]: 102: Hoare triple {17361#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17361#true} {17361#true} #61#return; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 100: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 99: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 98: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L272 TraceCheckUtils]: 97: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 95: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 94: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 93: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L272 TraceCheckUtils]: 92: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 91: Hoare triple {17361#true} assume !!(#t~post5 < 50);havoc #t~post5; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 90: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 89: Hoare triple {17361#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17361#true} {17361#true} #67#return; {17361#true} is VALID [2022-04-27 12:14:52,113 INFO L290 TraceCheckUtils]: 87: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 86: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 85: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L272 TraceCheckUtils]: 84: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17361#true} {17361#true} #65#return; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 82: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 81: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 80: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L272 TraceCheckUtils]: 79: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17361#true} {17361#true} #63#return; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 77: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L272 TraceCheckUtils]: 74: Hoare triple {17361#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17361#true} {17361#true} #61#return; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 72: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L272 TraceCheckUtils]: 69: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 67: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 66: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,114 INFO L290 TraceCheckUtils]: 65: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L272 TraceCheckUtils]: 64: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {17361#true} assume !!(#t~post5 < 50);havoc #t~post5; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {17361#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17361#true} {17361#true} #67#return; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 57: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L272 TraceCheckUtils]: 56: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17361#true} {17361#true} #65#return; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L272 TraceCheckUtils]: 51: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17361#true} {17361#true} #63#return; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,129 INFO L272 TraceCheckUtils]: 46: Hoare triple {17361#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17361#true} {17361#true} #61#return; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L272 TraceCheckUtils]: 41: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L272 TraceCheckUtils]: 36: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {17361#true} assume !!(#t~post5 < 50);havoc #t~post5; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {17361#true} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17361#true} {17361#true} #67#return; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L272 TraceCheckUtils]: 28: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17361#true} {17361#true} #65#return; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L272 TraceCheckUtils]: 23: Hoare triple {17361#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17361#true} {17361#true} #63#return; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L272 TraceCheckUtils]: 18: Hoare triple {17361#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17361#true} {17361#true} #61#return; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L272 TraceCheckUtils]: 13: Hoare triple {17361#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17361#true} {17361#true} #59#return; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {17361#true} assume !(0 == ~cond); {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {17361#true} ~cond := #in~cond; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L272 TraceCheckUtils]: 8: Hoare triple {17361#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {17361#true} assume !!(#t~post5 < 50);havoc #t~post5; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {17361#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {17361#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {17361#true} call #t~ret6 := main(); {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17361#true} {17361#true} #81#return; {17361#true} is VALID [2022-04-27 12:14:52,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {17361#true} assume true; {17361#true} is VALID [2022-04-27 12:14:52,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {17361#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17361#true} is VALID [2022-04-27 12:14:52,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {17361#true} call ULTIMATE.init(); {17361#true} is VALID [2022-04-27 12:14:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 219 proven. 17 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2022-04-27 12:14:52,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:14:52,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138870957] [2022-04-27 12:14:52,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:14:52,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986880921] [2022-04-27 12:14:52,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986880921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:14:52,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:14:52,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-27 12:14:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019614408] [2022-04-27 12:14:52,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:14:52,136 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-04-27 12:14:52,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:14:52,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-27 12:14:57,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 95 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 12:14:57,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 12:14:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:14:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 12:14:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=241, Unknown=1, NotChecked=0, Total=306 [2022-04-27 12:14:57,179 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-27 12:15:01,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:15:03,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:15:08,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:15:10,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:15:18,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:15:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:20,028 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2022-04-27 12:15:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:15:20,028 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-04-27 12:15:20,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-27 12:15:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 12:15:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-27 12:15:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-27 12:15:20,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-27 12:15:20,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:20,158 INFO L225 Difference]: With dead ends: 315 [2022-04-27 12:15:20,158 INFO L226 Difference]: Without dead ends: 294 [2022-04-27 12:15:20,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=125, Invalid=425, Unknown=2, NotChecked=0, Total=552 [2022-04-27 12:15:20,159 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 77 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:20,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 126 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 253 Invalid, 3 Unknown, 0 Unchecked, 12.0s Time] [2022-04-27 12:15:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-27 12:15:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-04-27 12:15:20,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:20,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 294 states. Second operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 12:15:20,353 INFO L74 IsIncluded]: Start isIncluded. First operand 294 states. Second operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 12:15:20,353 INFO L87 Difference]: Start difference. First operand 294 states. Second operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 12:15:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:20,357 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-27 12:15:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-27 12:15:20,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:20,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:20,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 294 states. [2022-04-27 12:15:20,358 INFO L87 Difference]: Start difference. First operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 294 states. [2022-04-27 12:15:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:20,362 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-27 12:15:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-27 12:15:20,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:20,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:20,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:20,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 188 states have (on average 1.0053191489361701) internal successors, (189), 188 states have internal predecessors, (189), 54 states have call successors, (54), 53 states have call predecessors, (54), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-27 12:15:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-04-27 12:15:20,367 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-04-27 12:15:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:20,367 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-04-27 12:15:20,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-27 12:15:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-27 12:15:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-27 12:15:20,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:20,370 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:20,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 12:15:20,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:20,577 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:20,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:20,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 3 times [2022-04-27 12:15:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:20,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498482448] [2022-04-27 12:15:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:20,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:20,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008900267] [2022-04-27 12:15:20,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 12:15:20,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:20,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:20,592 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:15:20,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 12:15:20,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-04-27 12:15:20,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:15:20,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 12:15:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:20,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:22,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {19795#true} call ULTIMATE.init(); {19795#true} is VALID [2022-04-27 12:15:22,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {19795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19803#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:22,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {19803#(<= ~counter~0 0)} assume true; {19803#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:22,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19803#(<= ~counter~0 0)} {19795#true} #81#return; {19803#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:22,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {19803#(<= ~counter~0 0)} call #t~ret6 := main(); {19803#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:22,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {19803#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {19803#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:22,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {19803#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {19819#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,199 INFO L272 TraceCheckUtils]: 8: Hoare triple {19819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,200 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #59#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,200 INFO L272 TraceCheckUtils]: 13: Hoare triple {19819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,202 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #61#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,202 INFO L272 TraceCheckUtils]: 18: Hoare triple {19819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,203 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #63#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,204 INFO L272 TraceCheckUtils]: 23: Hoare triple {19819#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,205 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #65#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,205 INFO L272 TraceCheckUtils]: 28: Hoare triple {19819#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {19819#(<= ~counter~0 1)} ~cond := #in~cond; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {19819#(<= ~counter~0 1)} assume !(0 == ~cond); {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {19819#(<= ~counter~0 1)} assume true; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,206 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19819#(<= ~counter~0 1)} {19819#(<= ~counter~0 1)} #67#return; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {19819#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19819#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:22,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {19819#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {19904#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,208 INFO L272 TraceCheckUtils]: 36: Hoare triple {19904#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,209 INFO L290 TraceCheckUtils]: 39: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,209 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #59#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,209 INFO L272 TraceCheckUtils]: 41: Hoare triple {19904#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,211 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #61#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,211 INFO L272 TraceCheckUtils]: 46: Hoare triple {19904#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,212 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #63#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,213 INFO L272 TraceCheckUtils]: 51: Hoare triple {19904#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,214 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #65#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,214 INFO L272 TraceCheckUtils]: 56: Hoare triple {19904#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {19904#(<= ~counter~0 2)} ~cond := #in~cond; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,215 INFO L290 TraceCheckUtils]: 58: Hoare triple {19904#(<= ~counter~0 2)} assume !(0 == ~cond); {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,215 INFO L290 TraceCheckUtils]: 59: Hoare triple {19904#(<= ~counter~0 2)} assume true; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,215 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19904#(<= ~counter~0 2)} {19904#(<= ~counter~0 2)} #67#return; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {19904#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19904#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:22,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {19904#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,216 INFO L290 TraceCheckUtils]: 63: Hoare triple {19989#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,217 INFO L272 TraceCheckUtils]: 64: Hoare triple {19989#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,217 INFO L290 TraceCheckUtils]: 65: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,217 INFO L290 TraceCheckUtils]: 66: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,218 INFO L290 TraceCheckUtils]: 67: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,218 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #59#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,218 INFO L272 TraceCheckUtils]: 69: Hoare triple {19989#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,219 INFO L290 TraceCheckUtils]: 70: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,220 INFO L290 TraceCheckUtils]: 71: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,220 INFO L290 TraceCheckUtils]: 72: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,220 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #61#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,221 INFO L272 TraceCheckUtils]: 74: Hoare triple {19989#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,221 INFO L290 TraceCheckUtils]: 75: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,221 INFO L290 TraceCheckUtils]: 76: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,221 INFO L290 TraceCheckUtils]: 77: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,222 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #63#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,222 INFO L272 TraceCheckUtils]: 79: Hoare triple {19989#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,223 INFO L290 TraceCheckUtils]: 80: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,223 INFO L290 TraceCheckUtils]: 81: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,223 INFO L290 TraceCheckUtils]: 82: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,223 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #65#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,224 INFO L272 TraceCheckUtils]: 84: Hoare triple {19989#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,224 INFO L290 TraceCheckUtils]: 85: Hoare triple {19989#(<= ~counter~0 3)} ~cond := #in~cond; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,224 INFO L290 TraceCheckUtils]: 86: Hoare triple {19989#(<= ~counter~0 3)} assume !(0 == ~cond); {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,225 INFO L290 TraceCheckUtils]: 87: Hoare triple {19989#(<= ~counter~0 3)} assume true; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,225 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {19989#(<= ~counter~0 3)} {19989#(<= ~counter~0 3)} #67#return; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,225 INFO L290 TraceCheckUtils]: 89: Hoare triple {19989#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {19989#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:22,226 INFO L290 TraceCheckUtils]: 90: Hoare triple {19989#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,226 INFO L290 TraceCheckUtils]: 91: Hoare triple {20074#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,227 INFO L272 TraceCheckUtils]: 92: Hoare triple {20074#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,227 INFO L290 TraceCheckUtils]: 93: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,227 INFO L290 TraceCheckUtils]: 94: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,227 INFO L290 TraceCheckUtils]: 95: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,228 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #59#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,228 INFO L272 TraceCheckUtils]: 97: Hoare triple {20074#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,229 INFO L290 TraceCheckUtils]: 98: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,229 INFO L290 TraceCheckUtils]: 99: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,230 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #61#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,230 INFO L272 TraceCheckUtils]: 102: Hoare triple {20074#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,230 INFO L290 TraceCheckUtils]: 103: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,230 INFO L290 TraceCheckUtils]: 104: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,231 INFO L290 TraceCheckUtils]: 105: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,231 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #63#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,232 INFO L272 TraceCheckUtils]: 107: Hoare triple {20074#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,232 INFO L290 TraceCheckUtils]: 108: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,232 INFO L290 TraceCheckUtils]: 109: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,232 INFO L290 TraceCheckUtils]: 110: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,233 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #65#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,233 INFO L272 TraceCheckUtils]: 112: Hoare triple {20074#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,233 INFO L290 TraceCheckUtils]: 113: Hoare triple {20074#(<= ~counter~0 4)} ~cond := #in~cond; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,234 INFO L290 TraceCheckUtils]: 114: Hoare triple {20074#(<= ~counter~0 4)} assume !(0 == ~cond); {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,234 INFO L290 TraceCheckUtils]: 115: Hoare triple {20074#(<= ~counter~0 4)} assume true; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,234 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20074#(<= ~counter~0 4)} {20074#(<= ~counter~0 4)} #67#return; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,234 INFO L290 TraceCheckUtils]: 117: Hoare triple {20074#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20074#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:22,235 INFO L290 TraceCheckUtils]: 118: Hoare triple {20074#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,235 INFO L290 TraceCheckUtils]: 119: Hoare triple {20159#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,236 INFO L272 TraceCheckUtils]: 120: Hoare triple {20159#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,236 INFO L290 TraceCheckUtils]: 121: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,236 INFO L290 TraceCheckUtils]: 122: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,237 INFO L290 TraceCheckUtils]: 123: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,237 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #59#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,237 INFO L272 TraceCheckUtils]: 125: Hoare triple {20159#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,238 INFO L290 TraceCheckUtils]: 126: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,238 INFO L290 TraceCheckUtils]: 127: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,238 INFO L290 TraceCheckUtils]: 128: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,239 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #61#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,239 INFO L272 TraceCheckUtils]: 130: Hoare triple {20159#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,239 INFO L290 TraceCheckUtils]: 131: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,239 INFO L290 TraceCheckUtils]: 132: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,240 INFO L290 TraceCheckUtils]: 133: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,240 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #63#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,241 INFO L272 TraceCheckUtils]: 135: Hoare triple {20159#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,241 INFO L290 TraceCheckUtils]: 136: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,241 INFO L290 TraceCheckUtils]: 137: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,241 INFO L290 TraceCheckUtils]: 138: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,242 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #65#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,242 INFO L272 TraceCheckUtils]: 140: Hoare triple {20159#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,242 INFO L290 TraceCheckUtils]: 141: Hoare triple {20159#(<= ~counter~0 5)} ~cond := #in~cond; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,243 INFO L290 TraceCheckUtils]: 142: Hoare triple {20159#(<= ~counter~0 5)} assume !(0 == ~cond); {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,243 INFO L290 TraceCheckUtils]: 143: Hoare triple {20159#(<= ~counter~0 5)} assume true; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,243 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20159#(<= ~counter~0 5)} {20159#(<= ~counter~0 5)} #67#return; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,244 INFO L290 TraceCheckUtils]: 145: Hoare triple {20159#(<= ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20159#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:22,244 INFO L290 TraceCheckUtils]: 146: Hoare triple {20159#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,245 INFO L290 TraceCheckUtils]: 147: Hoare triple {20244#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,245 INFO L272 TraceCheckUtils]: 148: Hoare triple {20244#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,245 INFO L290 TraceCheckUtils]: 149: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,245 INFO L290 TraceCheckUtils]: 150: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,246 INFO L290 TraceCheckUtils]: 151: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,246 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #59#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,247 INFO L272 TraceCheckUtils]: 153: Hoare triple {20244#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,247 INFO L290 TraceCheckUtils]: 154: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,247 INFO L290 TraceCheckUtils]: 155: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,247 INFO L290 TraceCheckUtils]: 156: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,248 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #61#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,248 INFO L272 TraceCheckUtils]: 158: Hoare triple {20244#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,248 INFO L290 TraceCheckUtils]: 159: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,249 INFO L290 TraceCheckUtils]: 160: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,249 INFO L290 TraceCheckUtils]: 161: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,249 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #63#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,250 INFO L272 TraceCheckUtils]: 163: Hoare triple {20244#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,250 INFO L290 TraceCheckUtils]: 164: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,250 INFO L290 TraceCheckUtils]: 165: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,250 INFO L290 TraceCheckUtils]: 166: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,251 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #65#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,251 INFO L272 TraceCheckUtils]: 168: Hoare triple {20244#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,252 INFO L290 TraceCheckUtils]: 169: Hoare triple {20244#(<= ~counter~0 6)} ~cond := #in~cond; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,252 INFO L290 TraceCheckUtils]: 170: Hoare triple {20244#(<= ~counter~0 6)} assume !(0 == ~cond); {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,252 INFO L290 TraceCheckUtils]: 171: Hoare triple {20244#(<= ~counter~0 6)} assume true; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,252 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20244#(<= ~counter~0 6)} {20244#(<= ~counter~0 6)} #67#return; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,253 INFO L290 TraceCheckUtils]: 173: Hoare triple {20244#(<= ~counter~0 6)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20244#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:22,253 INFO L290 TraceCheckUtils]: 174: Hoare triple {20244#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,254 INFO L290 TraceCheckUtils]: 175: Hoare triple {20329#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,273 INFO L272 TraceCheckUtils]: 176: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,273 INFO L290 TraceCheckUtils]: 177: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,273 INFO L290 TraceCheckUtils]: 178: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,273 INFO L290 TraceCheckUtils]: 179: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,274 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #59#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,274 INFO L272 TraceCheckUtils]: 181: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,275 INFO L290 TraceCheckUtils]: 182: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,275 INFO L290 TraceCheckUtils]: 183: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,275 INFO L290 TraceCheckUtils]: 184: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,275 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #61#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,276 INFO L272 TraceCheckUtils]: 186: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,276 INFO L290 TraceCheckUtils]: 187: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,276 INFO L290 TraceCheckUtils]: 188: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,277 INFO L290 TraceCheckUtils]: 189: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,277 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #63#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,277 INFO L272 TraceCheckUtils]: 191: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,278 INFO L290 TraceCheckUtils]: 192: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,278 INFO L290 TraceCheckUtils]: 193: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,278 INFO L290 TraceCheckUtils]: 194: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,279 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #65#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,279 INFO L272 TraceCheckUtils]: 196: Hoare triple {20329#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,279 INFO L290 TraceCheckUtils]: 197: Hoare triple {20329#(<= ~counter~0 7)} ~cond := #in~cond; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,279 INFO L290 TraceCheckUtils]: 198: Hoare triple {20329#(<= ~counter~0 7)} assume !(0 == ~cond); {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,280 INFO L290 TraceCheckUtils]: 199: Hoare triple {20329#(<= ~counter~0 7)} assume true; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,280 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20329#(<= ~counter~0 7)} {20329#(<= ~counter~0 7)} #67#return; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,280 INFO L290 TraceCheckUtils]: 201: Hoare triple {20329#(<= ~counter~0 7)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20329#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:22,281 INFO L290 TraceCheckUtils]: 202: Hoare triple {20329#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,281 INFO L290 TraceCheckUtils]: 203: Hoare triple {20414#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,282 INFO L272 TraceCheckUtils]: 204: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,282 INFO L290 TraceCheckUtils]: 205: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,282 INFO L290 TraceCheckUtils]: 206: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,283 INFO L290 TraceCheckUtils]: 207: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,283 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #59#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,283 INFO L272 TraceCheckUtils]: 209: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,284 INFO L290 TraceCheckUtils]: 210: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,284 INFO L290 TraceCheckUtils]: 211: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,284 INFO L290 TraceCheckUtils]: 212: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,285 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #61#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,285 INFO L272 TraceCheckUtils]: 214: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,285 INFO L290 TraceCheckUtils]: 215: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,286 INFO L290 TraceCheckUtils]: 216: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,286 INFO L290 TraceCheckUtils]: 217: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,287 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #63#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,287 INFO L272 TraceCheckUtils]: 219: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,287 INFO L290 TraceCheckUtils]: 220: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,288 INFO L290 TraceCheckUtils]: 221: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,288 INFO L290 TraceCheckUtils]: 222: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,288 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #65#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,289 INFO L272 TraceCheckUtils]: 224: Hoare triple {20414#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,289 INFO L290 TraceCheckUtils]: 225: Hoare triple {20414#(<= ~counter~0 8)} ~cond := #in~cond; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,289 INFO L290 TraceCheckUtils]: 226: Hoare triple {20414#(<= ~counter~0 8)} assume !(0 == ~cond); {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,290 INFO L290 TraceCheckUtils]: 227: Hoare triple {20414#(<= ~counter~0 8)} assume true; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,290 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {20414#(<= ~counter~0 8)} {20414#(<= ~counter~0 8)} #67#return; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,290 INFO L290 TraceCheckUtils]: 229: Hoare triple {20414#(<= ~counter~0 8)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20414#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:22,291 INFO L290 TraceCheckUtils]: 230: Hoare triple {20414#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,292 INFO L290 TraceCheckUtils]: 231: Hoare triple {20499#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,292 INFO L272 TraceCheckUtils]: 232: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,292 INFO L290 TraceCheckUtils]: 233: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,293 INFO L290 TraceCheckUtils]: 234: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,293 INFO L290 TraceCheckUtils]: 235: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,293 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #59#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,294 INFO L272 TraceCheckUtils]: 237: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,294 INFO L290 TraceCheckUtils]: 238: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,295 INFO L290 TraceCheckUtils]: 239: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,295 INFO L290 TraceCheckUtils]: 240: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,295 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #61#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,296 INFO L272 TraceCheckUtils]: 242: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,296 INFO L290 TraceCheckUtils]: 243: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,296 INFO L290 TraceCheckUtils]: 244: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,297 INFO L290 TraceCheckUtils]: 245: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,297 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #63#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,298 INFO L272 TraceCheckUtils]: 247: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,298 INFO L290 TraceCheckUtils]: 248: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,298 INFO L290 TraceCheckUtils]: 249: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,299 INFO L290 TraceCheckUtils]: 250: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,299 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #65#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,300 INFO L272 TraceCheckUtils]: 252: Hoare triple {20499#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,300 INFO L290 TraceCheckUtils]: 253: Hoare triple {20499#(<= ~counter~0 9)} ~cond := #in~cond; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,300 INFO L290 TraceCheckUtils]: 254: Hoare triple {20499#(<= ~counter~0 9)} assume !(0 == ~cond); {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,301 INFO L290 TraceCheckUtils]: 255: Hoare triple {20499#(<= ~counter~0 9)} assume true; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,301 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {20499#(<= ~counter~0 9)} {20499#(<= ~counter~0 9)} #67#return; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,301 INFO L290 TraceCheckUtils]: 257: Hoare triple {20499#(<= ~counter~0 9)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20499#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:22,302 INFO L290 TraceCheckUtils]: 258: Hoare triple {20499#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,303 INFO L290 TraceCheckUtils]: 259: Hoare triple {20584#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,303 INFO L272 TraceCheckUtils]: 260: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,303 INFO L290 TraceCheckUtils]: 261: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,304 INFO L290 TraceCheckUtils]: 262: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,304 INFO L290 TraceCheckUtils]: 263: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,304 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #59#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,305 INFO L272 TraceCheckUtils]: 265: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,305 INFO L290 TraceCheckUtils]: 266: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,306 INFO L290 TraceCheckUtils]: 267: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,306 INFO L290 TraceCheckUtils]: 268: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,306 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #61#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,307 INFO L272 TraceCheckUtils]: 270: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,307 INFO L290 TraceCheckUtils]: 271: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,307 INFO L290 TraceCheckUtils]: 272: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,308 INFO L290 TraceCheckUtils]: 273: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,308 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #63#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,308 INFO L272 TraceCheckUtils]: 275: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,309 INFO L290 TraceCheckUtils]: 276: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,309 INFO L290 TraceCheckUtils]: 277: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,309 INFO L290 TraceCheckUtils]: 278: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,310 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #65#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,310 INFO L272 TraceCheckUtils]: 280: Hoare triple {20584#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,310 INFO L290 TraceCheckUtils]: 281: Hoare triple {20584#(<= ~counter~0 10)} ~cond := #in~cond; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,311 INFO L290 TraceCheckUtils]: 282: Hoare triple {20584#(<= ~counter~0 10)} assume !(0 == ~cond); {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,311 INFO L290 TraceCheckUtils]: 283: Hoare triple {20584#(<= ~counter~0 10)} assume true; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,311 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {20584#(<= ~counter~0 10)} {20584#(<= ~counter~0 10)} #67#return; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,312 INFO L290 TraceCheckUtils]: 285: Hoare triple {20584#(<= ~counter~0 10)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20584#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:22,312 INFO L290 TraceCheckUtils]: 286: Hoare triple {20584#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20669#(<= |main_#t~post5| 10)} is VALID [2022-04-27 12:15:22,312 INFO L290 TraceCheckUtils]: 287: Hoare triple {20669#(<= |main_#t~post5| 10)} assume !(#t~post5 < 50);havoc #t~post5; {19796#false} is VALID [2022-04-27 12:15:22,312 INFO L272 TraceCheckUtils]: 288: Hoare triple {19796#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19796#false} is VALID [2022-04-27 12:15:22,312 INFO L290 TraceCheckUtils]: 289: Hoare triple {19796#false} ~cond := #in~cond; {19796#false} is VALID [2022-04-27 12:15:22,312 INFO L290 TraceCheckUtils]: 290: Hoare triple {19796#false} assume !(0 == ~cond); {19796#false} is VALID [2022-04-27 12:15:22,313 INFO L290 TraceCheckUtils]: 291: Hoare triple {19796#false} assume true; {19796#false} is VALID [2022-04-27 12:15:22,313 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {19796#false} {19796#false} #69#return; {19796#false} is VALID [2022-04-27 12:15:22,313 INFO L272 TraceCheckUtils]: 293: Hoare triple {19796#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {19796#false} is VALID [2022-04-27 12:15:22,313 INFO L290 TraceCheckUtils]: 294: Hoare triple {19796#false} ~cond := #in~cond; {19796#false} is VALID [2022-04-27 12:15:22,313 INFO L290 TraceCheckUtils]: 295: Hoare triple {19796#false} assume 0 == ~cond; {19796#false} is VALID [2022-04-27 12:15:22,313 INFO L290 TraceCheckUtils]: 296: Hoare triple {19796#false} assume !false; {19796#false} is VALID [2022-04-27 12:15:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-04-27 12:15:22,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:15:23,447 INFO L290 TraceCheckUtils]: 296: Hoare triple {19796#false} assume !false; {19796#false} is VALID [2022-04-27 12:15:23,447 INFO L290 TraceCheckUtils]: 295: Hoare triple {19796#false} assume 0 == ~cond; {19796#false} is VALID [2022-04-27 12:15:23,447 INFO L290 TraceCheckUtils]: 294: Hoare triple {19796#false} ~cond := #in~cond; {19796#false} is VALID [2022-04-27 12:15:23,448 INFO L272 TraceCheckUtils]: 293: Hoare triple {19796#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {19796#false} is VALID [2022-04-27 12:15:23,448 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {19795#true} {19796#false} #69#return; {19796#false} is VALID [2022-04-27 12:15:23,448 INFO L290 TraceCheckUtils]: 291: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,448 INFO L290 TraceCheckUtils]: 290: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,448 INFO L290 TraceCheckUtils]: 289: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,448 INFO L272 TraceCheckUtils]: 288: Hoare triple {19796#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,448 INFO L290 TraceCheckUtils]: 287: Hoare triple {20727#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {19796#false} is VALID [2022-04-27 12:15:23,448 INFO L290 TraceCheckUtils]: 286: Hoare triple {20731#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20727#(< |main_#t~post5| 50)} is VALID [2022-04-27 12:15:23,449 INFO L290 TraceCheckUtils]: 285: Hoare triple {20731#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20731#(< ~counter~0 50)} is VALID [2022-04-27 12:15:23,449 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {19795#true} {20731#(< ~counter~0 50)} #67#return; {20731#(< ~counter~0 50)} is VALID [2022-04-27 12:15:23,449 INFO L290 TraceCheckUtils]: 283: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,449 INFO L290 TraceCheckUtils]: 282: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,449 INFO L290 TraceCheckUtils]: 281: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,449 INFO L272 TraceCheckUtils]: 280: Hoare triple {20731#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,450 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {19795#true} {20731#(< ~counter~0 50)} #65#return; {20731#(< ~counter~0 50)} is VALID [2022-04-27 12:15:23,450 INFO L290 TraceCheckUtils]: 278: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,450 INFO L290 TraceCheckUtils]: 277: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,450 INFO L290 TraceCheckUtils]: 276: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,450 INFO L272 TraceCheckUtils]: 275: Hoare triple {20731#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,450 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {19795#true} {20731#(< ~counter~0 50)} #63#return; {20731#(< ~counter~0 50)} is VALID [2022-04-27 12:15:23,450 INFO L290 TraceCheckUtils]: 273: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,450 INFO L290 TraceCheckUtils]: 272: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,450 INFO L290 TraceCheckUtils]: 271: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,450 INFO L272 TraceCheckUtils]: 270: Hoare triple {20731#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,451 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {19795#true} {20731#(< ~counter~0 50)} #61#return; {20731#(< ~counter~0 50)} is VALID [2022-04-27 12:15:23,451 INFO L290 TraceCheckUtils]: 268: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,451 INFO L290 TraceCheckUtils]: 267: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,451 INFO L290 TraceCheckUtils]: 266: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,451 INFO L272 TraceCheckUtils]: 265: Hoare triple {20731#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,451 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {19795#true} {20731#(< ~counter~0 50)} #59#return; {20731#(< ~counter~0 50)} is VALID [2022-04-27 12:15:23,452 INFO L290 TraceCheckUtils]: 263: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,452 INFO L290 TraceCheckUtils]: 262: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,452 INFO L290 TraceCheckUtils]: 261: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,452 INFO L272 TraceCheckUtils]: 260: Hoare triple {20731#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,452 INFO L290 TraceCheckUtils]: 259: Hoare triple {20731#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {20731#(< ~counter~0 50)} is VALID [2022-04-27 12:15:23,453 INFO L290 TraceCheckUtils]: 258: Hoare triple {20816#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20731#(< ~counter~0 50)} is VALID [2022-04-27 12:15:23,453 INFO L290 TraceCheckUtils]: 257: Hoare triple {20816#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20816#(< ~counter~0 49)} is VALID [2022-04-27 12:15:23,453 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {19795#true} {20816#(< ~counter~0 49)} #67#return; {20816#(< ~counter~0 49)} is VALID [2022-04-27 12:15:23,453 INFO L290 TraceCheckUtils]: 255: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,453 INFO L290 TraceCheckUtils]: 254: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,453 INFO L290 TraceCheckUtils]: 253: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,454 INFO L272 TraceCheckUtils]: 252: Hoare triple {20816#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,454 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {19795#true} {20816#(< ~counter~0 49)} #65#return; {20816#(< ~counter~0 49)} is VALID [2022-04-27 12:15:23,454 INFO L290 TraceCheckUtils]: 250: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,454 INFO L290 TraceCheckUtils]: 249: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,454 INFO L290 TraceCheckUtils]: 248: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,454 INFO L272 TraceCheckUtils]: 247: Hoare triple {20816#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,455 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {19795#true} {20816#(< ~counter~0 49)} #63#return; {20816#(< ~counter~0 49)} is VALID [2022-04-27 12:15:23,455 INFO L290 TraceCheckUtils]: 245: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,455 INFO L290 TraceCheckUtils]: 244: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,455 INFO L290 TraceCheckUtils]: 243: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,455 INFO L272 TraceCheckUtils]: 242: Hoare triple {20816#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,455 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {19795#true} {20816#(< ~counter~0 49)} #61#return; {20816#(< ~counter~0 49)} is VALID [2022-04-27 12:15:23,455 INFO L290 TraceCheckUtils]: 240: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,455 INFO L290 TraceCheckUtils]: 239: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,455 INFO L290 TraceCheckUtils]: 238: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,455 INFO L272 TraceCheckUtils]: 237: Hoare triple {20816#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,456 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {19795#true} {20816#(< ~counter~0 49)} #59#return; {20816#(< ~counter~0 49)} is VALID [2022-04-27 12:15:23,456 INFO L290 TraceCheckUtils]: 235: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,456 INFO L290 TraceCheckUtils]: 234: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,456 INFO L290 TraceCheckUtils]: 233: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,456 INFO L272 TraceCheckUtils]: 232: Hoare triple {20816#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,456 INFO L290 TraceCheckUtils]: 231: Hoare triple {20816#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {20816#(< ~counter~0 49)} is VALID [2022-04-27 12:15:23,457 INFO L290 TraceCheckUtils]: 230: Hoare triple {20901#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20816#(< ~counter~0 49)} is VALID [2022-04-27 12:15:23,457 INFO L290 TraceCheckUtils]: 229: Hoare triple {20901#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20901#(< ~counter~0 48)} is VALID [2022-04-27 12:15:23,457 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {19795#true} {20901#(< ~counter~0 48)} #67#return; {20901#(< ~counter~0 48)} is VALID [2022-04-27 12:15:23,457 INFO L290 TraceCheckUtils]: 227: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,457 INFO L290 TraceCheckUtils]: 226: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,458 INFO L290 TraceCheckUtils]: 225: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,458 INFO L272 TraceCheckUtils]: 224: Hoare triple {20901#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,458 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {19795#true} {20901#(< ~counter~0 48)} #65#return; {20901#(< ~counter~0 48)} is VALID [2022-04-27 12:15:23,458 INFO L290 TraceCheckUtils]: 222: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,458 INFO L290 TraceCheckUtils]: 221: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,458 INFO L290 TraceCheckUtils]: 220: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,458 INFO L272 TraceCheckUtils]: 219: Hoare triple {20901#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,459 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {19795#true} {20901#(< ~counter~0 48)} #63#return; {20901#(< ~counter~0 48)} is VALID [2022-04-27 12:15:23,459 INFO L290 TraceCheckUtils]: 217: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,459 INFO L290 TraceCheckUtils]: 216: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,459 INFO L290 TraceCheckUtils]: 215: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,459 INFO L272 TraceCheckUtils]: 214: Hoare triple {20901#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,459 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {19795#true} {20901#(< ~counter~0 48)} #61#return; {20901#(< ~counter~0 48)} is VALID [2022-04-27 12:15:23,459 INFO L290 TraceCheckUtils]: 212: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,459 INFO L290 TraceCheckUtils]: 211: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,459 INFO L290 TraceCheckUtils]: 210: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,459 INFO L272 TraceCheckUtils]: 209: Hoare triple {20901#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,460 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {19795#true} {20901#(< ~counter~0 48)} #59#return; {20901#(< ~counter~0 48)} is VALID [2022-04-27 12:15:23,460 INFO L290 TraceCheckUtils]: 207: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,460 INFO L290 TraceCheckUtils]: 206: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,460 INFO L290 TraceCheckUtils]: 205: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,460 INFO L272 TraceCheckUtils]: 204: Hoare triple {20901#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,460 INFO L290 TraceCheckUtils]: 203: Hoare triple {20901#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {20901#(< ~counter~0 48)} is VALID [2022-04-27 12:15:23,461 INFO L290 TraceCheckUtils]: 202: Hoare triple {20986#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20901#(< ~counter~0 48)} is VALID [2022-04-27 12:15:23,461 INFO L290 TraceCheckUtils]: 201: Hoare triple {20986#(< ~counter~0 47)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {20986#(< ~counter~0 47)} is VALID [2022-04-27 12:15:23,461 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {19795#true} {20986#(< ~counter~0 47)} #67#return; {20986#(< ~counter~0 47)} is VALID [2022-04-27 12:15:23,461 INFO L290 TraceCheckUtils]: 199: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,461 INFO L290 TraceCheckUtils]: 198: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,462 INFO L290 TraceCheckUtils]: 197: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,462 INFO L272 TraceCheckUtils]: 196: Hoare triple {20986#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,462 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {19795#true} {20986#(< ~counter~0 47)} #65#return; {20986#(< ~counter~0 47)} is VALID [2022-04-27 12:15:23,462 INFO L290 TraceCheckUtils]: 194: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,462 INFO L290 TraceCheckUtils]: 193: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,462 INFO L290 TraceCheckUtils]: 192: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,462 INFO L272 TraceCheckUtils]: 191: Hoare triple {20986#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,463 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {19795#true} {20986#(< ~counter~0 47)} #63#return; {20986#(< ~counter~0 47)} is VALID [2022-04-27 12:15:23,463 INFO L290 TraceCheckUtils]: 189: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,463 INFO L290 TraceCheckUtils]: 188: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,463 INFO L290 TraceCheckUtils]: 187: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,463 INFO L272 TraceCheckUtils]: 186: Hoare triple {20986#(< ~counter~0 47)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,463 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {19795#true} {20986#(< ~counter~0 47)} #61#return; {20986#(< ~counter~0 47)} is VALID [2022-04-27 12:15:23,463 INFO L290 TraceCheckUtils]: 184: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,463 INFO L290 TraceCheckUtils]: 183: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,463 INFO L290 TraceCheckUtils]: 182: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,463 INFO L272 TraceCheckUtils]: 181: Hoare triple {20986#(< ~counter~0 47)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,464 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {19795#true} {20986#(< ~counter~0 47)} #59#return; {20986#(< ~counter~0 47)} is VALID [2022-04-27 12:15:23,464 INFO L290 TraceCheckUtils]: 179: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,464 INFO L290 TraceCheckUtils]: 178: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,464 INFO L290 TraceCheckUtils]: 177: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,464 INFO L272 TraceCheckUtils]: 176: Hoare triple {20986#(< ~counter~0 47)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,464 INFO L290 TraceCheckUtils]: 175: Hoare triple {20986#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {20986#(< ~counter~0 47)} is VALID [2022-04-27 12:15:23,465 INFO L290 TraceCheckUtils]: 174: Hoare triple {21071#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20986#(< ~counter~0 47)} is VALID [2022-04-27 12:15:23,465 INFO L290 TraceCheckUtils]: 173: Hoare triple {21071#(< ~counter~0 46)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21071#(< ~counter~0 46)} is VALID [2022-04-27 12:15:23,465 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {19795#true} {21071#(< ~counter~0 46)} #67#return; {21071#(< ~counter~0 46)} is VALID [2022-04-27 12:15:23,466 INFO L290 TraceCheckUtils]: 171: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,466 INFO L290 TraceCheckUtils]: 170: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,466 INFO L290 TraceCheckUtils]: 169: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,466 INFO L272 TraceCheckUtils]: 168: Hoare triple {21071#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,466 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {19795#true} {21071#(< ~counter~0 46)} #65#return; {21071#(< ~counter~0 46)} is VALID [2022-04-27 12:15:23,466 INFO L290 TraceCheckUtils]: 166: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,466 INFO L290 TraceCheckUtils]: 165: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,466 INFO L290 TraceCheckUtils]: 164: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,466 INFO L272 TraceCheckUtils]: 163: Hoare triple {21071#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,467 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {19795#true} {21071#(< ~counter~0 46)} #63#return; {21071#(< ~counter~0 46)} is VALID [2022-04-27 12:15:23,467 INFO L290 TraceCheckUtils]: 161: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,467 INFO L290 TraceCheckUtils]: 160: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,467 INFO L290 TraceCheckUtils]: 159: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,467 INFO L272 TraceCheckUtils]: 158: Hoare triple {21071#(< ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,467 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {19795#true} {21071#(< ~counter~0 46)} #61#return; {21071#(< ~counter~0 46)} is VALID [2022-04-27 12:15:23,467 INFO L290 TraceCheckUtils]: 156: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,467 INFO L290 TraceCheckUtils]: 155: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,467 INFO L290 TraceCheckUtils]: 154: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,468 INFO L272 TraceCheckUtils]: 153: Hoare triple {21071#(< ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,468 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {19795#true} {21071#(< ~counter~0 46)} #59#return; {21071#(< ~counter~0 46)} is VALID [2022-04-27 12:15:23,468 INFO L290 TraceCheckUtils]: 151: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,468 INFO L290 TraceCheckUtils]: 150: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,468 INFO L290 TraceCheckUtils]: 149: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,468 INFO L272 TraceCheckUtils]: 148: Hoare triple {21071#(< ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,468 INFO L290 TraceCheckUtils]: 147: Hoare triple {21071#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {21071#(< ~counter~0 46)} is VALID [2022-04-27 12:15:23,469 INFO L290 TraceCheckUtils]: 146: Hoare triple {21156#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21071#(< ~counter~0 46)} is VALID [2022-04-27 12:15:23,469 INFO L290 TraceCheckUtils]: 145: Hoare triple {21156#(< ~counter~0 45)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21156#(< ~counter~0 45)} is VALID [2022-04-27 12:15:23,470 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {19795#true} {21156#(< ~counter~0 45)} #67#return; {21156#(< ~counter~0 45)} is VALID [2022-04-27 12:15:23,470 INFO L290 TraceCheckUtils]: 143: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,470 INFO L290 TraceCheckUtils]: 142: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,470 INFO L290 TraceCheckUtils]: 141: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,470 INFO L272 TraceCheckUtils]: 140: Hoare triple {21156#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,470 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {19795#true} {21156#(< ~counter~0 45)} #65#return; {21156#(< ~counter~0 45)} is VALID [2022-04-27 12:15:23,470 INFO L290 TraceCheckUtils]: 138: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,470 INFO L290 TraceCheckUtils]: 137: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,471 INFO L290 TraceCheckUtils]: 136: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,471 INFO L272 TraceCheckUtils]: 135: Hoare triple {21156#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,471 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {19795#true} {21156#(< ~counter~0 45)} #63#return; {21156#(< ~counter~0 45)} is VALID [2022-04-27 12:15:23,471 INFO L290 TraceCheckUtils]: 133: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,471 INFO L290 TraceCheckUtils]: 132: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,471 INFO L290 TraceCheckUtils]: 131: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,471 INFO L272 TraceCheckUtils]: 130: Hoare triple {21156#(< ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,472 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {19795#true} {21156#(< ~counter~0 45)} #61#return; {21156#(< ~counter~0 45)} is VALID [2022-04-27 12:15:23,472 INFO L290 TraceCheckUtils]: 128: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,472 INFO L290 TraceCheckUtils]: 127: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,472 INFO L290 TraceCheckUtils]: 126: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,472 INFO L272 TraceCheckUtils]: 125: Hoare triple {21156#(< ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,472 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {19795#true} {21156#(< ~counter~0 45)} #59#return; {21156#(< ~counter~0 45)} is VALID [2022-04-27 12:15:23,472 INFO L290 TraceCheckUtils]: 123: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,472 INFO L290 TraceCheckUtils]: 122: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,472 INFO L290 TraceCheckUtils]: 121: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,472 INFO L272 TraceCheckUtils]: 120: Hoare triple {21156#(< ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,473 INFO L290 TraceCheckUtils]: 119: Hoare triple {21156#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {21156#(< ~counter~0 45)} is VALID [2022-04-27 12:15:23,473 INFO L290 TraceCheckUtils]: 118: Hoare triple {21241#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21156#(< ~counter~0 45)} is VALID [2022-04-27 12:15:23,474 INFO L290 TraceCheckUtils]: 117: Hoare triple {21241#(< ~counter~0 44)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21241#(< ~counter~0 44)} is VALID [2022-04-27 12:15:23,474 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19795#true} {21241#(< ~counter~0 44)} #67#return; {21241#(< ~counter~0 44)} is VALID [2022-04-27 12:15:23,474 INFO L290 TraceCheckUtils]: 115: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,474 INFO L290 TraceCheckUtils]: 114: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,474 INFO L290 TraceCheckUtils]: 113: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,474 INFO L272 TraceCheckUtils]: 112: Hoare triple {21241#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,475 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {19795#true} {21241#(< ~counter~0 44)} #65#return; {21241#(< ~counter~0 44)} is VALID [2022-04-27 12:15:23,475 INFO L290 TraceCheckUtils]: 110: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,475 INFO L290 TraceCheckUtils]: 109: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,475 INFO L290 TraceCheckUtils]: 108: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,475 INFO L272 TraceCheckUtils]: 107: Hoare triple {21241#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,475 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {19795#true} {21241#(< ~counter~0 44)} #63#return; {21241#(< ~counter~0 44)} is VALID [2022-04-27 12:15:23,475 INFO L290 TraceCheckUtils]: 105: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,475 INFO L290 TraceCheckUtils]: 104: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,475 INFO L290 TraceCheckUtils]: 103: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,475 INFO L272 TraceCheckUtils]: 102: Hoare triple {21241#(< ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,476 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {19795#true} {21241#(< ~counter~0 44)} #61#return; {21241#(< ~counter~0 44)} is VALID [2022-04-27 12:15:23,476 INFO L290 TraceCheckUtils]: 100: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,476 INFO L290 TraceCheckUtils]: 99: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,476 INFO L290 TraceCheckUtils]: 98: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,476 INFO L272 TraceCheckUtils]: 97: Hoare triple {21241#(< ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,476 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {19795#true} {21241#(< ~counter~0 44)} #59#return; {21241#(< ~counter~0 44)} is VALID [2022-04-27 12:15:23,476 INFO L290 TraceCheckUtils]: 95: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,476 INFO L290 TraceCheckUtils]: 94: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,476 INFO L290 TraceCheckUtils]: 93: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,477 INFO L272 TraceCheckUtils]: 92: Hoare triple {21241#(< ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,477 INFO L290 TraceCheckUtils]: 91: Hoare triple {21241#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {21241#(< ~counter~0 44)} is VALID [2022-04-27 12:15:23,477 INFO L290 TraceCheckUtils]: 90: Hoare triple {21326#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21241#(< ~counter~0 44)} is VALID [2022-04-27 12:15:23,478 INFO L290 TraceCheckUtils]: 89: Hoare triple {21326#(< ~counter~0 43)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21326#(< ~counter~0 43)} is VALID [2022-04-27 12:15:23,478 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {19795#true} {21326#(< ~counter~0 43)} #67#return; {21326#(< ~counter~0 43)} is VALID [2022-04-27 12:15:23,478 INFO L290 TraceCheckUtils]: 87: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,478 INFO L290 TraceCheckUtils]: 86: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,478 INFO L290 TraceCheckUtils]: 85: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,478 INFO L272 TraceCheckUtils]: 84: Hoare triple {21326#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,479 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {19795#true} {21326#(< ~counter~0 43)} #65#return; {21326#(< ~counter~0 43)} is VALID [2022-04-27 12:15:23,479 INFO L290 TraceCheckUtils]: 82: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,479 INFO L290 TraceCheckUtils]: 81: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,479 INFO L290 TraceCheckUtils]: 80: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,479 INFO L272 TraceCheckUtils]: 79: Hoare triple {21326#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,479 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {19795#true} {21326#(< ~counter~0 43)} #63#return; {21326#(< ~counter~0 43)} is VALID [2022-04-27 12:15:23,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,479 INFO L290 TraceCheckUtils]: 75: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,480 INFO L272 TraceCheckUtils]: 74: Hoare triple {21326#(< ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,480 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {19795#true} {21326#(< ~counter~0 43)} #61#return; {21326#(< ~counter~0 43)} is VALID [2022-04-27 12:15:23,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,480 INFO L290 TraceCheckUtils]: 70: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,480 INFO L272 TraceCheckUtils]: 69: Hoare triple {21326#(< ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,480 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19795#true} {21326#(< ~counter~0 43)} #59#return; {21326#(< ~counter~0 43)} is VALID [2022-04-27 12:15:23,481 INFO L290 TraceCheckUtils]: 67: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,481 INFO L290 TraceCheckUtils]: 66: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,481 INFO L290 TraceCheckUtils]: 65: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,481 INFO L272 TraceCheckUtils]: 64: Hoare triple {21326#(< ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,481 INFO L290 TraceCheckUtils]: 63: Hoare triple {21326#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {21326#(< ~counter~0 43)} is VALID [2022-04-27 12:15:23,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {21411#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21326#(< ~counter~0 43)} is VALID [2022-04-27 12:15:23,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {21411#(< ~counter~0 42)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21411#(< ~counter~0 42)} is VALID [2022-04-27 12:15:23,482 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19795#true} {21411#(< ~counter~0 42)} #67#return; {21411#(< ~counter~0 42)} is VALID [2022-04-27 12:15:23,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,483 INFO L272 TraceCheckUtils]: 56: Hoare triple {21411#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,483 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19795#true} {21411#(< ~counter~0 42)} #65#return; {21411#(< ~counter~0 42)} is VALID [2022-04-27 12:15:23,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,483 INFO L272 TraceCheckUtils]: 51: Hoare triple {21411#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,484 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19795#true} {21411#(< ~counter~0 42)} #63#return; {21411#(< ~counter~0 42)} is VALID [2022-04-27 12:15:23,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,484 INFO L290 TraceCheckUtils]: 48: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,484 INFO L290 TraceCheckUtils]: 47: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,484 INFO L272 TraceCheckUtils]: 46: Hoare triple {21411#(< ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,484 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19795#true} {21411#(< ~counter~0 42)} #61#return; {21411#(< ~counter~0 42)} is VALID [2022-04-27 12:15:23,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,484 INFO L272 TraceCheckUtils]: 41: Hoare triple {21411#(< ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,485 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {19795#true} {21411#(< ~counter~0 42)} #59#return; {21411#(< ~counter~0 42)} is VALID [2022-04-27 12:15:23,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,485 INFO L272 TraceCheckUtils]: 36: Hoare triple {21411#(< ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {21411#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {21411#(< ~counter~0 42)} is VALID [2022-04-27 12:15:23,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {21496#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21411#(< ~counter~0 42)} is VALID [2022-04-27 12:15:23,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {21496#(< ~counter~0 41)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21496#(< ~counter~0 41)} is VALID [2022-04-27 12:15:23,487 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19795#true} {21496#(< ~counter~0 41)} #67#return; {21496#(< ~counter~0 41)} is VALID [2022-04-27 12:15:23,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,487 INFO L272 TraceCheckUtils]: 28: Hoare triple {21496#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,487 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19795#true} {21496#(< ~counter~0 41)} #65#return; {21496#(< ~counter~0 41)} is VALID [2022-04-27 12:15:23,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,488 INFO L272 TraceCheckUtils]: 23: Hoare triple {21496#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,488 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19795#true} {21496#(< ~counter~0 41)} #63#return; {21496#(< ~counter~0 41)} is VALID [2022-04-27 12:15:23,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,488 INFO L272 TraceCheckUtils]: 18: Hoare triple {21496#(< ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,489 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19795#true} {21496#(< ~counter~0 41)} #61#return; {21496#(< ~counter~0 41)} is VALID [2022-04-27 12:15:23,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,489 INFO L272 TraceCheckUtils]: 13: Hoare triple {21496#(< ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,489 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {19795#true} {21496#(< ~counter~0 41)} #59#return; {21496#(< ~counter~0 41)} is VALID [2022-04-27 12:15:23,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {19795#true} assume true; {19795#true} is VALID [2022-04-27 12:15:23,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {19795#true} assume !(0 == ~cond); {19795#true} is VALID [2022-04-27 12:15:23,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {19795#true} ~cond := #in~cond; {19795#true} is VALID [2022-04-27 12:15:23,490 INFO L272 TraceCheckUtils]: 8: Hoare triple {21496#(< ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19795#true} is VALID [2022-04-27 12:15:23,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {21496#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {21496#(< ~counter~0 41)} is VALID [2022-04-27 12:15:23,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {21581#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21496#(< ~counter~0 41)} is VALID [2022-04-27 12:15:23,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {21581#(< ~counter~0 40)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {21581#(< ~counter~0 40)} is VALID [2022-04-27 12:15:23,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {21581#(< ~counter~0 40)} call #t~ret6 := main(); {21581#(< ~counter~0 40)} is VALID [2022-04-27 12:15:23,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21581#(< ~counter~0 40)} {19795#true} #81#return; {21581#(< ~counter~0 40)} is VALID [2022-04-27 12:15:23,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {21581#(< ~counter~0 40)} assume true; {21581#(< ~counter~0 40)} is VALID [2022-04-27 12:15:23,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {19795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21581#(< ~counter~0 40)} is VALID [2022-04-27 12:15:23,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {19795#true} call ULTIMATE.init(); {19795#true} is VALID [2022-04-27 12:15:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2022-04-27 12:15:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:23,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498482448] [2022-04-27 12:15:23,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:23,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008900267] [2022-04-27 12:15:23,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008900267] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:15:23,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:15:23,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-27 12:15:23,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131620899] [2022-04-27 12:15:23,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:15:23,495 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) Word has length 297 [2022-04-27 12:15:23,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:23,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-27 12:15:23,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:23,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 12:15:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:23,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 12:15:23,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-27 12:15:23,792 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-27 12:15:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:28,530 INFO L93 Difference]: Finished difference Result 640 states and 652 transitions. [2022-04-27 12:15:28,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 12:15:28,531 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) Word has length 297 [2022-04-27 12:15:28,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-27 12:15:28,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 386 transitions. [2022-04-27 12:15:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-27 12:15:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 386 transitions. [2022-04-27 12:15:28,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 386 transitions. [2022-04-27 12:15:28,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:28,929 INFO L225 Difference]: With dead ends: 640 [2022-04-27 12:15:28,930 INFO L226 Difference]: Without dead ends: 630 [2022-04-27 12:15:28,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-27 12:15:28,932 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 292 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:28,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 508 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 12:15:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-04-27 12:15:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2022-04-27 12:15:29,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:29,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 630 states. Second operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-27 12:15:29,232 INFO L74 IsIncluded]: Start isIncluded. First operand 630 states. Second operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-27 12:15:29,232 INFO L87 Difference]: Start difference. First operand 630 states. Second operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-27 12:15:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:29,246 INFO L93 Difference]: Finished difference Result 630 states and 631 transitions. [2022-04-27 12:15:29,246 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-27 12:15:29,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:29,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:29,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 630 states. [2022-04-27 12:15:29,248 INFO L87 Difference]: Start difference. First operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 630 states. [2022-04-27 12:15:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:29,261 INFO L93 Difference]: Finished difference Result 630 states and 631 transitions. [2022-04-27 12:15:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-27 12:15:29,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:29,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:29,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:29,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 404 states have (on average 1.0024752475247525) internal successors, (405), 404 states have internal predecessors, (405), 114 states have call successors, (114), 113 states have call predecessors, (114), 111 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-27 12:15:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 631 transitions. [2022-04-27 12:15:29,279 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 631 transitions. Word has length 297 [2022-04-27 12:15:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:29,279 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 631 transitions. [2022-04-27 12:15:29,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 24 states have call successors, (106), 14 states have call predecessors, (106), 14 states have return successors, (104), 23 states have call predecessors, (104), 22 states have call successors, (104) [2022-04-27 12:15:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-27 12:15:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2022-04-27 12:15:29,287 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:29,287 INFO L195 NwaCegarLoop]: trace histogram [112, 111, 111, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:29,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 12:15:29,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:29,493 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:29,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:29,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1616558797, now seen corresponding path program 4 times [2022-04-27 12:15:29,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:29,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495573298] [2022-04-27 12:15:29,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:29,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:29,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1331784321] [2022-04-27 12:15:29,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 12:15:29,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:29,525 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:15:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-27 12:15:29,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 12:15:29,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:15:29,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-27 12:15:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:29,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:32,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {24678#true} call ULTIMATE.init(); {24678#true} is VALID [2022-04-27 12:15:32,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {24678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24686#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:32,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {24686#(<= ~counter~0 0)} assume true; {24686#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:32,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24686#(<= ~counter~0 0)} {24678#true} #81#return; {24686#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:32,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {24686#(<= ~counter~0 0)} call #t~ret6 := main(); {24686#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:32,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {24686#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {24686#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:32,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {24686#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {24702#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,523 INFO L272 TraceCheckUtils]: 8: Hoare triple {24702#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {24702#(<= ~counter~0 1)} ~cond := #in~cond; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {24702#(<= ~counter~0 1)} assume !(0 == ~cond); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {24702#(<= ~counter~0 1)} assume true; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,524 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24702#(<= ~counter~0 1)} {24702#(<= ~counter~0 1)} #59#return; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,525 INFO L272 TraceCheckUtils]: 13: Hoare triple {24702#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {24702#(<= ~counter~0 1)} ~cond := #in~cond; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {24702#(<= ~counter~0 1)} assume !(0 == ~cond); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {24702#(<= ~counter~0 1)} assume true; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,526 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24702#(<= ~counter~0 1)} {24702#(<= ~counter~0 1)} #61#return; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,526 INFO L272 TraceCheckUtils]: 18: Hoare triple {24702#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {24702#(<= ~counter~0 1)} ~cond := #in~cond; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {24702#(<= ~counter~0 1)} assume !(0 == ~cond); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {24702#(<= ~counter~0 1)} assume true; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,527 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24702#(<= ~counter~0 1)} {24702#(<= ~counter~0 1)} #63#return; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,527 INFO L272 TraceCheckUtils]: 23: Hoare triple {24702#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {24702#(<= ~counter~0 1)} ~cond := #in~cond; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {24702#(<= ~counter~0 1)} assume !(0 == ~cond); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {24702#(<= ~counter~0 1)} assume true; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,529 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24702#(<= ~counter~0 1)} {24702#(<= ~counter~0 1)} #65#return; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,529 INFO L272 TraceCheckUtils]: 28: Hoare triple {24702#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {24702#(<= ~counter~0 1)} ~cond := #in~cond; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {24702#(<= ~counter~0 1)} assume !(0 == ~cond); {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,530 INFO L290 TraceCheckUtils]: 31: Hoare triple {24702#(<= ~counter~0 1)} assume true; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,530 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24702#(<= ~counter~0 1)} {24702#(<= ~counter~0 1)} #67#return; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {24702#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {24702#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:32,531 INFO L290 TraceCheckUtils]: 34: Hoare triple {24702#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {24787#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,531 INFO L272 TraceCheckUtils]: 36: Hoare triple {24787#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {24787#(<= ~counter~0 2)} ~cond := #in~cond; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,532 INFO L290 TraceCheckUtils]: 38: Hoare triple {24787#(<= ~counter~0 2)} assume !(0 == ~cond); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,532 INFO L290 TraceCheckUtils]: 39: Hoare triple {24787#(<= ~counter~0 2)} assume true; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,532 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24787#(<= ~counter~0 2)} {24787#(<= ~counter~0 2)} #59#return; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,533 INFO L272 TraceCheckUtils]: 41: Hoare triple {24787#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {24787#(<= ~counter~0 2)} ~cond := #in~cond; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {24787#(<= ~counter~0 2)} assume !(0 == ~cond); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {24787#(<= ~counter~0 2)} assume true; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,534 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24787#(<= ~counter~0 2)} {24787#(<= ~counter~0 2)} #61#return; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,534 INFO L272 TraceCheckUtils]: 46: Hoare triple {24787#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,534 INFO L290 TraceCheckUtils]: 47: Hoare triple {24787#(<= ~counter~0 2)} ~cond := #in~cond; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,534 INFO L290 TraceCheckUtils]: 48: Hoare triple {24787#(<= ~counter~0 2)} assume !(0 == ~cond); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {24787#(<= ~counter~0 2)} assume true; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,535 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24787#(<= ~counter~0 2)} {24787#(<= ~counter~0 2)} #63#return; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,535 INFO L272 TraceCheckUtils]: 51: Hoare triple {24787#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,535 INFO L290 TraceCheckUtils]: 52: Hoare triple {24787#(<= ~counter~0 2)} ~cond := #in~cond; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {24787#(<= ~counter~0 2)} assume !(0 == ~cond); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {24787#(<= ~counter~0 2)} assume true; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,536 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24787#(<= ~counter~0 2)} {24787#(<= ~counter~0 2)} #65#return; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,537 INFO L272 TraceCheckUtils]: 56: Hoare triple {24787#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,537 INFO L290 TraceCheckUtils]: 57: Hoare triple {24787#(<= ~counter~0 2)} ~cond := #in~cond; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,537 INFO L290 TraceCheckUtils]: 58: Hoare triple {24787#(<= ~counter~0 2)} assume !(0 == ~cond); {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,537 INFO L290 TraceCheckUtils]: 59: Hoare triple {24787#(<= ~counter~0 2)} assume true; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,538 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {24787#(<= ~counter~0 2)} {24787#(<= ~counter~0 2)} #67#return; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,538 INFO L290 TraceCheckUtils]: 61: Hoare triple {24787#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {24787#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:32,538 INFO L290 TraceCheckUtils]: 62: Hoare triple {24787#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,539 INFO L290 TraceCheckUtils]: 63: Hoare triple {24872#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,539 INFO L272 TraceCheckUtils]: 64: Hoare triple {24872#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,539 INFO L290 TraceCheckUtils]: 65: Hoare triple {24872#(<= ~counter~0 3)} ~cond := #in~cond; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,539 INFO L290 TraceCheckUtils]: 66: Hoare triple {24872#(<= ~counter~0 3)} assume !(0 == ~cond); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,540 INFO L290 TraceCheckUtils]: 67: Hoare triple {24872#(<= ~counter~0 3)} assume true; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,540 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {24872#(<= ~counter~0 3)} {24872#(<= ~counter~0 3)} #59#return; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,540 INFO L272 TraceCheckUtils]: 69: Hoare triple {24872#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,541 INFO L290 TraceCheckUtils]: 70: Hoare triple {24872#(<= ~counter~0 3)} ~cond := #in~cond; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,541 INFO L290 TraceCheckUtils]: 71: Hoare triple {24872#(<= ~counter~0 3)} assume !(0 == ~cond); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,541 INFO L290 TraceCheckUtils]: 72: Hoare triple {24872#(<= ~counter~0 3)} assume true; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,541 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {24872#(<= ~counter~0 3)} {24872#(<= ~counter~0 3)} #61#return; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,542 INFO L272 TraceCheckUtils]: 74: Hoare triple {24872#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,542 INFO L290 TraceCheckUtils]: 75: Hoare triple {24872#(<= ~counter~0 3)} ~cond := #in~cond; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,542 INFO L290 TraceCheckUtils]: 76: Hoare triple {24872#(<= ~counter~0 3)} assume !(0 == ~cond); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,542 INFO L290 TraceCheckUtils]: 77: Hoare triple {24872#(<= ~counter~0 3)} assume true; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,543 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {24872#(<= ~counter~0 3)} {24872#(<= ~counter~0 3)} #63#return; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,543 INFO L272 TraceCheckUtils]: 79: Hoare triple {24872#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,543 INFO L290 TraceCheckUtils]: 80: Hoare triple {24872#(<= ~counter~0 3)} ~cond := #in~cond; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,544 INFO L290 TraceCheckUtils]: 81: Hoare triple {24872#(<= ~counter~0 3)} assume !(0 == ~cond); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,544 INFO L290 TraceCheckUtils]: 82: Hoare triple {24872#(<= ~counter~0 3)} assume true; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,544 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {24872#(<= ~counter~0 3)} {24872#(<= ~counter~0 3)} #65#return; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,544 INFO L272 TraceCheckUtils]: 84: Hoare triple {24872#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,545 INFO L290 TraceCheckUtils]: 85: Hoare triple {24872#(<= ~counter~0 3)} ~cond := #in~cond; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,545 INFO L290 TraceCheckUtils]: 86: Hoare triple {24872#(<= ~counter~0 3)} assume !(0 == ~cond); {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,545 INFO L290 TraceCheckUtils]: 87: Hoare triple {24872#(<= ~counter~0 3)} assume true; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,546 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {24872#(<= ~counter~0 3)} {24872#(<= ~counter~0 3)} #67#return; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,546 INFO L290 TraceCheckUtils]: 89: Hoare triple {24872#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {24872#(<= ~counter~0 3)} is VALID [2022-04-27 12:15:32,546 INFO L290 TraceCheckUtils]: 90: Hoare triple {24872#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,546 INFO L290 TraceCheckUtils]: 91: Hoare triple {24957#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,547 INFO L272 TraceCheckUtils]: 92: Hoare triple {24957#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,547 INFO L290 TraceCheckUtils]: 93: Hoare triple {24957#(<= ~counter~0 4)} ~cond := #in~cond; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,547 INFO L290 TraceCheckUtils]: 94: Hoare triple {24957#(<= ~counter~0 4)} assume !(0 == ~cond); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,547 INFO L290 TraceCheckUtils]: 95: Hoare triple {24957#(<= ~counter~0 4)} assume true; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,548 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {24957#(<= ~counter~0 4)} {24957#(<= ~counter~0 4)} #59#return; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,548 INFO L272 TraceCheckUtils]: 97: Hoare triple {24957#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,548 INFO L290 TraceCheckUtils]: 98: Hoare triple {24957#(<= ~counter~0 4)} ~cond := #in~cond; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,549 INFO L290 TraceCheckUtils]: 99: Hoare triple {24957#(<= ~counter~0 4)} assume !(0 == ~cond); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,549 INFO L290 TraceCheckUtils]: 100: Hoare triple {24957#(<= ~counter~0 4)} assume true; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,549 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {24957#(<= ~counter~0 4)} {24957#(<= ~counter~0 4)} #61#return; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,549 INFO L272 TraceCheckUtils]: 102: Hoare triple {24957#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,550 INFO L290 TraceCheckUtils]: 103: Hoare triple {24957#(<= ~counter~0 4)} ~cond := #in~cond; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,550 INFO L290 TraceCheckUtils]: 104: Hoare triple {24957#(<= ~counter~0 4)} assume !(0 == ~cond); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,550 INFO L290 TraceCheckUtils]: 105: Hoare triple {24957#(<= ~counter~0 4)} assume true; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,550 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {24957#(<= ~counter~0 4)} {24957#(<= ~counter~0 4)} #63#return; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,551 INFO L272 TraceCheckUtils]: 107: Hoare triple {24957#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,551 INFO L290 TraceCheckUtils]: 108: Hoare triple {24957#(<= ~counter~0 4)} ~cond := #in~cond; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,551 INFO L290 TraceCheckUtils]: 109: Hoare triple {24957#(<= ~counter~0 4)} assume !(0 == ~cond); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,551 INFO L290 TraceCheckUtils]: 110: Hoare triple {24957#(<= ~counter~0 4)} assume true; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,552 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {24957#(<= ~counter~0 4)} {24957#(<= ~counter~0 4)} #65#return; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,552 INFO L272 TraceCheckUtils]: 112: Hoare triple {24957#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,552 INFO L290 TraceCheckUtils]: 113: Hoare triple {24957#(<= ~counter~0 4)} ~cond := #in~cond; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,553 INFO L290 TraceCheckUtils]: 114: Hoare triple {24957#(<= ~counter~0 4)} assume !(0 == ~cond); {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,553 INFO L290 TraceCheckUtils]: 115: Hoare triple {24957#(<= ~counter~0 4)} assume true; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,553 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {24957#(<= ~counter~0 4)} {24957#(<= ~counter~0 4)} #67#return; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,553 INFO L290 TraceCheckUtils]: 117: Hoare triple {24957#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {24957#(<= ~counter~0 4)} is VALID [2022-04-27 12:15:32,554 INFO L290 TraceCheckUtils]: 118: Hoare triple {24957#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,554 INFO L290 TraceCheckUtils]: 119: Hoare triple {25042#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,554 INFO L272 TraceCheckUtils]: 120: Hoare triple {25042#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,555 INFO L290 TraceCheckUtils]: 121: Hoare triple {25042#(<= ~counter~0 5)} ~cond := #in~cond; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,555 INFO L290 TraceCheckUtils]: 122: Hoare triple {25042#(<= ~counter~0 5)} assume !(0 == ~cond); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,555 INFO L290 TraceCheckUtils]: 123: Hoare triple {25042#(<= ~counter~0 5)} assume true; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,555 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {25042#(<= ~counter~0 5)} {25042#(<= ~counter~0 5)} #59#return; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,556 INFO L272 TraceCheckUtils]: 125: Hoare triple {25042#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,556 INFO L290 TraceCheckUtils]: 126: Hoare triple {25042#(<= ~counter~0 5)} ~cond := #in~cond; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,556 INFO L290 TraceCheckUtils]: 127: Hoare triple {25042#(<= ~counter~0 5)} assume !(0 == ~cond); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,556 INFO L290 TraceCheckUtils]: 128: Hoare triple {25042#(<= ~counter~0 5)} assume true; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,557 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {25042#(<= ~counter~0 5)} {25042#(<= ~counter~0 5)} #61#return; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,557 INFO L272 TraceCheckUtils]: 130: Hoare triple {25042#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,557 INFO L290 TraceCheckUtils]: 131: Hoare triple {25042#(<= ~counter~0 5)} ~cond := #in~cond; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,558 INFO L290 TraceCheckUtils]: 132: Hoare triple {25042#(<= ~counter~0 5)} assume !(0 == ~cond); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,558 INFO L290 TraceCheckUtils]: 133: Hoare triple {25042#(<= ~counter~0 5)} assume true; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,558 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {25042#(<= ~counter~0 5)} {25042#(<= ~counter~0 5)} #63#return; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,559 INFO L272 TraceCheckUtils]: 135: Hoare triple {25042#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,559 INFO L290 TraceCheckUtils]: 136: Hoare triple {25042#(<= ~counter~0 5)} ~cond := #in~cond; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,559 INFO L290 TraceCheckUtils]: 137: Hoare triple {25042#(<= ~counter~0 5)} assume !(0 == ~cond); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,559 INFO L290 TraceCheckUtils]: 138: Hoare triple {25042#(<= ~counter~0 5)} assume true; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,560 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {25042#(<= ~counter~0 5)} {25042#(<= ~counter~0 5)} #65#return; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,560 INFO L272 TraceCheckUtils]: 140: Hoare triple {25042#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,560 INFO L290 TraceCheckUtils]: 141: Hoare triple {25042#(<= ~counter~0 5)} ~cond := #in~cond; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,560 INFO L290 TraceCheckUtils]: 142: Hoare triple {25042#(<= ~counter~0 5)} assume !(0 == ~cond); {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,561 INFO L290 TraceCheckUtils]: 143: Hoare triple {25042#(<= ~counter~0 5)} assume true; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,561 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {25042#(<= ~counter~0 5)} {25042#(<= ~counter~0 5)} #67#return; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,561 INFO L290 TraceCheckUtils]: 145: Hoare triple {25042#(<= ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25042#(<= ~counter~0 5)} is VALID [2022-04-27 12:15:32,562 INFO L290 TraceCheckUtils]: 146: Hoare triple {25042#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,562 INFO L290 TraceCheckUtils]: 147: Hoare triple {25127#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,562 INFO L272 TraceCheckUtils]: 148: Hoare triple {25127#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,562 INFO L290 TraceCheckUtils]: 149: Hoare triple {25127#(<= ~counter~0 6)} ~cond := #in~cond; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,563 INFO L290 TraceCheckUtils]: 150: Hoare triple {25127#(<= ~counter~0 6)} assume !(0 == ~cond); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,563 INFO L290 TraceCheckUtils]: 151: Hoare triple {25127#(<= ~counter~0 6)} assume true; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,563 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25127#(<= ~counter~0 6)} {25127#(<= ~counter~0 6)} #59#return; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,564 INFO L272 TraceCheckUtils]: 153: Hoare triple {25127#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,564 INFO L290 TraceCheckUtils]: 154: Hoare triple {25127#(<= ~counter~0 6)} ~cond := #in~cond; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,564 INFO L290 TraceCheckUtils]: 155: Hoare triple {25127#(<= ~counter~0 6)} assume !(0 == ~cond); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,564 INFO L290 TraceCheckUtils]: 156: Hoare triple {25127#(<= ~counter~0 6)} assume true; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,565 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25127#(<= ~counter~0 6)} {25127#(<= ~counter~0 6)} #61#return; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,565 INFO L272 TraceCheckUtils]: 158: Hoare triple {25127#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,565 INFO L290 TraceCheckUtils]: 159: Hoare triple {25127#(<= ~counter~0 6)} ~cond := #in~cond; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,565 INFO L290 TraceCheckUtils]: 160: Hoare triple {25127#(<= ~counter~0 6)} assume !(0 == ~cond); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,579 INFO L290 TraceCheckUtils]: 161: Hoare triple {25127#(<= ~counter~0 6)} assume true; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,579 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25127#(<= ~counter~0 6)} {25127#(<= ~counter~0 6)} #63#return; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,580 INFO L272 TraceCheckUtils]: 163: Hoare triple {25127#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,580 INFO L290 TraceCheckUtils]: 164: Hoare triple {25127#(<= ~counter~0 6)} ~cond := #in~cond; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,580 INFO L290 TraceCheckUtils]: 165: Hoare triple {25127#(<= ~counter~0 6)} assume !(0 == ~cond); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,580 INFO L290 TraceCheckUtils]: 166: Hoare triple {25127#(<= ~counter~0 6)} assume true; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,581 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25127#(<= ~counter~0 6)} {25127#(<= ~counter~0 6)} #65#return; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,581 INFO L272 TraceCheckUtils]: 168: Hoare triple {25127#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,581 INFO L290 TraceCheckUtils]: 169: Hoare triple {25127#(<= ~counter~0 6)} ~cond := #in~cond; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,582 INFO L290 TraceCheckUtils]: 170: Hoare triple {25127#(<= ~counter~0 6)} assume !(0 == ~cond); {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,582 INFO L290 TraceCheckUtils]: 171: Hoare triple {25127#(<= ~counter~0 6)} assume true; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,582 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25127#(<= ~counter~0 6)} {25127#(<= ~counter~0 6)} #67#return; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,582 INFO L290 TraceCheckUtils]: 173: Hoare triple {25127#(<= ~counter~0 6)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25127#(<= ~counter~0 6)} is VALID [2022-04-27 12:15:32,583 INFO L290 TraceCheckUtils]: 174: Hoare triple {25127#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,583 INFO L290 TraceCheckUtils]: 175: Hoare triple {25212#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,584 INFO L272 TraceCheckUtils]: 176: Hoare triple {25212#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,584 INFO L290 TraceCheckUtils]: 177: Hoare triple {25212#(<= ~counter~0 7)} ~cond := #in~cond; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,584 INFO L290 TraceCheckUtils]: 178: Hoare triple {25212#(<= ~counter~0 7)} assume !(0 == ~cond); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,584 INFO L290 TraceCheckUtils]: 179: Hoare triple {25212#(<= ~counter~0 7)} assume true; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,585 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {25212#(<= ~counter~0 7)} {25212#(<= ~counter~0 7)} #59#return; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,585 INFO L272 TraceCheckUtils]: 181: Hoare triple {25212#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,585 INFO L290 TraceCheckUtils]: 182: Hoare triple {25212#(<= ~counter~0 7)} ~cond := #in~cond; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,585 INFO L290 TraceCheckUtils]: 183: Hoare triple {25212#(<= ~counter~0 7)} assume !(0 == ~cond); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,586 INFO L290 TraceCheckUtils]: 184: Hoare triple {25212#(<= ~counter~0 7)} assume true; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,586 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {25212#(<= ~counter~0 7)} {25212#(<= ~counter~0 7)} #61#return; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,586 INFO L272 TraceCheckUtils]: 186: Hoare triple {25212#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,587 INFO L290 TraceCheckUtils]: 187: Hoare triple {25212#(<= ~counter~0 7)} ~cond := #in~cond; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,587 INFO L290 TraceCheckUtils]: 188: Hoare triple {25212#(<= ~counter~0 7)} assume !(0 == ~cond); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,587 INFO L290 TraceCheckUtils]: 189: Hoare triple {25212#(<= ~counter~0 7)} assume true; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,587 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {25212#(<= ~counter~0 7)} {25212#(<= ~counter~0 7)} #63#return; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,588 INFO L272 TraceCheckUtils]: 191: Hoare triple {25212#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,588 INFO L290 TraceCheckUtils]: 192: Hoare triple {25212#(<= ~counter~0 7)} ~cond := #in~cond; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,588 INFO L290 TraceCheckUtils]: 193: Hoare triple {25212#(<= ~counter~0 7)} assume !(0 == ~cond); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,588 INFO L290 TraceCheckUtils]: 194: Hoare triple {25212#(<= ~counter~0 7)} assume true; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,589 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {25212#(<= ~counter~0 7)} {25212#(<= ~counter~0 7)} #65#return; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,589 INFO L272 TraceCheckUtils]: 196: Hoare triple {25212#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,589 INFO L290 TraceCheckUtils]: 197: Hoare triple {25212#(<= ~counter~0 7)} ~cond := #in~cond; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,590 INFO L290 TraceCheckUtils]: 198: Hoare triple {25212#(<= ~counter~0 7)} assume !(0 == ~cond); {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,590 INFO L290 TraceCheckUtils]: 199: Hoare triple {25212#(<= ~counter~0 7)} assume true; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,590 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {25212#(<= ~counter~0 7)} {25212#(<= ~counter~0 7)} #67#return; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,590 INFO L290 TraceCheckUtils]: 201: Hoare triple {25212#(<= ~counter~0 7)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25212#(<= ~counter~0 7)} is VALID [2022-04-27 12:15:32,591 INFO L290 TraceCheckUtils]: 202: Hoare triple {25212#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,591 INFO L290 TraceCheckUtils]: 203: Hoare triple {25297#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,591 INFO L272 TraceCheckUtils]: 204: Hoare triple {25297#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,592 INFO L290 TraceCheckUtils]: 205: Hoare triple {25297#(<= ~counter~0 8)} ~cond := #in~cond; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,592 INFO L290 TraceCheckUtils]: 206: Hoare triple {25297#(<= ~counter~0 8)} assume !(0 == ~cond); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,592 INFO L290 TraceCheckUtils]: 207: Hoare triple {25297#(<= ~counter~0 8)} assume true; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,592 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {25297#(<= ~counter~0 8)} {25297#(<= ~counter~0 8)} #59#return; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,593 INFO L272 TraceCheckUtils]: 209: Hoare triple {25297#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,593 INFO L290 TraceCheckUtils]: 210: Hoare triple {25297#(<= ~counter~0 8)} ~cond := #in~cond; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,593 INFO L290 TraceCheckUtils]: 211: Hoare triple {25297#(<= ~counter~0 8)} assume !(0 == ~cond); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,593 INFO L290 TraceCheckUtils]: 212: Hoare triple {25297#(<= ~counter~0 8)} assume true; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,594 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {25297#(<= ~counter~0 8)} {25297#(<= ~counter~0 8)} #61#return; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,594 INFO L272 TraceCheckUtils]: 214: Hoare triple {25297#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,594 INFO L290 TraceCheckUtils]: 215: Hoare triple {25297#(<= ~counter~0 8)} ~cond := #in~cond; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,595 INFO L290 TraceCheckUtils]: 216: Hoare triple {25297#(<= ~counter~0 8)} assume !(0 == ~cond); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,595 INFO L290 TraceCheckUtils]: 217: Hoare triple {25297#(<= ~counter~0 8)} assume true; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,595 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {25297#(<= ~counter~0 8)} {25297#(<= ~counter~0 8)} #63#return; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,595 INFO L272 TraceCheckUtils]: 219: Hoare triple {25297#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,596 INFO L290 TraceCheckUtils]: 220: Hoare triple {25297#(<= ~counter~0 8)} ~cond := #in~cond; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,596 INFO L290 TraceCheckUtils]: 221: Hoare triple {25297#(<= ~counter~0 8)} assume !(0 == ~cond); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,596 INFO L290 TraceCheckUtils]: 222: Hoare triple {25297#(<= ~counter~0 8)} assume true; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,596 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {25297#(<= ~counter~0 8)} {25297#(<= ~counter~0 8)} #65#return; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,597 INFO L272 TraceCheckUtils]: 224: Hoare triple {25297#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,597 INFO L290 TraceCheckUtils]: 225: Hoare triple {25297#(<= ~counter~0 8)} ~cond := #in~cond; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,597 INFO L290 TraceCheckUtils]: 226: Hoare triple {25297#(<= ~counter~0 8)} assume !(0 == ~cond); {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,598 INFO L290 TraceCheckUtils]: 227: Hoare triple {25297#(<= ~counter~0 8)} assume true; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,598 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {25297#(<= ~counter~0 8)} {25297#(<= ~counter~0 8)} #67#return; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,598 INFO L290 TraceCheckUtils]: 229: Hoare triple {25297#(<= ~counter~0 8)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25297#(<= ~counter~0 8)} is VALID [2022-04-27 12:15:32,599 INFO L290 TraceCheckUtils]: 230: Hoare triple {25297#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,599 INFO L290 TraceCheckUtils]: 231: Hoare triple {25382#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,599 INFO L272 TraceCheckUtils]: 232: Hoare triple {25382#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,599 INFO L290 TraceCheckUtils]: 233: Hoare triple {25382#(<= ~counter~0 9)} ~cond := #in~cond; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,600 INFO L290 TraceCheckUtils]: 234: Hoare triple {25382#(<= ~counter~0 9)} assume !(0 == ~cond); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,600 INFO L290 TraceCheckUtils]: 235: Hoare triple {25382#(<= ~counter~0 9)} assume true; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,600 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {25382#(<= ~counter~0 9)} {25382#(<= ~counter~0 9)} #59#return; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,600 INFO L272 TraceCheckUtils]: 237: Hoare triple {25382#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,601 INFO L290 TraceCheckUtils]: 238: Hoare triple {25382#(<= ~counter~0 9)} ~cond := #in~cond; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,601 INFO L290 TraceCheckUtils]: 239: Hoare triple {25382#(<= ~counter~0 9)} assume !(0 == ~cond); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,601 INFO L290 TraceCheckUtils]: 240: Hoare triple {25382#(<= ~counter~0 9)} assume true; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,601 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {25382#(<= ~counter~0 9)} {25382#(<= ~counter~0 9)} #61#return; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,602 INFO L272 TraceCheckUtils]: 242: Hoare triple {25382#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,602 INFO L290 TraceCheckUtils]: 243: Hoare triple {25382#(<= ~counter~0 9)} ~cond := #in~cond; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,602 INFO L290 TraceCheckUtils]: 244: Hoare triple {25382#(<= ~counter~0 9)} assume !(0 == ~cond); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,602 INFO L290 TraceCheckUtils]: 245: Hoare triple {25382#(<= ~counter~0 9)} assume true; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,603 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {25382#(<= ~counter~0 9)} {25382#(<= ~counter~0 9)} #63#return; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,603 INFO L272 TraceCheckUtils]: 247: Hoare triple {25382#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,603 INFO L290 TraceCheckUtils]: 248: Hoare triple {25382#(<= ~counter~0 9)} ~cond := #in~cond; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,604 INFO L290 TraceCheckUtils]: 249: Hoare triple {25382#(<= ~counter~0 9)} assume !(0 == ~cond); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,604 INFO L290 TraceCheckUtils]: 250: Hoare triple {25382#(<= ~counter~0 9)} assume true; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,604 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {25382#(<= ~counter~0 9)} {25382#(<= ~counter~0 9)} #65#return; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,605 INFO L272 TraceCheckUtils]: 252: Hoare triple {25382#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,605 INFO L290 TraceCheckUtils]: 253: Hoare triple {25382#(<= ~counter~0 9)} ~cond := #in~cond; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,605 INFO L290 TraceCheckUtils]: 254: Hoare triple {25382#(<= ~counter~0 9)} assume !(0 == ~cond); {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,605 INFO L290 TraceCheckUtils]: 255: Hoare triple {25382#(<= ~counter~0 9)} assume true; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,606 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {25382#(<= ~counter~0 9)} {25382#(<= ~counter~0 9)} #67#return; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,606 INFO L290 TraceCheckUtils]: 257: Hoare triple {25382#(<= ~counter~0 9)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25382#(<= ~counter~0 9)} is VALID [2022-04-27 12:15:32,606 INFO L290 TraceCheckUtils]: 258: Hoare triple {25382#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,606 INFO L290 TraceCheckUtils]: 259: Hoare triple {25467#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,607 INFO L272 TraceCheckUtils]: 260: Hoare triple {25467#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,607 INFO L290 TraceCheckUtils]: 261: Hoare triple {25467#(<= ~counter~0 10)} ~cond := #in~cond; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,607 INFO L290 TraceCheckUtils]: 262: Hoare triple {25467#(<= ~counter~0 10)} assume !(0 == ~cond); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,607 INFO L290 TraceCheckUtils]: 263: Hoare triple {25467#(<= ~counter~0 10)} assume true; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,608 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {25467#(<= ~counter~0 10)} {25467#(<= ~counter~0 10)} #59#return; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,608 INFO L272 TraceCheckUtils]: 265: Hoare triple {25467#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,608 INFO L290 TraceCheckUtils]: 266: Hoare triple {25467#(<= ~counter~0 10)} ~cond := #in~cond; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,609 INFO L290 TraceCheckUtils]: 267: Hoare triple {25467#(<= ~counter~0 10)} assume !(0 == ~cond); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,609 INFO L290 TraceCheckUtils]: 268: Hoare triple {25467#(<= ~counter~0 10)} assume true; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,609 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {25467#(<= ~counter~0 10)} {25467#(<= ~counter~0 10)} #61#return; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,610 INFO L272 TraceCheckUtils]: 270: Hoare triple {25467#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,610 INFO L290 TraceCheckUtils]: 271: Hoare triple {25467#(<= ~counter~0 10)} ~cond := #in~cond; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,610 INFO L290 TraceCheckUtils]: 272: Hoare triple {25467#(<= ~counter~0 10)} assume !(0 == ~cond); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,610 INFO L290 TraceCheckUtils]: 273: Hoare triple {25467#(<= ~counter~0 10)} assume true; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,610 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {25467#(<= ~counter~0 10)} {25467#(<= ~counter~0 10)} #63#return; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,611 INFO L272 TraceCheckUtils]: 275: Hoare triple {25467#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,611 INFO L290 TraceCheckUtils]: 276: Hoare triple {25467#(<= ~counter~0 10)} ~cond := #in~cond; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,611 INFO L290 TraceCheckUtils]: 277: Hoare triple {25467#(<= ~counter~0 10)} assume !(0 == ~cond); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,612 INFO L290 TraceCheckUtils]: 278: Hoare triple {25467#(<= ~counter~0 10)} assume true; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,612 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {25467#(<= ~counter~0 10)} {25467#(<= ~counter~0 10)} #65#return; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,612 INFO L272 TraceCheckUtils]: 280: Hoare triple {25467#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,612 INFO L290 TraceCheckUtils]: 281: Hoare triple {25467#(<= ~counter~0 10)} ~cond := #in~cond; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,613 INFO L290 TraceCheckUtils]: 282: Hoare triple {25467#(<= ~counter~0 10)} assume !(0 == ~cond); {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,613 INFO L290 TraceCheckUtils]: 283: Hoare triple {25467#(<= ~counter~0 10)} assume true; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,613 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {25467#(<= ~counter~0 10)} {25467#(<= ~counter~0 10)} #67#return; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,613 INFO L290 TraceCheckUtils]: 285: Hoare triple {25467#(<= ~counter~0 10)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25467#(<= ~counter~0 10)} is VALID [2022-04-27 12:15:32,614 INFO L290 TraceCheckUtils]: 286: Hoare triple {25467#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,614 INFO L290 TraceCheckUtils]: 287: Hoare triple {25552#(<= ~counter~0 11)} assume !!(#t~post5 < 50);havoc #t~post5; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,614 INFO L272 TraceCheckUtils]: 288: Hoare triple {25552#(<= ~counter~0 11)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,615 INFO L290 TraceCheckUtils]: 289: Hoare triple {25552#(<= ~counter~0 11)} ~cond := #in~cond; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,615 INFO L290 TraceCheckUtils]: 290: Hoare triple {25552#(<= ~counter~0 11)} assume !(0 == ~cond); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,615 INFO L290 TraceCheckUtils]: 291: Hoare triple {25552#(<= ~counter~0 11)} assume true; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,615 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {25552#(<= ~counter~0 11)} {25552#(<= ~counter~0 11)} #59#return; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,616 INFO L272 TraceCheckUtils]: 293: Hoare triple {25552#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,616 INFO L290 TraceCheckUtils]: 294: Hoare triple {25552#(<= ~counter~0 11)} ~cond := #in~cond; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,616 INFO L290 TraceCheckUtils]: 295: Hoare triple {25552#(<= ~counter~0 11)} assume !(0 == ~cond); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,616 INFO L290 TraceCheckUtils]: 296: Hoare triple {25552#(<= ~counter~0 11)} assume true; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,617 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {25552#(<= ~counter~0 11)} {25552#(<= ~counter~0 11)} #61#return; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,617 INFO L272 TraceCheckUtils]: 298: Hoare triple {25552#(<= ~counter~0 11)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,617 INFO L290 TraceCheckUtils]: 299: Hoare triple {25552#(<= ~counter~0 11)} ~cond := #in~cond; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,618 INFO L290 TraceCheckUtils]: 300: Hoare triple {25552#(<= ~counter~0 11)} assume !(0 == ~cond); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,618 INFO L290 TraceCheckUtils]: 301: Hoare triple {25552#(<= ~counter~0 11)} assume true; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,618 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {25552#(<= ~counter~0 11)} {25552#(<= ~counter~0 11)} #63#return; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,618 INFO L272 TraceCheckUtils]: 303: Hoare triple {25552#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,619 INFO L290 TraceCheckUtils]: 304: Hoare triple {25552#(<= ~counter~0 11)} ~cond := #in~cond; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,619 INFO L290 TraceCheckUtils]: 305: Hoare triple {25552#(<= ~counter~0 11)} assume !(0 == ~cond); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,619 INFO L290 TraceCheckUtils]: 306: Hoare triple {25552#(<= ~counter~0 11)} assume true; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,620 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {25552#(<= ~counter~0 11)} {25552#(<= ~counter~0 11)} #65#return; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,620 INFO L272 TraceCheckUtils]: 308: Hoare triple {25552#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,620 INFO L290 TraceCheckUtils]: 309: Hoare triple {25552#(<= ~counter~0 11)} ~cond := #in~cond; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,620 INFO L290 TraceCheckUtils]: 310: Hoare triple {25552#(<= ~counter~0 11)} assume !(0 == ~cond); {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,621 INFO L290 TraceCheckUtils]: 311: Hoare triple {25552#(<= ~counter~0 11)} assume true; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,621 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {25552#(<= ~counter~0 11)} {25552#(<= ~counter~0 11)} #67#return; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,621 INFO L290 TraceCheckUtils]: 313: Hoare triple {25552#(<= ~counter~0 11)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25552#(<= ~counter~0 11)} is VALID [2022-04-27 12:15:32,622 INFO L290 TraceCheckUtils]: 314: Hoare triple {25552#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,622 INFO L290 TraceCheckUtils]: 315: Hoare triple {25637#(<= ~counter~0 12)} assume !!(#t~post5 < 50);havoc #t~post5; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,622 INFO L272 TraceCheckUtils]: 316: Hoare triple {25637#(<= ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,622 INFO L290 TraceCheckUtils]: 317: Hoare triple {25637#(<= ~counter~0 12)} ~cond := #in~cond; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,623 INFO L290 TraceCheckUtils]: 318: Hoare triple {25637#(<= ~counter~0 12)} assume !(0 == ~cond); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,623 INFO L290 TraceCheckUtils]: 319: Hoare triple {25637#(<= ~counter~0 12)} assume true; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,623 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {25637#(<= ~counter~0 12)} {25637#(<= ~counter~0 12)} #59#return; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,623 INFO L272 TraceCheckUtils]: 321: Hoare triple {25637#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,624 INFO L290 TraceCheckUtils]: 322: Hoare triple {25637#(<= ~counter~0 12)} ~cond := #in~cond; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,624 INFO L290 TraceCheckUtils]: 323: Hoare triple {25637#(<= ~counter~0 12)} assume !(0 == ~cond); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,624 INFO L290 TraceCheckUtils]: 324: Hoare triple {25637#(<= ~counter~0 12)} assume true; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,624 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {25637#(<= ~counter~0 12)} {25637#(<= ~counter~0 12)} #61#return; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,625 INFO L272 TraceCheckUtils]: 326: Hoare triple {25637#(<= ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,625 INFO L290 TraceCheckUtils]: 327: Hoare triple {25637#(<= ~counter~0 12)} ~cond := #in~cond; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,625 INFO L290 TraceCheckUtils]: 328: Hoare triple {25637#(<= ~counter~0 12)} assume !(0 == ~cond); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,626 INFO L290 TraceCheckUtils]: 329: Hoare triple {25637#(<= ~counter~0 12)} assume true; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,626 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {25637#(<= ~counter~0 12)} {25637#(<= ~counter~0 12)} #63#return; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,626 INFO L272 TraceCheckUtils]: 331: Hoare triple {25637#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,626 INFO L290 TraceCheckUtils]: 332: Hoare triple {25637#(<= ~counter~0 12)} ~cond := #in~cond; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,627 INFO L290 TraceCheckUtils]: 333: Hoare triple {25637#(<= ~counter~0 12)} assume !(0 == ~cond); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,627 INFO L290 TraceCheckUtils]: 334: Hoare triple {25637#(<= ~counter~0 12)} assume true; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,627 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {25637#(<= ~counter~0 12)} {25637#(<= ~counter~0 12)} #65#return; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,628 INFO L272 TraceCheckUtils]: 336: Hoare triple {25637#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,628 INFO L290 TraceCheckUtils]: 337: Hoare triple {25637#(<= ~counter~0 12)} ~cond := #in~cond; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,628 INFO L290 TraceCheckUtils]: 338: Hoare triple {25637#(<= ~counter~0 12)} assume !(0 == ~cond); {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,628 INFO L290 TraceCheckUtils]: 339: Hoare triple {25637#(<= ~counter~0 12)} assume true; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,629 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {25637#(<= ~counter~0 12)} {25637#(<= ~counter~0 12)} #67#return; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,629 INFO L290 TraceCheckUtils]: 341: Hoare triple {25637#(<= ~counter~0 12)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25637#(<= ~counter~0 12)} is VALID [2022-04-27 12:15:32,629 INFO L290 TraceCheckUtils]: 342: Hoare triple {25637#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,630 INFO L290 TraceCheckUtils]: 343: Hoare triple {25722#(<= ~counter~0 13)} assume !!(#t~post5 < 50);havoc #t~post5; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,630 INFO L272 TraceCheckUtils]: 344: Hoare triple {25722#(<= ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,630 INFO L290 TraceCheckUtils]: 345: Hoare triple {25722#(<= ~counter~0 13)} ~cond := #in~cond; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,630 INFO L290 TraceCheckUtils]: 346: Hoare triple {25722#(<= ~counter~0 13)} assume !(0 == ~cond); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,631 INFO L290 TraceCheckUtils]: 347: Hoare triple {25722#(<= ~counter~0 13)} assume true; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,631 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {25722#(<= ~counter~0 13)} {25722#(<= ~counter~0 13)} #59#return; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,631 INFO L272 TraceCheckUtils]: 349: Hoare triple {25722#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,632 INFO L290 TraceCheckUtils]: 350: Hoare triple {25722#(<= ~counter~0 13)} ~cond := #in~cond; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,632 INFO L290 TraceCheckUtils]: 351: Hoare triple {25722#(<= ~counter~0 13)} assume !(0 == ~cond); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,632 INFO L290 TraceCheckUtils]: 352: Hoare triple {25722#(<= ~counter~0 13)} assume true; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,632 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {25722#(<= ~counter~0 13)} {25722#(<= ~counter~0 13)} #61#return; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,633 INFO L272 TraceCheckUtils]: 354: Hoare triple {25722#(<= ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,633 INFO L290 TraceCheckUtils]: 355: Hoare triple {25722#(<= ~counter~0 13)} ~cond := #in~cond; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,633 INFO L290 TraceCheckUtils]: 356: Hoare triple {25722#(<= ~counter~0 13)} assume !(0 == ~cond); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,633 INFO L290 TraceCheckUtils]: 357: Hoare triple {25722#(<= ~counter~0 13)} assume true; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,634 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {25722#(<= ~counter~0 13)} {25722#(<= ~counter~0 13)} #63#return; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,634 INFO L272 TraceCheckUtils]: 359: Hoare triple {25722#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,634 INFO L290 TraceCheckUtils]: 360: Hoare triple {25722#(<= ~counter~0 13)} ~cond := #in~cond; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,634 INFO L290 TraceCheckUtils]: 361: Hoare triple {25722#(<= ~counter~0 13)} assume !(0 == ~cond); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,635 INFO L290 TraceCheckUtils]: 362: Hoare triple {25722#(<= ~counter~0 13)} assume true; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,635 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {25722#(<= ~counter~0 13)} {25722#(<= ~counter~0 13)} #65#return; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,635 INFO L272 TraceCheckUtils]: 364: Hoare triple {25722#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,636 INFO L290 TraceCheckUtils]: 365: Hoare triple {25722#(<= ~counter~0 13)} ~cond := #in~cond; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,636 INFO L290 TraceCheckUtils]: 366: Hoare triple {25722#(<= ~counter~0 13)} assume !(0 == ~cond); {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,636 INFO L290 TraceCheckUtils]: 367: Hoare triple {25722#(<= ~counter~0 13)} assume true; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,636 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {25722#(<= ~counter~0 13)} {25722#(<= ~counter~0 13)} #67#return; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,637 INFO L290 TraceCheckUtils]: 369: Hoare triple {25722#(<= ~counter~0 13)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25722#(<= ~counter~0 13)} is VALID [2022-04-27 12:15:32,637 INFO L290 TraceCheckUtils]: 370: Hoare triple {25722#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,637 INFO L290 TraceCheckUtils]: 371: Hoare triple {25807#(<= ~counter~0 14)} assume !!(#t~post5 < 50);havoc #t~post5; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,638 INFO L272 TraceCheckUtils]: 372: Hoare triple {25807#(<= ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,638 INFO L290 TraceCheckUtils]: 373: Hoare triple {25807#(<= ~counter~0 14)} ~cond := #in~cond; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,638 INFO L290 TraceCheckUtils]: 374: Hoare triple {25807#(<= ~counter~0 14)} assume !(0 == ~cond); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,638 INFO L290 TraceCheckUtils]: 375: Hoare triple {25807#(<= ~counter~0 14)} assume true; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,639 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {25807#(<= ~counter~0 14)} {25807#(<= ~counter~0 14)} #59#return; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,639 INFO L272 TraceCheckUtils]: 377: Hoare triple {25807#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,639 INFO L290 TraceCheckUtils]: 378: Hoare triple {25807#(<= ~counter~0 14)} ~cond := #in~cond; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,639 INFO L290 TraceCheckUtils]: 379: Hoare triple {25807#(<= ~counter~0 14)} assume !(0 == ~cond); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,640 INFO L290 TraceCheckUtils]: 380: Hoare triple {25807#(<= ~counter~0 14)} assume true; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,640 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {25807#(<= ~counter~0 14)} {25807#(<= ~counter~0 14)} #61#return; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,640 INFO L272 TraceCheckUtils]: 382: Hoare triple {25807#(<= ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,641 INFO L290 TraceCheckUtils]: 383: Hoare triple {25807#(<= ~counter~0 14)} ~cond := #in~cond; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,641 INFO L290 TraceCheckUtils]: 384: Hoare triple {25807#(<= ~counter~0 14)} assume !(0 == ~cond); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,641 INFO L290 TraceCheckUtils]: 385: Hoare triple {25807#(<= ~counter~0 14)} assume true; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,641 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {25807#(<= ~counter~0 14)} {25807#(<= ~counter~0 14)} #63#return; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,642 INFO L272 TraceCheckUtils]: 387: Hoare triple {25807#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,642 INFO L290 TraceCheckUtils]: 388: Hoare triple {25807#(<= ~counter~0 14)} ~cond := #in~cond; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,642 INFO L290 TraceCheckUtils]: 389: Hoare triple {25807#(<= ~counter~0 14)} assume !(0 == ~cond); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,642 INFO L290 TraceCheckUtils]: 390: Hoare triple {25807#(<= ~counter~0 14)} assume true; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,643 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {25807#(<= ~counter~0 14)} {25807#(<= ~counter~0 14)} #65#return; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,643 INFO L272 TraceCheckUtils]: 392: Hoare triple {25807#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,643 INFO L290 TraceCheckUtils]: 393: Hoare triple {25807#(<= ~counter~0 14)} ~cond := #in~cond; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,643 INFO L290 TraceCheckUtils]: 394: Hoare triple {25807#(<= ~counter~0 14)} assume !(0 == ~cond); {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,644 INFO L290 TraceCheckUtils]: 395: Hoare triple {25807#(<= ~counter~0 14)} assume true; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,644 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {25807#(<= ~counter~0 14)} {25807#(<= ~counter~0 14)} #67#return; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,644 INFO L290 TraceCheckUtils]: 397: Hoare triple {25807#(<= ~counter~0 14)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25807#(<= ~counter~0 14)} is VALID [2022-04-27 12:15:32,645 INFO L290 TraceCheckUtils]: 398: Hoare triple {25807#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,645 INFO L290 TraceCheckUtils]: 399: Hoare triple {25892#(<= ~counter~0 15)} assume !!(#t~post5 < 50);havoc #t~post5; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,645 INFO L272 TraceCheckUtils]: 400: Hoare triple {25892#(<= ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,645 INFO L290 TraceCheckUtils]: 401: Hoare triple {25892#(<= ~counter~0 15)} ~cond := #in~cond; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,646 INFO L290 TraceCheckUtils]: 402: Hoare triple {25892#(<= ~counter~0 15)} assume !(0 == ~cond); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,646 INFO L290 TraceCheckUtils]: 403: Hoare triple {25892#(<= ~counter~0 15)} assume true; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,646 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {25892#(<= ~counter~0 15)} {25892#(<= ~counter~0 15)} #59#return; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,647 INFO L272 TraceCheckUtils]: 405: Hoare triple {25892#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,647 INFO L290 TraceCheckUtils]: 406: Hoare triple {25892#(<= ~counter~0 15)} ~cond := #in~cond; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,647 INFO L290 TraceCheckUtils]: 407: Hoare triple {25892#(<= ~counter~0 15)} assume !(0 == ~cond); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,647 INFO L290 TraceCheckUtils]: 408: Hoare triple {25892#(<= ~counter~0 15)} assume true; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,648 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {25892#(<= ~counter~0 15)} {25892#(<= ~counter~0 15)} #61#return; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,648 INFO L272 TraceCheckUtils]: 410: Hoare triple {25892#(<= ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,648 INFO L290 TraceCheckUtils]: 411: Hoare triple {25892#(<= ~counter~0 15)} ~cond := #in~cond; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,648 INFO L290 TraceCheckUtils]: 412: Hoare triple {25892#(<= ~counter~0 15)} assume !(0 == ~cond); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,649 INFO L290 TraceCheckUtils]: 413: Hoare triple {25892#(<= ~counter~0 15)} assume true; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,649 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {25892#(<= ~counter~0 15)} {25892#(<= ~counter~0 15)} #63#return; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,649 INFO L272 TraceCheckUtils]: 415: Hoare triple {25892#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,650 INFO L290 TraceCheckUtils]: 416: Hoare triple {25892#(<= ~counter~0 15)} ~cond := #in~cond; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,650 INFO L290 TraceCheckUtils]: 417: Hoare triple {25892#(<= ~counter~0 15)} assume !(0 == ~cond); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,650 INFO L290 TraceCheckUtils]: 418: Hoare triple {25892#(<= ~counter~0 15)} assume true; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,650 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {25892#(<= ~counter~0 15)} {25892#(<= ~counter~0 15)} #65#return; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,651 INFO L272 TraceCheckUtils]: 420: Hoare triple {25892#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,651 INFO L290 TraceCheckUtils]: 421: Hoare triple {25892#(<= ~counter~0 15)} ~cond := #in~cond; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,651 INFO L290 TraceCheckUtils]: 422: Hoare triple {25892#(<= ~counter~0 15)} assume !(0 == ~cond); {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,651 INFO L290 TraceCheckUtils]: 423: Hoare triple {25892#(<= ~counter~0 15)} assume true; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,652 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {25892#(<= ~counter~0 15)} {25892#(<= ~counter~0 15)} #67#return; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,652 INFO L290 TraceCheckUtils]: 425: Hoare triple {25892#(<= ~counter~0 15)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25892#(<= ~counter~0 15)} is VALID [2022-04-27 12:15:32,652 INFO L290 TraceCheckUtils]: 426: Hoare triple {25892#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,653 INFO L290 TraceCheckUtils]: 427: Hoare triple {25977#(<= ~counter~0 16)} assume !!(#t~post5 < 50);havoc #t~post5; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,653 INFO L272 TraceCheckUtils]: 428: Hoare triple {25977#(<= ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,653 INFO L290 TraceCheckUtils]: 429: Hoare triple {25977#(<= ~counter~0 16)} ~cond := #in~cond; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,653 INFO L290 TraceCheckUtils]: 430: Hoare triple {25977#(<= ~counter~0 16)} assume !(0 == ~cond); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,654 INFO L290 TraceCheckUtils]: 431: Hoare triple {25977#(<= ~counter~0 16)} assume true; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,654 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {25977#(<= ~counter~0 16)} {25977#(<= ~counter~0 16)} #59#return; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,654 INFO L272 TraceCheckUtils]: 433: Hoare triple {25977#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,655 INFO L290 TraceCheckUtils]: 434: Hoare triple {25977#(<= ~counter~0 16)} ~cond := #in~cond; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,655 INFO L290 TraceCheckUtils]: 435: Hoare triple {25977#(<= ~counter~0 16)} assume !(0 == ~cond); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,655 INFO L290 TraceCheckUtils]: 436: Hoare triple {25977#(<= ~counter~0 16)} assume true; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,655 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {25977#(<= ~counter~0 16)} {25977#(<= ~counter~0 16)} #61#return; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,656 INFO L272 TraceCheckUtils]: 438: Hoare triple {25977#(<= ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,656 INFO L290 TraceCheckUtils]: 439: Hoare triple {25977#(<= ~counter~0 16)} ~cond := #in~cond; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,656 INFO L290 TraceCheckUtils]: 440: Hoare triple {25977#(<= ~counter~0 16)} assume !(0 == ~cond); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,656 INFO L290 TraceCheckUtils]: 441: Hoare triple {25977#(<= ~counter~0 16)} assume true; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,657 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {25977#(<= ~counter~0 16)} {25977#(<= ~counter~0 16)} #63#return; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,657 INFO L272 TraceCheckUtils]: 443: Hoare triple {25977#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,657 INFO L290 TraceCheckUtils]: 444: Hoare triple {25977#(<= ~counter~0 16)} ~cond := #in~cond; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,657 INFO L290 TraceCheckUtils]: 445: Hoare triple {25977#(<= ~counter~0 16)} assume !(0 == ~cond); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,658 INFO L290 TraceCheckUtils]: 446: Hoare triple {25977#(<= ~counter~0 16)} assume true; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,658 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {25977#(<= ~counter~0 16)} {25977#(<= ~counter~0 16)} #65#return; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,658 INFO L272 TraceCheckUtils]: 448: Hoare triple {25977#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,659 INFO L290 TraceCheckUtils]: 449: Hoare triple {25977#(<= ~counter~0 16)} ~cond := #in~cond; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,659 INFO L290 TraceCheckUtils]: 450: Hoare triple {25977#(<= ~counter~0 16)} assume !(0 == ~cond); {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,659 INFO L290 TraceCheckUtils]: 451: Hoare triple {25977#(<= ~counter~0 16)} assume true; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,659 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {25977#(<= ~counter~0 16)} {25977#(<= ~counter~0 16)} #67#return; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,660 INFO L290 TraceCheckUtils]: 453: Hoare triple {25977#(<= ~counter~0 16)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {25977#(<= ~counter~0 16)} is VALID [2022-04-27 12:15:32,660 INFO L290 TraceCheckUtils]: 454: Hoare triple {25977#(<= ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,660 INFO L290 TraceCheckUtils]: 455: Hoare triple {26062#(<= ~counter~0 17)} assume !!(#t~post5 < 50);havoc #t~post5; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,661 INFO L272 TraceCheckUtils]: 456: Hoare triple {26062#(<= ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,661 INFO L290 TraceCheckUtils]: 457: Hoare triple {26062#(<= ~counter~0 17)} ~cond := #in~cond; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,661 INFO L290 TraceCheckUtils]: 458: Hoare triple {26062#(<= ~counter~0 17)} assume !(0 == ~cond); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,661 INFO L290 TraceCheckUtils]: 459: Hoare triple {26062#(<= ~counter~0 17)} assume true; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,662 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {26062#(<= ~counter~0 17)} {26062#(<= ~counter~0 17)} #59#return; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,662 INFO L272 TraceCheckUtils]: 461: Hoare triple {26062#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,662 INFO L290 TraceCheckUtils]: 462: Hoare triple {26062#(<= ~counter~0 17)} ~cond := #in~cond; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,662 INFO L290 TraceCheckUtils]: 463: Hoare triple {26062#(<= ~counter~0 17)} assume !(0 == ~cond); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,663 INFO L290 TraceCheckUtils]: 464: Hoare triple {26062#(<= ~counter~0 17)} assume true; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,663 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {26062#(<= ~counter~0 17)} {26062#(<= ~counter~0 17)} #61#return; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,663 INFO L272 TraceCheckUtils]: 466: Hoare triple {26062#(<= ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,664 INFO L290 TraceCheckUtils]: 467: Hoare triple {26062#(<= ~counter~0 17)} ~cond := #in~cond; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,664 INFO L290 TraceCheckUtils]: 468: Hoare triple {26062#(<= ~counter~0 17)} assume !(0 == ~cond); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,664 INFO L290 TraceCheckUtils]: 469: Hoare triple {26062#(<= ~counter~0 17)} assume true; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,664 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {26062#(<= ~counter~0 17)} {26062#(<= ~counter~0 17)} #63#return; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,665 INFO L272 TraceCheckUtils]: 471: Hoare triple {26062#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,665 INFO L290 TraceCheckUtils]: 472: Hoare triple {26062#(<= ~counter~0 17)} ~cond := #in~cond; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,665 INFO L290 TraceCheckUtils]: 473: Hoare triple {26062#(<= ~counter~0 17)} assume !(0 == ~cond); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,665 INFO L290 TraceCheckUtils]: 474: Hoare triple {26062#(<= ~counter~0 17)} assume true; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,666 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {26062#(<= ~counter~0 17)} {26062#(<= ~counter~0 17)} #65#return; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,666 INFO L272 TraceCheckUtils]: 476: Hoare triple {26062#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,666 INFO L290 TraceCheckUtils]: 477: Hoare triple {26062#(<= ~counter~0 17)} ~cond := #in~cond; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,666 INFO L290 TraceCheckUtils]: 478: Hoare triple {26062#(<= ~counter~0 17)} assume !(0 == ~cond); {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,667 INFO L290 TraceCheckUtils]: 479: Hoare triple {26062#(<= ~counter~0 17)} assume true; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,667 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {26062#(<= ~counter~0 17)} {26062#(<= ~counter~0 17)} #67#return; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,667 INFO L290 TraceCheckUtils]: 481: Hoare triple {26062#(<= ~counter~0 17)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26062#(<= ~counter~0 17)} is VALID [2022-04-27 12:15:32,668 INFO L290 TraceCheckUtils]: 482: Hoare triple {26062#(<= ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,668 INFO L290 TraceCheckUtils]: 483: Hoare triple {26147#(<= ~counter~0 18)} assume !!(#t~post5 < 50);havoc #t~post5; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,668 INFO L272 TraceCheckUtils]: 484: Hoare triple {26147#(<= ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,668 INFO L290 TraceCheckUtils]: 485: Hoare triple {26147#(<= ~counter~0 18)} ~cond := #in~cond; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,669 INFO L290 TraceCheckUtils]: 486: Hoare triple {26147#(<= ~counter~0 18)} assume !(0 == ~cond); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,669 INFO L290 TraceCheckUtils]: 487: Hoare triple {26147#(<= ~counter~0 18)} assume true; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,669 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {26147#(<= ~counter~0 18)} {26147#(<= ~counter~0 18)} #59#return; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,670 INFO L272 TraceCheckUtils]: 489: Hoare triple {26147#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,670 INFO L290 TraceCheckUtils]: 490: Hoare triple {26147#(<= ~counter~0 18)} ~cond := #in~cond; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,670 INFO L290 TraceCheckUtils]: 491: Hoare triple {26147#(<= ~counter~0 18)} assume !(0 == ~cond); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,670 INFO L290 TraceCheckUtils]: 492: Hoare triple {26147#(<= ~counter~0 18)} assume true; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,671 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {26147#(<= ~counter~0 18)} {26147#(<= ~counter~0 18)} #61#return; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,671 INFO L272 TraceCheckUtils]: 494: Hoare triple {26147#(<= ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,671 INFO L290 TraceCheckUtils]: 495: Hoare triple {26147#(<= ~counter~0 18)} ~cond := #in~cond; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,671 INFO L290 TraceCheckUtils]: 496: Hoare triple {26147#(<= ~counter~0 18)} assume !(0 == ~cond); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,672 INFO L290 TraceCheckUtils]: 497: Hoare triple {26147#(<= ~counter~0 18)} assume true; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,672 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {26147#(<= ~counter~0 18)} {26147#(<= ~counter~0 18)} #63#return; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,672 INFO L272 TraceCheckUtils]: 499: Hoare triple {26147#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,672 INFO L290 TraceCheckUtils]: 500: Hoare triple {26147#(<= ~counter~0 18)} ~cond := #in~cond; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,673 INFO L290 TraceCheckUtils]: 501: Hoare triple {26147#(<= ~counter~0 18)} assume !(0 == ~cond); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,673 INFO L290 TraceCheckUtils]: 502: Hoare triple {26147#(<= ~counter~0 18)} assume true; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,673 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {26147#(<= ~counter~0 18)} {26147#(<= ~counter~0 18)} #65#return; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,674 INFO L272 TraceCheckUtils]: 504: Hoare triple {26147#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,674 INFO L290 TraceCheckUtils]: 505: Hoare triple {26147#(<= ~counter~0 18)} ~cond := #in~cond; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,674 INFO L290 TraceCheckUtils]: 506: Hoare triple {26147#(<= ~counter~0 18)} assume !(0 == ~cond); {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,674 INFO L290 TraceCheckUtils]: 507: Hoare triple {26147#(<= ~counter~0 18)} assume true; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,675 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {26147#(<= ~counter~0 18)} {26147#(<= ~counter~0 18)} #67#return; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,675 INFO L290 TraceCheckUtils]: 509: Hoare triple {26147#(<= ~counter~0 18)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26147#(<= ~counter~0 18)} is VALID [2022-04-27 12:15:32,675 INFO L290 TraceCheckUtils]: 510: Hoare triple {26147#(<= ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,676 INFO L290 TraceCheckUtils]: 511: Hoare triple {26232#(<= ~counter~0 19)} assume !!(#t~post5 < 50);havoc #t~post5; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,676 INFO L272 TraceCheckUtils]: 512: Hoare triple {26232#(<= ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,676 INFO L290 TraceCheckUtils]: 513: Hoare triple {26232#(<= ~counter~0 19)} ~cond := #in~cond; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,676 INFO L290 TraceCheckUtils]: 514: Hoare triple {26232#(<= ~counter~0 19)} assume !(0 == ~cond); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,676 INFO L290 TraceCheckUtils]: 515: Hoare triple {26232#(<= ~counter~0 19)} assume true; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,677 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {26232#(<= ~counter~0 19)} {26232#(<= ~counter~0 19)} #59#return; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,677 INFO L272 TraceCheckUtils]: 517: Hoare triple {26232#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,677 INFO L290 TraceCheckUtils]: 518: Hoare triple {26232#(<= ~counter~0 19)} ~cond := #in~cond; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,678 INFO L290 TraceCheckUtils]: 519: Hoare triple {26232#(<= ~counter~0 19)} assume !(0 == ~cond); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,678 INFO L290 TraceCheckUtils]: 520: Hoare triple {26232#(<= ~counter~0 19)} assume true; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,678 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {26232#(<= ~counter~0 19)} {26232#(<= ~counter~0 19)} #61#return; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,679 INFO L272 TraceCheckUtils]: 522: Hoare triple {26232#(<= ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,679 INFO L290 TraceCheckUtils]: 523: Hoare triple {26232#(<= ~counter~0 19)} ~cond := #in~cond; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,679 INFO L290 TraceCheckUtils]: 524: Hoare triple {26232#(<= ~counter~0 19)} assume !(0 == ~cond); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,679 INFO L290 TraceCheckUtils]: 525: Hoare triple {26232#(<= ~counter~0 19)} assume true; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,680 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {26232#(<= ~counter~0 19)} {26232#(<= ~counter~0 19)} #63#return; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,680 INFO L272 TraceCheckUtils]: 527: Hoare triple {26232#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,680 INFO L290 TraceCheckUtils]: 528: Hoare triple {26232#(<= ~counter~0 19)} ~cond := #in~cond; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,680 INFO L290 TraceCheckUtils]: 529: Hoare triple {26232#(<= ~counter~0 19)} assume !(0 == ~cond); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,681 INFO L290 TraceCheckUtils]: 530: Hoare triple {26232#(<= ~counter~0 19)} assume true; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,681 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {26232#(<= ~counter~0 19)} {26232#(<= ~counter~0 19)} #65#return; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,681 INFO L272 TraceCheckUtils]: 532: Hoare triple {26232#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,682 INFO L290 TraceCheckUtils]: 533: Hoare triple {26232#(<= ~counter~0 19)} ~cond := #in~cond; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,682 INFO L290 TraceCheckUtils]: 534: Hoare triple {26232#(<= ~counter~0 19)} assume !(0 == ~cond); {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,682 INFO L290 TraceCheckUtils]: 535: Hoare triple {26232#(<= ~counter~0 19)} assume true; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,682 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {26232#(<= ~counter~0 19)} {26232#(<= ~counter~0 19)} #67#return; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,683 INFO L290 TraceCheckUtils]: 537: Hoare triple {26232#(<= ~counter~0 19)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26232#(<= ~counter~0 19)} is VALID [2022-04-27 12:15:32,683 INFO L290 TraceCheckUtils]: 538: Hoare triple {26232#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,683 INFO L290 TraceCheckUtils]: 539: Hoare triple {26317#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,684 INFO L272 TraceCheckUtils]: 540: Hoare triple {26317#(<= ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,684 INFO L290 TraceCheckUtils]: 541: Hoare triple {26317#(<= ~counter~0 20)} ~cond := #in~cond; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,684 INFO L290 TraceCheckUtils]: 542: Hoare triple {26317#(<= ~counter~0 20)} assume !(0 == ~cond); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,684 INFO L290 TraceCheckUtils]: 543: Hoare triple {26317#(<= ~counter~0 20)} assume true; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,685 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {26317#(<= ~counter~0 20)} {26317#(<= ~counter~0 20)} #59#return; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,685 INFO L272 TraceCheckUtils]: 545: Hoare triple {26317#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,685 INFO L290 TraceCheckUtils]: 546: Hoare triple {26317#(<= ~counter~0 20)} ~cond := #in~cond; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,685 INFO L290 TraceCheckUtils]: 547: Hoare triple {26317#(<= ~counter~0 20)} assume !(0 == ~cond); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,686 INFO L290 TraceCheckUtils]: 548: Hoare triple {26317#(<= ~counter~0 20)} assume true; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,686 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {26317#(<= ~counter~0 20)} {26317#(<= ~counter~0 20)} #61#return; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,686 INFO L272 TraceCheckUtils]: 550: Hoare triple {26317#(<= ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,686 INFO L290 TraceCheckUtils]: 551: Hoare triple {26317#(<= ~counter~0 20)} ~cond := #in~cond; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,687 INFO L290 TraceCheckUtils]: 552: Hoare triple {26317#(<= ~counter~0 20)} assume !(0 == ~cond); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,687 INFO L290 TraceCheckUtils]: 553: Hoare triple {26317#(<= ~counter~0 20)} assume true; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,687 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {26317#(<= ~counter~0 20)} {26317#(<= ~counter~0 20)} #63#return; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,688 INFO L272 TraceCheckUtils]: 555: Hoare triple {26317#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,688 INFO L290 TraceCheckUtils]: 556: Hoare triple {26317#(<= ~counter~0 20)} ~cond := #in~cond; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,688 INFO L290 TraceCheckUtils]: 557: Hoare triple {26317#(<= ~counter~0 20)} assume !(0 == ~cond); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,688 INFO L290 TraceCheckUtils]: 558: Hoare triple {26317#(<= ~counter~0 20)} assume true; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,689 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {26317#(<= ~counter~0 20)} {26317#(<= ~counter~0 20)} #65#return; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,689 INFO L272 TraceCheckUtils]: 560: Hoare triple {26317#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,689 INFO L290 TraceCheckUtils]: 561: Hoare triple {26317#(<= ~counter~0 20)} ~cond := #in~cond; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,689 INFO L290 TraceCheckUtils]: 562: Hoare triple {26317#(<= ~counter~0 20)} assume !(0 == ~cond); {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,690 INFO L290 TraceCheckUtils]: 563: Hoare triple {26317#(<= ~counter~0 20)} assume true; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,690 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {26317#(<= ~counter~0 20)} {26317#(<= ~counter~0 20)} #67#return; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,690 INFO L290 TraceCheckUtils]: 565: Hoare triple {26317#(<= ~counter~0 20)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26317#(<= ~counter~0 20)} is VALID [2022-04-27 12:15:32,691 INFO L290 TraceCheckUtils]: 566: Hoare triple {26317#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,691 INFO L290 TraceCheckUtils]: 567: Hoare triple {26402#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,691 INFO L272 TraceCheckUtils]: 568: Hoare triple {26402#(<= ~counter~0 21)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,700 INFO L290 TraceCheckUtils]: 569: Hoare triple {26402#(<= ~counter~0 21)} ~cond := #in~cond; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,700 INFO L290 TraceCheckUtils]: 570: Hoare triple {26402#(<= ~counter~0 21)} assume !(0 == ~cond); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,700 INFO L290 TraceCheckUtils]: 571: Hoare triple {26402#(<= ~counter~0 21)} assume true; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,700 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {26402#(<= ~counter~0 21)} {26402#(<= ~counter~0 21)} #59#return; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,701 INFO L272 TraceCheckUtils]: 573: Hoare triple {26402#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,701 INFO L290 TraceCheckUtils]: 574: Hoare triple {26402#(<= ~counter~0 21)} ~cond := #in~cond; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,701 INFO L290 TraceCheckUtils]: 575: Hoare triple {26402#(<= ~counter~0 21)} assume !(0 == ~cond); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,702 INFO L290 TraceCheckUtils]: 576: Hoare triple {26402#(<= ~counter~0 21)} assume true; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,702 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {26402#(<= ~counter~0 21)} {26402#(<= ~counter~0 21)} #61#return; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,702 INFO L272 TraceCheckUtils]: 578: Hoare triple {26402#(<= ~counter~0 21)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,702 INFO L290 TraceCheckUtils]: 579: Hoare triple {26402#(<= ~counter~0 21)} ~cond := #in~cond; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,703 INFO L290 TraceCheckUtils]: 580: Hoare triple {26402#(<= ~counter~0 21)} assume !(0 == ~cond); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,703 INFO L290 TraceCheckUtils]: 581: Hoare triple {26402#(<= ~counter~0 21)} assume true; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,703 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {26402#(<= ~counter~0 21)} {26402#(<= ~counter~0 21)} #63#return; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,704 INFO L272 TraceCheckUtils]: 583: Hoare triple {26402#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,704 INFO L290 TraceCheckUtils]: 584: Hoare triple {26402#(<= ~counter~0 21)} ~cond := #in~cond; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,704 INFO L290 TraceCheckUtils]: 585: Hoare triple {26402#(<= ~counter~0 21)} assume !(0 == ~cond); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,704 INFO L290 TraceCheckUtils]: 586: Hoare triple {26402#(<= ~counter~0 21)} assume true; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,705 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {26402#(<= ~counter~0 21)} {26402#(<= ~counter~0 21)} #65#return; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,705 INFO L272 TraceCheckUtils]: 588: Hoare triple {26402#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,705 INFO L290 TraceCheckUtils]: 589: Hoare triple {26402#(<= ~counter~0 21)} ~cond := #in~cond; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,706 INFO L290 TraceCheckUtils]: 590: Hoare triple {26402#(<= ~counter~0 21)} assume !(0 == ~cond); {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,706 INFO L290 TraceCheckUtils]: 591: Hoare triple {26402#(<= ~counter~0 21)} assume true; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,706 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {26402#(<= ~counter~0 21)} {26402#(<= ~counter~0 21)} #67#return; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,706 INFO L290 TraceCheckUtils]: 593: Hoare triple {26402#(<= ~counter~0 21)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26402#(<= ~counter~0 21)} is VALID [2022-04-27 12:15:32,707 INFO L290 TraceCheckUtils]: 594: Hoare triple {26402#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,707 INFO L290 TraceCheckUtils]: 595: Hoare triple {26487#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,707 INFO L272 TraceCheckUtils]: 596: Hoare triple {26487#(<= ~counter~0 22)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,708 INFO L290 TraceCheckUtils]: 597: Hoare triple {26487#(<= ~counter~0 22)} ~cond := #in~cond; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,708 INFO L290 TraceCheckUtils]: 598: Hoare triple {26487#(<= ~counter~0 22)} assume !(0 == ~cond); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,708 INFO L290 TraceCheckUtils]: 599: Hoare triple {26487#(<= ~counter~0 22)} assume true; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,708 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {26487#(<= ~counter~0 22)} {26487#(<= ~counter~0 22)} #59#return; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,709 INFO L272 TraceCheckUtils]: 601: Hoare triple {26487#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,709 INFO L290 TraceCheckUtils]: 602: Hoare triple {26487#(<= ~counter~0 22)} ~cond := #in~cond; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,709 INFO L290 TraceCheckUtils]: 603: Hoare triple {26487#(<= ~counter~0 22)} assume !(0 == ~cond); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,709 INFO L290 TraceCheckUtils]: 604: Hoare triple {26487#(<= ~counter~0 22)} assume true; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,710 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {26487#(<= ~counter~0 22)} {26487#(<= ~counter~0 22)} #61#return; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,710 INFO L272 TraceCheckUtils]: 606: Hoare triple {26487#(<= ~counter~0 22)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,710 INFO L290 TraceCheckUtils]: 607: Hoare triple {26487#(<= ~counter~0 22)} ~cond := #in~cond; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,711 INFO L290 TraceCheckUtils]: 608: Hoare triple {26487#(<= ~counter~0 22)} assume !(0 == ~cond); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,711 INFO L290 TraceCheckUtils]: 609: Hoare triple {26487#(<= ~counter~0 22)} assume true; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,711 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {26487#(<= ~counter~0 22)} {26487#(<= ~counter~0 22)} #63#return; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,712 INFO L272 TraceCheckUtils]: 611: Hoare triple {26487#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,712 INFO L290 TraceCheckUtils]: 612: Hoare triple {26487#(<= ~counter~0 22)} ~cond := #in~cond; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,712 INFO L290 TraceCheckUtils]: 613: Hoare triple {26487#(<= ~counter~0 22)} assume !(0 == ~cond); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,712 INFO L290 TraceCheckUtils]: 614: Hoare triple {26487#(<= ~counter~0 22)} assume true; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,713 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {26487#(<= ~counter~0 22)} {26487#(<= ~counter~0 22)} #65#return; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,713 INFO L272 TraceCheckUtils]: 616: Hoare triple {26487#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,713 INFO L290 TraceCheckUtils]: 617: Hoare triple {26487#(<= ~counter~0 22)} ~cond := #in~cond; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,713 INFO L290 TraceCheckUtils]: 618: Hoare triple {26487#(<= ~counter~0 22)} assume !(0 == ~cond); {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,714 INFO L290 TraceCheckUtils]: 619: Hoare triple {26487#(<= ~counter~0 22)} assume true; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,714 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {26487#(<= ~counter~0 22)} {26487#(<= ~counter~0 22)} #67#return; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,714 INFO L290 TraceCheckUtils]: 621: Hoare triple {26487#(<= ~counter~0 22)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26487#(<= ~counter~0 22)} is VALID [2022-04-27 12:15:32,715 INFO L290 TraceCheckUtils]: 622: Hoare triple {26487#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26572#(<= |main_#t~post5| 22)} is VALID [2022-04-27 12:15:32,715 INFO L290 TraceCheckUtils]: 623: Hoare triple {26572#(<= |main_#t~post5| 22)} assume !(#t~post5 < 50);havoc #t~post5; {24679#false} is VALID [2022-04-27 12:15:32,715 INFO L272 TraceCheckUtils]: 624: Hoare triple {24679#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24679#false} is VALID [2022-04-27 12:15:32,715 INFO L290 TraceCheckUtils]: 625: Hoare triple {24679#false} ~cond := #in~cond; {24679#false} is VALID [2022-04-27 12:15:32,715 INFO L290 TraceCheckUtils]: 626: Hoare triple {24679#false} assume !(0 == ~cond); {24679#false} is VALID [2022-04-27 12:15:32,715 INFO L290 TraceCheckUtils]: 627: Hoare triple {24679#false} assume true; {24679#false} is VALID [2022-04-27 12:15:32,715 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {24679#false} {24679#false} #69#return; {24679#false} is VALID [2022-04-27 12:15:32,715 INFO L272 TraceCheckUtils]: 629: Hoare triple {24679#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {24679#false} is VALID [2022-04-27 12:15:32,715 INFO L290 TraceCheckUtils]: 630: Hoare triple {24679#false} ~cond := #in~cond; {24679#false} is VALID [2022-04-27 12:15:32,715 INFO L290 TraceCheckUtils]: 631: Hoare triple {24679#false} assume 0 == ~cond; {24679#false} is VALID [2022-04-27 12:15:32,715 INFO L290 TraceCheckUtils]: 632: Hoare triple {24679#false} assume !false; {24679#false} is VALID [2022-04-27 12:15:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 660 proven. 24992 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2022-04-27 12:15:32,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:15:35,032 INFO L290 TraceCheckUtils]: 632: Hoare triple {24679#false} assume !false; {24679#false} is VALID [2022-04-27 12:15:35,032 INFO L290 TraceCheckUtils]: 631: Hoare triple {24679#false} assume 0 == ~cond; {24679#false} is VALID [2022-04-27 12:15:35,032 INFO L290 TraceCheckUtils]: 630: Hoare triple {24679#false} ~cond := #in~cond; {24679#false} is VALID [2022-04-27 12:15:35,032 INFO L272 TraceCheckUtils]: 629: Hoare triple {24679#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {24679#false} is VALID [2022-04-27 12:15:35,032 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {24678#true} {24679#false} #69#return; {24679#false} is VALID [2022-04-27 12:15:35,032 INFO L290 TraceCheckUtils]: 627: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,032 INFO L290 TraceCheckUtils]: 626: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,032 INFO L290 TraceCheckUtils]: 625: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,032 INFO L272 TraceCheckUtils]: 624: Hoare triple {24679#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,033 INFO L290 TraceCheckUtils]: 623: Hoare triple {26630#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {24679#false} is VALID [2022-04-27 12:15:35,033 INFO L290 TraceCheckUtils]: 622: Hoare triple {26634#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26630#(< |main_#t~post5| 50)} is VALID [2022-04-27 12:15:35,033 INFO L290 TraceCheckUtils]: 621: Hoare triple {26634#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26634#(< ~counter~0 50)} is VALID [2022-04-27 12:15:35,033 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {24678#true} {26634#(< ~counter~0 50)} #67#return; {26634#(< ~counter~0 50)} is VALID [2022-04-27 12:15:35,033 INFO L290 TraceCheckUtils]: 619: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,033 INFO L290 TraceCheckUtils]: 618: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,033 INFO L290 TraceCheckUtils]: 617: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,033 INFO L272 TraceCheckUtils]: 616: Hoare triple {26634#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,034 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {24678#true} {26634#(< ~counter~0 50)} #65#return; {26634#(< ~counter~0 50)} is VALID [2022-04-27 12:15:35,034 INFO L290 TraceCheckUtils]: 614: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,034 INFO L290 TraceCheckUtils]: 613: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,034 INFO L290 TraceCheckUtils]: 612: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,034 INFO L272 TraceCheckUtils]: 611: Hoare triple {26634#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,034 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {24678#true} {26634#(< ~counter~0 50)} #63#return; {26634#(< ~counter~0 50)} is VALID [2022-04-27 12:15:35,034 INFO L290 TraceCheckUtils]: 609: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,034 INFO L290 TraceCheckUtils]: 608: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,034 INFO L290 TraceCheckUtils]: 607: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,034 INFO L272 TraceCheckUtils]: 606: Hoare triple {26634#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,035 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {24678#true} {26634#(< ~counter~0 50)} #61#return; {26634#(< ~counter~0 50)} is VALID [2022-04-27 12:15:35,035 INFO L290 TraceCheckUtils]: 604: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,035 INFO L290 TraceCheckUtils]: 603: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,035 INFO L290 TraceCheckUtils]: 602: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,035 INFO L272 TraceCheckUtils]: 601: Hoare triple {26634#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,035 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {24678#true} {26634#(< ~counter~0 50)} #59#return; {26634#(< ~counter~0 50)} is VALID [2022-04-27 12:15:35,035 INFO L290 TraceCheckUtils]: 599: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,035 INFO L290 TraceCheckUtils]: 598: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,035 INFO L290 TraceCheckUtils]: 597: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,035 INFO L272 TraceCheckUtils]: 596: Hoare triple {26634#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,036 INFO L290 TraceCheckUtils]: 595: Hoare triple {26634#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {26634#(< ~counter~0 50)} is VALID [2022-04-27 12:15:35,036 INFO L290 TraceCheckUtils]: 594: Hoare triple {26719#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26634#(< ~counter~0 50)} is VALID [2022-04-27 12:15:35,036 INFO L290 TraceCheckUtils]: 593: Hoare triple {26719#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26719#(< ~counter~0 49)} is VALID [2022-04-27 12:15:35,037 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {24678#true} {26719#(< ~counter~0 49)} #67#return; {26719#(< ~counter~0 49)} is VALID [2022-04-27 12:15:35,037 INFO L290 TraceCheckUtils]: 591: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,037 INFO L290 TraceCheckUtils]: 590: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,037 INFO L290 TraceCheckUtils]: 589: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,037 INFO L272 TraceCheckUtils]: 588: Hoare triple {26719#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,037 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {24678#true} {26719#(< ~counter~0 49)} #65#return; {26719#(< ~counter~0 49)} is VALID [2022-04-27 12:15:35,037 INFO L290 TraceCheckUtils]: 586: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,037 INFO L290 TraceCheckUtils]: 585: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,037 INFO L290 TraceCheckUtils]: 584: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,037 INFO L272 TraceCheckUtils]: 583: Hoare triple {26719#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,037 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {24678#true} {26719#(< ~counter~0 49)} #63#return; {26719#(< ~counter~0 49)} is VALID [2022-04-27 12:15:35,037 INFO L290 TraceCheckUtils]: 581: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L290 TraceCheckUtils]: 580: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L290 TraceCheckUtils]: 579: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L272 TraceCheckUtils]: 578: Hoare triple {26719#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {24678#true} {26719#(< ~counter~0 49)} #61#return; {26719#(< ~counter~0 49)} is VALID [2022-04-27 12:15:35,038 INFO L290 TraceCheckUtils]: 576: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L290 TraceCheckUtils]: 575: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L290 TraceCheckUtils]: 574: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L272 TraceCheckUtils]: 573: Hoare triple {26719#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {24678#true} {26719#(< ~counter~0 49)} #59#return; {26719#(< ~counter~0 49)} is VALID [2022-04-27 12:15:35,038 INFO L290 TraceCheckUtils]: 571: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L290 TraceCheckUtils]: 570: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L290 TraceCheckUtils]: 569: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,038 INFO L272 TraceCheckUtils]: 568: Hoare triple {26719#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,039 INFO L290 TraceCheckUtils]: 567: Hoare triple {26719#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {26719#(< ~counter~0 49)} is VALID [2022-04-27 12:15:35,039 INFO L290 TraceCheckUtils]: 566: Hoare triple {26804#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26719#(< ~counter~0 49)} is VALID [2022-04-27 12:15:35,039 INFO L290 TraceCheckUtils]: 565: Hoare triple {26804#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26804#(< ~counter~0 48)} is VALID [2022-04-27 12:15:35,039 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {24678#true} {26804#(< ~counter~0 48)} #67#return; {26804#(< ~counter~0 48)} is VALID [2022-04-27 12:15:35,039 INFO L290 TraceCheckUtils]: 563: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L290 TraceCheckUtils]: 562: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L290 TraceCheckUtils]: 561: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L272 TraceCheckUtils]: 560: Hoare triple {26804#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {24678#true} {26804#(< ~counter~0 48)} #65#return; {26804#(< ~counter~0 48)} is VALID [2022-04-27 12:15:35,040 INFO L290 TraceCheckUtils]: 558: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L290 TraceCheckUtils]: 557: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L290 TraceCheckUtils]: 556: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L272 TraceCheckUtils]: 555: Hoare triple {26804#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {24678#true} {26804#(< ~counter~0 48)} #63#return; {26804#(< ~counter~0 48)} is VALID [2022-04-27 12:15:35,040 INFO L290 TraceCheckUtils]: 553: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L290 TraceCheckUtils]: 552: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L290 TraceCheckUtils]: 551: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,040 INFO L272 TraceCheckUtils]: 550: Hoare triple {26804#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,041 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {24678#true} {26804#(< ~counter~0 48)} #61#return; {26804#(< ~counter~0 48)} is VALID [2022-04-27 12:15:35,041 INFO L290 TraceCheckUtils]: 548: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,041 INFO L290 TraceCheckUtils]: 547: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,041 INFO L290 TraceCheckUtils]: 546: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,041 INFO L272 TraceCheckUtils]: 545: Hoare triple {26804#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,041 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {24678#true} {26804#(< ~counter~0 48)} #59#return; {26804#(< ~counter~0 48)} is VALID [2022-04-27 12:15:35,041 INFO L290 TraceCheckUtils]: 543: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,041 INFO L290 TraceCheckUtils]: 542: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,041 INFO L290 TraceCheckUtils]: 541: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,041 INFO L272 TraceCheckUtils]: 540: Hoare triple {26804#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,041 INFO L290 TraceCheckUtils]: 539: Hoare triple {26804#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {26804#(< ~counter~0 48)} is VALID [2022-04-27 12:15:35,042 INFO L290 TraceCheckUtils]: 538: Hoare triple {26889#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26804#(< ~counter~0 48)} is VALID [2022-04-27 12:15:35,042 INFO L290 TraceCheckUtils]: 537: Hoare triple {26889#(< ~counter~0 47)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26889#(< ~counter~0 47)} is VALID [2022-04-27 12:15:35,042 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {24678#true} {26889#(< ~counter~0 47)} #67#return; {26889#(< ~counter~0 47)} is VALID [2022-04-27 12:15:35,042 INFO L290 TraceCheckUtils]: 535: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,042 INFO L290 TraceCheckUtils]: 534: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,042 INFO L290 TraceCheckUtils]: 533: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,042 INFO L272 TraceCheckUtils]: 532: Hoare triple {26889#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,043 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {24678#true} {26889#(< ~counter~0 47)} #65#return; {26889#(< ~counter~0 47)} is VALID [2022-04-27 12:15:35,043 INFO L290 TraceCheckUtils]: 530: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,043 INFO L290 TraceCheckUtils]: 529: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,043 INFO L290 TraceCheckUtils]: 528: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,043 INFO L272 TraceCheckUtils]: 527: Hoare triple {26889#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,043 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {24678#true} {26889#(< ~counter~0 47)} #63#return; {26889#(< ~counter~0 47)} is VALID [2022-04-27 12:15:35,043 INFO L290 TraceCheckUtils]: 525: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,043 INFO L290 TraceCheckUtils]: 524: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,043 INFO L290 TraceCheckUtils]: 523: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,043 INFO L272 TraceCheckUtils]: 522: Hoare triple {26889#(< ~counter~0 47)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,066 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {24678#true} {26889#(< ~counter~0 47)} #61#return; {26889#(< ~counter~0 47)} is VALID [2022-04-27 12:15:35,066 INFO L290 TraceCheckUtils]: 520: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,066 INFO L290 TraceCheckUtils]: 519: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,066 INFO L290 TraceCheckUtils]: 518: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,066 INFO L272 TraceCheckUtils]: 517: Hoare triple {26889#(< ~counter~0 47)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,067 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {24678#true} {26889#(< ~counter~0 47)} #59#return; {26889#(< ~counter~0 47)} is VALID [2022-04-27 12:15:35,067 INFO L290 TraceCheckUtils]: 515: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,067 INFO L290 TraceCheckUtils]: 514: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,067 INFO L290 TraceCheckUtils]: 513: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,067 INFO L272 TraceCheckUtils]: 512: Hoare triple {26889#(< ~counter~0 47)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,067 INFO L290 TraceCheckUtils]: 511: Hoare triple {26889#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {26889#(< ~counter~0 47)} is VALID [2022-04-27 12:15:35,068 INFO L290 TraceCheckUtils]: 510: Hoare triple {26974#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26889#(< ~counter~0 47)} is VALID [2022-04-27 12:15:35,068 INFO L290 TraceCheckUtils]: 509: Hoare triple {26974#(< ~counter~0 46)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {26974#(< ~counter~0 46)} is VALID [2022-04-27 12:15:35,068 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {24678#true} {26974#(< ~counter~0 46)} #67#return; {26974#(< ~counter~0 46)} is VALID [2022-04-27 12:15:35,068 INFO L290 TraceCheckUtils]: 507: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,068 INFO L290 TraceCheckUtils]: 506: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,068 INFO L290 TraceCheckUtils]: 505: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,068 INFO L272 TraceCheckUtils]: 504: Hoare triple {26974#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {24678#true} {26974#(< ~counter~0 46)} #65#return; {26974#(< ~counter~0 46)} is VALID [2022-04-27 12:15:35,069 INFO L290 TraceCheckUtils]: 502: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L290 TraceCheckUtils]: 501: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L290 TraceCheckUtils]: 500: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L272 TraceCheckUtils]: 499: Hoare triple {26974#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {24678#true} {26974#(< ~counter~0 46)} #63#return; {26974#(< ~counter~0 46)} is VALID [2022-04-27 12:15:35,069 INFO L290 TraceCheckUtils]: 497: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L290 TraceCheckUtils]: 496: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L290 TraceCheckUtils]: 495: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L272 TraceCheckUtils]: 494: Hoare triple {26974#(< ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {24678#true} {26974#(< ~counter~0 46)} #61#return; {26974#(< ~counter~0 46)} is VALID [2022-04-27 12:15:35,069 INFO L290 TraceCheckUtils]: 492: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,069 INFO L290 TraceCheckUtils]: 491: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,070 INFO L290 TraceCheckUtils]: 490: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,070 INFO L272 TraceCheckUtils]: 489: Hoare triple {26974#(< ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,070 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {24678#true} {26974#(< ~counter~0 46)} #59#return; {26974#(< ~counter~0 46)} is VALID [2022-04-27 12:15:35,070 INFO L290 TraceCheckUtils]: 487: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,070 INFO L290 TraceCheckUtils]: 486: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,070 INFO L290 TraceCheckUtils]: 485: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,070 INFO L272 TraceCheckUtils]: 484: Hoare triple {26974#(< ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,070 INFO L290 TraceCheckUtils]: 483: Hoare triple {26974#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {26974#(< ~counter~0 46)} is VALID [2022-04-27 12:15:35,071 INFO L290 TraceCheckUtils]: 482: Hoare triple {27059#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26974#(< ~counter~0 46)} is VALID [2022-04-27 12:15:35,071 INFO L290 TraceCheckUtils]: 481: Hoare triple {27059#(< ~counter~0 45)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27059#(< ~counter~0 45)} is VALID [2022-04-27 12:15:35,071 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {24678#true} {27059#(< ~counter~0 45)} #67#return; {27059#(< ~counter~0 45)} is VALID [2022-04-27 12:15:35,071 INFO L290 TraceCheckUtils]: 479: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,071 INFO L290 TraceCheckUtils]: 478: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,071 INFO L290 TraceCheckUtils]: 477: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,071 INFO L272 TraceCheckUtils]: 476: Hoare triple {27059#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,072 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {24678#true} {27059#(< ~counter~0 45)} #65#return; {27059#(< ~counter~0 45)} is VALID [2022-04-27 12:15:35,072 INFO L290 TraceCheckUtils]: 474: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,072 INFO L290 TraceCheckUtils]: 473: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,072 INFO L290 TraceCheckUtils]: 472: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,072 INFO L272 TraceCheckUtils]: 471: Hoare triple {27059#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,072 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {24678#true} {27059#(< ~counter~0 45)} #63#return; {27059#(< ~counter~0 45)} is VALID [2022-04-27 12:15:35,072 INFO L290 TraceCheckUtils]: 469: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,072 INFO L290 TraceCheckUtils]: 468: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,072 INFO L290 TraceCheckUtils]: 467: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,072 INFO L272 TraceCheckUtils]: 466: Hoare triple {27059#(< ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,073 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {24678#true} {27059#(< ~counter~0 45)} #61#return; {27059#(< ~counter~0 45)} is VALID [2022-04-27 12:15:35,073 INFO L290 TraceCheckUtils]: 464: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,073 INFO L290 TraceCheckUtils]: 463: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,073 INFO L290 TraceCheckUtils]: 462: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,073 INFO L272 TraceCheckUtils]: 461: Hoare triple {27059#(< ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,073 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {24678#true} {27059#(< ~counter~0 45)} #59#return; {27059#(< ~counter~0 45)} is VALID [2022-04-27 12:15:35,073 INFO L290 TraceCheckUtils]: 459: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,073 INFO L290 TraceCheckUtils]: 458: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,073 INFO L290 TraceCheckUtils]: 457: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,073 INFO L272 TraceCheckUtils]: 456: Hoare triple {27059#(< ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,073 INFO L290 TraceCheckUtils]: 455: Hoare triple {27059#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {27059#(< ~counter~0 45)} is VALID [2022-04-27 12:15:35,074 INFO L290 TraceCheckUtils]: 454: Hoare triple {27144#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27059#(< ~counter~0 45)} is VALID [2022-04-27 12:15:35,074 INFO L290 TraceCheckUtils]: 453: Hoare triple {27144#(< ~counter~0 44)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27144#(< ~counter~0 44)} is VALID [2022-04-27 12:15:35,074 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {24678#true} {27144#(< ~counter~0 44)} #67#return; {27144#(< ~counter~0 44)} is VALID [2022-04-27 12:15:35,074 INFO L290 TraceCheckUtils]: 451: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,074 INFO L290 TraceCheckUtils]: 450: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,075 INFO L290 TraceCheckUtils]: 449: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,075 INFO L272 TraceCheckUtils]: 448: Hoare triple {27144#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,075 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {24678#true} {27144#(< ~counter~0 44)} #65#return; {27144#(< ~counter~0 44)} is VALID [2022-04-27 12:15:35,075 INFO L290 TraceCheckUtils]: 446: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,075 INFO L290 TraceCheckUtils]: 445: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,075 INFO L290 TraceCheckUtils]: 444: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,075 INFO L272 TraceCheckUtils]: 443: Hoare triple {27144#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,075 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {24678#true} {27144#(< ~counter~0 44)} #63#return; {27144#(< ~counter~0 44)} is VALID [2022-04-27 12:15:35,075 INFO L290 TraceCheckUtils]: 441: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,075 INFO L290 TraceCheckUtils]: 440: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,075 INFO L290 TraceCheckUtils]: 439: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,076 INFO L272 TraceCheckUtils]: 438: Hoare triple {27144#(< ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,076 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {24678#true} {27144#(< ~counter~0 44)} #61#return; {27144#(< ~counter~0 44)} is VALID [2022-04-27 12:15:35,076 INFO L290 TraceCheckUtils]: 436: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,076 INFO L290 TraceCheckUtils]: 435: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,076 INFO L290 TraceCheckUtils]: 434: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,076 INFO L272 TraceCheckUtils]: 433: Hoare triple {27144#(< ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,076 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {24678#true} {27144#(< ~counter~0 44)} #59#return; {27144#(< ~counter~0 44)} is VALID [2022-04-27 12:15:35,076 INFO L290 TraceCheckUtils]: 431: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,076 INFO L290 TraceCheckUtils]: 430: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,076 INFO L290 TraceCheckUtils]: 429: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,076 INFO L272 TraceCheckUtils]: 428: Hoare triple {27144#(< ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,077 INFO L290 TraceCheckUtils]: 427: Hoare triple {27144#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {27144#(< ~counter~0 44)} is VALID [2022-04-27 12:15:35,077 INFO L290 TraceCheckUtils]: 426: Hoare triple {27229#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27144#(< ~counter~0 44)} is VALID [2022-04-27 12:15:35,077 INFO L290 TraceCheckUtils]: 425: Hoare triple {27229#(< ~counter~0 43)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27229#(< ~counter~0 43)} is VALID [2022-04-27 12:15:35,078 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {24678#true} {27229#(< ~counter~0 43)} #67#return; {27229#(< ~counter~0 43)} is VALID [2022-04-27 12:15:35,078 INFO L290 TraceCheckUtils]: 423: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,078 INFO L290 TraceCheckUtils]: 422: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,078 INFO L290 TraceCheckUtils]: 421: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,078 INFO L272 TraceCheckUtils]: 420: Hoare triple {27229#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,078 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {24678#true} {27229#(< ~counter~0 43)} #65#return; {27229#(< ~counter~0 43)} is VALID [2022-04-27 12:15:35,078 INFO L290 TraceCheckUtils]: 418: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,078 INFO L290 TraceCheckUtils]: 417: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,078 INFO L290 TraceCheckUtils]: 416: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,078 INFO L272 TraceCheckUtils]: 415: Hoare triple {27229#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,078 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {24678#true} {27229#(< ~counter~0 43)} #63#return; {27229#(< ~counter~0 43)} is VALID [2022-04-27 12:15:35,079 INFO L290 TraceCheckUtils]: 413: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L290 TraceCheckUtils]: 412: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L290 TraceCheckUtils]: 411: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L272 TraceCheckUtils]: 410: Hoare triple {27229#(< ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {24678#true} {27229#(< ~counter~0 43)} #61#return; {27229#(< ~counter~0 43)} is VALID [2022-04-27 12:15:35,079 INFO L290 TraceCheckUtils]: 408: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L290 TraceCheckUtils]: 407: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L290 TraceCheckUtils]: 406: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L272 TraceCheckUtils]: 405: Hoare triple {27229#(< ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {24678#true} {27229#(< ~counter~0 43)} #59#return; {27229#(< ~counter~0 43)} is VALID [2022-04-27 12:15:35,079 INFO L290 TraceCheckUtils]: 403: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L290 TraceCheckUtils]: 402: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,079 INFO L290 TraceCheckUtils]: 401: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,080 INFO L272 TraceCheckUtils]: 400: Hoare triple {27229#(< ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,080 INFO L290 TraceCheckUtils]: 399: Hoare triple {27229#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {27229#(< ~counter~0 43)} is VALID [2022-04-27 12:15:35,080 INFO L290 TraceCheckUtils]: 398: Hoare triple {27314#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27229#(< ~counter~0 43)} is VALID [2022-04-27 12:15:35,080 INFO L290 TraceCheckUtils]: 397: Hoare triple {27314#(< ~counter~0 42)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27314#(< ~counter~0 42)} is VALID [2022-04-27 12:15:35,080 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {24678#true} {27314#(< ~counter~0 42)} #67#return; {27314#(< ~counter~0 42)} is VALID [2022-04-27 12:15:35,080 INFO L290 TraceCheckUtils]: 395: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L290 TraceCheckUtils]: 394: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L290 TraceCheckUtils]: 393: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L272 TraceCheckUtils]: 392: Hoare triple {27314#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {24678#true} {27314#(< ~counter~0 42)} #65#return; {27314#(< ~counter~0 42)} is VALID [2022-04-27 12:15:35,081 INFO L290 TraceCheckUtils]: 390: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L290 TraceCheckUtils]: 389: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L290 TraceCheckUtils]: 388: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L272 TraceCheckUtils]: 387: Hoare triple {27314#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {24678#true} {27314#(< ~counter~0 42)} #63#return; {27314#(< ~counter~0 42)} is VALID [2022-04-27 12:15:35,081 INFO L290 TraceCheckUtils]: 385: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L290 TraceCheckUtils]: 384: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L290 TraceCheckUtils]: 383: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,081 INFO L272 TraceCheckUtils]: 382: Hoare triple {27314#(< ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,082 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {24678#true} {27314#(< ~counter~0 42)} #61#return; {27314#(< ~counter~0 42)} is VALID [2022-04-27 12:15:35,082 INFO L290 TraceCheckUtils]: 380: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,082 INFO L290 TraceCheckUtils]: 379: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,082 INFO L290 TraceCheckUtils]: 378: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,082 INFO L272 TraceCheckUtils]: 377: Hoare triple {27314#(< ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,082 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {24678#true} {27314#(< ~counter~0 42)} #59#return; {27314#(< ~counter~0 42)} is VALID [2022-04-27 12:15:35,082 INFO L290 TraceCheckUtils]: 375: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,082 INFO L290 TraceCheckUtils]: 374: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,082 INFO L290 TraceCheckUtils]: 373: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,082 INFO L272 TraceCheckUtils]: 372: Hoare triple {27314#(< ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,082 INFO L290 TraceCheckUtils]: 371: Hoare triple {27314#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {27314#(< ~counter~0 42)} is VALID [2022-04-27 12:15:35,083 INFO L290 TraceCheckUtils]: 370: Hoare triple {27399#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27314#(< ~counter~0 42)} is VALID [2022-04-27 12:15:35,083 INFO L290 TraceCheckUtils]: 369: Hoare triple {27399#(< ~counter~0 41)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27399#(< ~counter~0 41)} is VALID [2022-04-27 12:15:35,083 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {24678#true} {27399#(< ~counter~0 41)} #67#return; {27399#(< ~counter~0 41)} is VALID [2022-04-27 12:15:35,083 INFO L290 TraceCheckUtils]: 367: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,083 INFO L290 TraceCheckUtils]: 366: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,083 INFO L290 TraceCheckUtils]: 365: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,083 INFO L272 TraceCheckUtils]: 364: Hoare triple {27399#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,084 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {24678#true} {27399#(< ~counter~0 41)} #65#return; {27399#(< ~counter~0 41)} is VALID [2022-04-27 12:15:35,084 INFO L290 TraceCheckUtils]: 362: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,084 INFO L290 TraceCheckUtils]: 361: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,084 INFO L290 TraceCheckUtils]: 360: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,084 INFO L272 TraceCheckUtils]: 359: Hoare triple {27399#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,084 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {24678#true} {27399#(< ~counter~0 41)} #63#return; {27399#(< ~counter~0 41)} is VALID [2022-04-27 12:15:35,084 INFO L290 TraceCheckUtils]: 357: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,084 INFO L290 TraceCheckUtils]: 356: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,084 INFO L290 TraceCheckUtils]: 355: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,084 INFO L272 TraceCheckUtils]: 354: Hoare triple {27399#(< ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,085 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {24678#true} {27399#(< ~counter~0 41)} #61#return; {27399#(< ~counter~0 41)} is VALID [2022-04-27 12:15:35,085 INFO L290 TraceCheckUtils]: 352: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,085 INFO L290 TraceCheckUtils]: 351: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,085 INFO L290 TraceCheckUtils]: 350: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,085 INFO L272 TraceCheckUtils]: 349: Hoare triple {27399#(< ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,085 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {24678#true} {27399#(< ~counter~0 41)} #59#return; {27399#(< ~counter~0 41)} is VALID [2022-04-27 12:15:35,085 INFO L290 TraceCheckUtils]: 347: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,085 INFO L290 TraceCheckUtils]: 346: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,085 INFO L290 TraceCheckUtils]: 345: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,085 INFO L272 TraceCheckUtils]: 344: Hoare triple {27399#(< ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,085 INFO L290 TraceCheckUtils]: 343: Hoare triple {27399#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {27399#(< ~counter~0 41)} is VALID [2022-04-27 12:15:35,086 INFO L290 TraceCheckUtils]: 342: Hoare triple {27484#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27399#(< ~counter~0 41)} is VALID [2022-04-27 12:15:35,086 INFO L290 TraceCheckUtils]: 341: Hoare triple {27484#(< ~counter~0 40)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27484#(< ~counter~0 40)} is VALID [2022-04-27 12:15:35,086 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {24678#true} {27484#(< ~counter~0 40)} #67#return; {27484#(< ~counter~0 40)} is VALID [2022-04-27 12:15:35,086 INFO L290 TraceCheckUtils]: 339: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,086 INFO L290 TraceCheckUtils]: 338: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,086 INFO L290 TraceCheckUtils]: 337: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,086 INFO L272 TraceCheckUtils]: 336: Hoare triple {27484#(< ~counter~0 40)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {24678#true} {27484#(< ~counter~0 40)} #65#return; {27484#(< ~counter~0 40)} is VALID [2022-04-27 12:15:35,087 INFO L290 TraceCheckUtils]: 334: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L290 TraceCheckUtils]: 333: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L290 TraceCheckUtils]: 332: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L272 TraceCheckUtils]: 331: Hoare triple {27484#(< ~counter~0 40)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {24678#true} {27484#(< ~counter~0 40)} #63#return; {27484#(< ~counter~0 40)} is VALID [2022-04-27 12:15:35,087 INFO L290 TraceCheckUtils]: 329: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L290 TraceCheckUtils]: 328: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L290 TraceCheckUtils]: 327: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L272 TraceCheckUtils]: 326: Hoare triple {27484#(< ~counter~0 40)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {24678#true} {27484#(< ~counter~0 40)} #61#return; {27484#(< ~counter~0 40)} is VALID [2022-04-27 12:15:35,087 INFO L290 TraceCheckUtils]: 324: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,087 INFO L290 TraceCheckUtils]: 323: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,088 INFO L290 TraceCheckUtils]: 322: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,088 INFO L272 TraceCheckUtils]: 321: Hoare triple {27484#(< ~counter~0 40)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,088 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {24678#true} {27484#(< ~counter~0 40)} #59#return; {27484#(< ~counter~0 40)} is VALID [2022-04-27 12:15:35,088 INFO L290 TraceCheckUtils]: 319: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,088 INFO L290 TraceCheckUtils]: 318: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,088 INFO L290 TraceCheckUtils]: 317: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,088 INFO L272 TraceCheckUtils]: 316: Hoare triple {27484#(< ~counter~0 40)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,088 INFO L290 TraceCheckUtils]: 315: Hoare triple {27484#(< ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {27484#(< ~counter~0 40)} is VALID [2022-04-27 12:15:35,088 INFO L290 TraceCheckUtils]: 314: Hoare triple {27569#(< ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27484#(< ~counter~0 40)} is VALID [2022-04-27 12:15:35,089 INFO L290 TraceCheckUtils]: 313: Hoare triple {27569#(< ~counter~0 39)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27569#(< ~counter~0 39)} is VALID [2022-04-27 12:15:35,089 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {24678#true} {27569#(< ~counter~0 39)} #67#return; {27569#(< ~counter~0 39)} is VALID [2022-04-27 12:15:35,089 INFO L290 TraceCheckUtils]: 311: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,089 INFO L290 TraceCheckUtils]: 310: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,089 INFO L290 TraceCheckUtils]: 309: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,089 INFO L272 TraceCheckUtils]: 308: Hoare triple {27569#(< ~counter~0 39)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,089 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {24678#true} {27569#(< ~counter~0 39)} #65#return; {27569#(< ~counter~0 39)} is VALID [2022-04-27 12:15:35,089 INFO L290 TraceCheckUtils]: 306: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,089 INFO L290 TraceCheckUtils]: 305: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,089 INFO L290 TraceCheckUtils]: 304: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,089 INFO L272 TraceCheckUtils]: 303: Hoare triple {27569#(< ~counter~0 39)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,090 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {24678#true} {27569#(< ~counter~0 39)} #63#return; {27569#(< ~counter~0 39)} is VALID [2022-04-27 12:15:35,090 INFO L290 TraceCheckUtils]: 301: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,090 INFO L290 TraceCheckUtils]: 300: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,090 INFO L290 TraceCheckUtils]: 299: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,090 INFO L272 TraceCheckUtils]: 298: Hoare triple {27569#(< ~counter~0 39)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,090 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {24678#true} {27569#(< ~counter~0 39)} #61#return; {27569#(< ~counter~0 39)} is VALID [2022-04-27 12:15:35,090 INFO L290 TraceCheckUtils]: 296: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,090 INFO L290 TraceCheckUtils]: 295: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,090 INFO L290 TraceCheckUtils]: 294: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,090 INFO L272 TraceCheckUtils]: 293: Hoare triple {27569#(< ~counter~0 39)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,091 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {24678#true} {27569#(< ~counter~0 39)} #59#return; {27569#(< ~counter~0 39)} is VALID [2022-04-27 12:15:35,091 INFO L290 TraceCheckUtils]: 291: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,091 INFO L290 TraceCheckUtils]: 290: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,091 INFO L290 TraceCheckUtils]: 289: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,091 INFO L272 TraceCheckUtils]: 288: Hoare triple {27569#(< ~counter~0 39)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,091 INFO L290 TraceCheckUtils]: 287: Hoare triple {27569#(< ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {27569#(< ~counter~0 39)} is VALID [2022-04-27 12:15:35,091 INFO L290 TraceCheckUtils]: 286: Hoare triple {27654#(< ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27569#(< ~counter~0 39)} is VALID [2022-04-27 12:15:35,091 INFO L290 TraceCheckUtils]: 285: Hoare triple {27654#(< ~counter~0 38)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27654#(< ~counter~0 38)} is VALID [2022-04-27 12:15:35,092 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {24678#true} {27654#(< ~counter~0 38)} #67#return; {27654#(< ~counter~0 38)} is VALID [2022-04-27 12:15:35,092 INFO L290 TraceCheckUtils]: 283: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,092 INFO L290 TraceCheckUtils]: 282: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,092 INFO L290 TraceCheckUtils]: 281: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,092 INFO L272 TraceCheckUtils]: 280: Hoare triple {27654#(< ~counter~0 38)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,092 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {24678#true} {27654#(< ~counter~0 38)} #65#return; {27654#(< ~counter~0 38)} is VALID [2022-04-27 12:15:35,092 INFO L290 TraceCheckUtils]: 278: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,092 INFO L290 TraceCheckUtils]: 277: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,092 INFO L290 TraceCheckUtils]: 276: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,092 INFO L272 TraceCheckUtils]: 275: Hoare triple {27654#(< ~counter~0 38)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {24678#true} {27654#(< ~counter~0 38)} #63#return; {27654#(< ~counter~0 38)} is VALID [2022-04-27 12:15:35,093 INFO L290 TraceCheckUtils]: 273: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L290 TraceCheckUtils]: 272: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L290 TraceCheckUtils]: 271: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L272 TraceCheckUtils]: 270: Hoare triple {27654#(< ~counter~0 38)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {24678#true} {27654#(< ~counter~0 38)} #61#return; {27654#(< ~counter~0 38)} is VALID [2022-04-27 12:15:35,093 INFO L290 TraceCheckUtils]: 268: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L290 TraceCheckUtils]: 267: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L290 TraceCheckUtils]: 266: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L272 TraceCheckUtils]: 265: Hoare triple {27654#(< ~counter~0 38)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {24678#true} {27654#(< ~counter~0 38)} #59#return; {27654#(< ~counter~0 38)} is VALID [2022-04-27 12:15:35,093 INFO L290 TraceCheckUtils]: 263: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,093 INFO L290 TraceCheckUtils]: 262: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,094 INFO L290 TraceCheckUtils]: 261: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,094 INFO L272 TraceCheckUtils]: 260: Hoare triple {27654#(< ~counter~0 38)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,094 INFO L290 TraceCheckUtils]: 259: Hoare triple {27654#(< ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {27654#(< ~counter~0 38)} is VALID [2022-04-27 12:15:35,094 INFO L290 TraceCheckUtils]: 258: Hoare triple {27739#(< ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27654#(< ~counter~0 38)} is VALID [2022-04-27 12:15:35,094 INFO L290 TraceCheckUtils]: 257: Hoare triple {27739#(< ~counter~0 37)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27739#(< ~counter~0 37)} is VALID [2022-04-27 12:15:35,095 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {24678#true} {27739#(< ~counter~0 37)} #67#return; {27739#(< ~counter~0 37)} is VALID [2022-04-27 12:15:35,095 INFO L290 TraceCheckUtils]: 255: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,095 INFO L290 TraceCheckUtils]: 254: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,095 INFO L290 TraceCheckUtils]: 253: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,095 INFO L272 TraceCheckUtils]: 252: Hoare triple {27739#(< ~counter~0 37)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,095 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {24678#true} {27739#(< ~counter~0 37)} #65#return; {27739#(< ~counter~0 37)} is VALID [2022-04-27 12:15:35,095 INFO L290 TraceCheckUtils]: 250: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,095 INFO L290 TraceCheckUtils]: 249: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,095 INFO L290 TraceCheckUtils]: 248: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,095 INFO L272 TraceCheckUtils]: 247: Hoare triple {27739#(< ~counter~0 37)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,096 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {24678#true} {27739#(< ~counter~0 37)} #63#return; {27739#(< ~counter~0 37)} is VALID [2022-04-27 12:15:35,096 INFO L290 TraceCheckUtils]: 245: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,096 INFO L290 TraceCheckUtils]: 244: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,096 INFO L290 TraceCheckUtils]: 243: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,096 INFO L272 TraceCheckUtils]: 242: Hoare triple {27739#(< ~counter~0 37)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,096 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {24678#true} {27739#(< ~counter~0 37)} #61#return; {27739#(< ~counter~0 37)} is VALID [2022-04-27 12:15:35,096 INFO L290 TraceCheckUtils]: 240: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,096 INFO L290 TraceCheckUtils]: 239: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,096 INFO L290 TraceCheckUtils]: 238: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,096 INFO L272 TraceCheckUtils]: 237: Hoare triple {27739#(< ~counter~0 37)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,097 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {24678#true} {27739#(< ~counter~0 37)} #59#return; {27739#(< ~counter~0 37)} is VALID [2022-04-27 12:15:35,097 INFO L290 TraceCheckUtils]: 235: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,097 INFO L290 TraceCheckUtils]: 234: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,097 INFO L290 TraceCheckUtils]: 233: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,097 INFO L272 TraceCheckUtils]: 232: Hoare triple {27739#(< ~counter~0 37)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,097 INFO L290 TraceCheckUtils]: 231: Hoare triple {27739#(< ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {27739#(< ~counter~0 37)} is VALID [2022-04-27 12:15:35,097 INFO L290 TraceCheckUtils]: 230: Hoare triple {27824#(< ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27739#(< ~counter~0 37)} is VALID [2022-04-27 12:15:35,098 INFO L290 TraceCheckUtils]: 229: Hoare triple {27824#(< ~counter~0 36)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27824#(< ~counter~0 36)} is VALID [2022-04-27 12:15:35,098 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {24678#true} {27824#(< ~counter~0 36)} #67#return; {27824#(< ~counter~0 36)} is VALID [2022-04-27 12:15:35,098 INFO L290 TraceCheckUtils]: 227: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,098 INFO L290 TraceCheckUtils]: 226: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,098 INFO L290 TraceCheckUtils]: 225: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,098 INFO L272 TraceCheckUtils]: 224: Hoare triple {27824#(< ~counter~0 36)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,098 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {24678#true} {27824#(< ~counter~0 36)} #65#return; {27824#(< ~counter~0 36)} is VALID [2022-04-27 12:15:35,098 INFO L290 TraceCheckUtils]: 222: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,099 INFO L290 TraceCheckUtils]: 221: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,099 INFO L290 TraceCheckUtils]: 220: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,099 INFO L272 TraceCheckUtils]: 219: Hoare triple {27824#(< ~counter~0 36)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,099 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {24678#true} {27824#(< ~counter~0 36)} #63#return; {27824#(< ~counter~0 36)} is VALID [2022-04-27 12:15:35,099 INFO L290 TraceCheckUtils]: 217: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,099 INFO L290 TraceCheckUtils]: 216: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,099 INFO L290 TraceCheckUtils]: 215: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,099 INFO L272 TraceCheckUtils]: 214: Hoare triple {27824#(< ~counter~0 36)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,099 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {24678#true} {27824#(< ~counter~0 36)} #61#return; {27824#(< ~counter~0 36)} is VALID [2022-04-27 12:15:35,099 INFO L290 TraceCheckUtils]: 212: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,100 INFO L290 TraceCheckUtils]: 211: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,100 INFO L290 TraceCheckUtils]: 210: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,100 INFO L272 TraceCheckUtils]: 209: Hoare triple {27824#(< ~counter~0 36)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,100 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {24678#true} {27824#(< ~counter~0 36)} #59#return; {27824#(< ~counter~0 36)} is VALID [2022-04-27 12:15:35,100 INFO L290 TraceCheckUtils]: 207: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,100 INFO L290 TraceCheckUtils]: 206: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,100 INFO L290 TraceCheckUtils]: 205: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,100 INFO L272 TraceCheckUtils]: 204: Hoare triple {27824#(< ~counter~0 36)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,100 INFO L290 TraceCheckUtils]: 203: Hoare triple {27824#(< ~counter~0 36)} assume !!(#t~post5 < 50);havoc #t~post5; {27824#(< ~counter~0 36)} is VALID [2022-04-27 12:15:35,101 INFO L290 TraceCheckUtils]: 202: Hoare triple {27909#(< ~counter~0 35)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27824#(< ~counter~0 36)} is VALID [2022-04-27 12:15:35,101 INFO L290 TraceCheckUtils]: 201: Hoare triple {27909#(< ~counter~0 35)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27909#(< ~counter~0 35)} is VALID [2022-04-27 12:15:35,101 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {24678#true} {27909#(< ~counter~0 35)} #67#return; {27909#(< ~counter~0 35)} is VALID [2022-04-27 12:15:35,101 INFO L290 TraceCheckUtils]: 199: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,101 INFO L290 TraceCheckUtils]: 198: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,101 INFO L290 TraceCheckUtils]: 197: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,101 INFO L272 TraceCheckUtils]: 196: Hoare triple {27909#(< ~counter~0 35)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,102 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {24678#true} {27909#(< ~counter~0 35)} #65#return; {27909#(< ~counter~0 35)} is VALID [2022-04-27 12:15:35,102 INFO L290 TraceCheckUtils]: 194: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,102 INFO L290 TraceCheckUtils]: 193: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,102 INFO L290 TraceCheckUtils]: 192: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,102 INFO L272 TraceCheckUtils]: 191: Hoare triple {27909#(< ~counter~0 35)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,102 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {24678#true} {27909#(< ~counter~0 35)} #63#return; {27909#(< ~counter~0 35)} is VALID [2022-04-27 12:15:35,102 INFO L290 TraceCheckUtils]: 189: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,102 INFO L290 TraceCheckUtils]: 188: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,102 INFO L290 TraceCheckUtils]: 187: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,102 INFO L272 TraceCheckUtils]: 186: Hoare triple {27909#(< ~counter~0 35)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,103 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {24678#true} {27909#(< ~counter~0 35)} #61#return; {27909#(< ~counter~0 35)} is VALID [2022-04-27 12:15:35,103 INFO L290 TraceCheckUtils]: 184: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,103 INFO L290 TraceCheckUtils]: 183: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,103 INFO L290 TraceCheckUtils]: 182: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,103 INFO L272 TraceCheckUtils]: 181: Hoare triple {27909#(< ~counter~0 35)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,103 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {24678#true} {27909#(< ~counter~0 35)} #59#return; {27909#(< ~counter~0 35)} is VALID [2022-04-27 12:15:35,103 INFO L290 TraceCheckUtils]: 179: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,103 INFO L290 TraceCheckUtils]: 178: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,103 INFO L290 TraceCheckUtils]: 177: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,103 INFO L272 TraceCheckUtils]: 176: Hoare triple {27909#(< ~counter~0 35)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,104 INFO L290 TraceCheckUtils]: 175: Hoare triple {27909#(< ~counter~0 35)} assume !!(#t~post5 < 50);havoc #t~post5; {27909#(< ~counter~0 35)} is VALID [2022-04-27 12:15:35,104 INFO L290 TraceCheckUtils]: 174: Hoare triple {27994#(< ~counter~0 34)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27909#(< ~counter~0 35)} is VALID [2022-04-27 12:15:35,104 INFO L290 TraceCheckUtils]: 173: Hoare triple {27994#(< ~counter~0 34)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27994#(< ~counter~0 34)} is VALID [2022-04-27 12:15:35,105 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {24678#true} {27994#(< ~counter~0 34)} #67#return; {27994#(< ~counter~0 34)} is VALID [2022-04-27 12:15:35,105 INFO L290 TraceCheckUtils]: 171: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,105 INFO L290 TraceCheckUtils]: 170: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,105 INFO L290 TraceCheckUtils]: 169: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,105 INFO L272 TraceCheckUtils]: 168: Hoare triple {27994#(< ~counter~0 34)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,105 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {24678#true} {27994#(< ~counter~0 34)} #65#return; {27994#(< ~counter~0 34)} is VALID [2022-04-27 12:15:35,105 INFO L290 TraceCheckUtils]: 166: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,105 INFO L290 TraceCheckUtils]: 165: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,105 INFO L290 TraceCheckUtils]: 164: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,105 INFO L272 TraceCheckUtils]: 163: Hoare triple {27994#(< ~counter~0 34)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,106 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {24678#true} {27994#(< ~counter~0 34)} #63#return; {27994#(< ~counter~0 34)} is VALID [2022-04-27 12:15:35,106 INFO L290 TraceCheckUtils]: 161: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,106 INFO L290 TraceCheckUtils]: 160: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,106 INFO L290 TraceCheckUtils]: 159: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,106 INFO L272 TraceCheckUtils]: 158: Hoare triple {27994#(< ~counter~0 34)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,106 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {24678#true} {27994#(< ~counter~0 34)} #61#return; {27994#(< ~counter~0 34)} is VALID [2022-04-27 12:15:35,106 INFO L290 TraceCheckUtils]: 156: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,106 INFO L290 TraceCheckUtils]: 155: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,106 INFO L290 TraceCheckUtils]: 154: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,106 INFO L272 TraceCheckUtils]: 153: Hoare triple {27994#(< ~counter~0 34)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,106 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {24678#true} {27994#(< ~counter~0 34)} #59#return; {27994#(< ~counter~0 34)} is VALID [2022-04-27 12:15:35,107 INFO L290 TraceCheckUtils]: 151: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,107 INFO L290 TraceCheckUtils]: 150: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,107 INFO L290 TraceCheckUtils]: 149: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,107 INFO L272 TraceCheckUtils]: 148: Hoare triple {27994#(< ~counter~0 34)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,107 INFO L290 TraceCheckUtils]: 147: Hoare triple {27994#(< ~counter~0 34)} assume !!(#t~post5 < 50);havoc #t~post5; {27994#(< ~counter~0 34)} is VALID [2022-04-27 12:15:35,107 INFO L290 TraceCheckUtils]: 146: Hoare triple {28079#(< ~counter~0 33)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27994#(< ~counter~0 34)} is VALID [2022-04-27 12:15:35,107 INFO L290 TraceCheckUtils]: 145: Hoare triple {28079#(< ~counter~0 33)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28079#(< ~counter~0 33)} is VALID [2022-04-27 12:15:35,108 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {24678#true} {28079#(< ~counter~0 33)} #67#return; {28079#(< ~counter~0 33)} is VALID [2022-04-27 12:15:35,108 INFO L290 TraceCheckUtils]: 143: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,108 INFO L290 TraceCheckUtils]: 142: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,108 INFO L290 TraceCheckUtils]: 141: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,108 INFO L272 TraceCheckUtils]: 140: Hoare triple {28079#(< ~counter~0 33)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,108 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {24678#true} {28079#(< ~counter~0 33)} #65#return; {28079#(< ~counter~0 33)} is VALID [2022-04-27 12:15:35,108 INFO L290 TraceCheckUtils]: 138: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,108 INFO L290 TraceCheckUtils]: 137: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,108 INFO L290 TraceCheckUtils]: 136: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,108 INFO L272 TraceCheckUtils]: 135: Hoare triple {28079#(< ~counter~0 33)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,108 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {24678#true} {28079#(< ~counter~0 33)} #63#return; {28079#(< ~counter~0 33)} is VALID [2022-04-27 12:15:35,109 INFO L290 TraceCheckUtils]: 133: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L290 TraceCheckUtils]: 132: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L290 TraceCheckUtils]: 131: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L272 TraceCheckUtils]: 130: Hoare triple {28079#(< ~counter~0 33)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {24678#true} {28079#(< ~counter~0 33)} #61#return; {28079#(< ~counter~0 33)} is VALID [2022-04-27 12:15:35,109 INFO L290 TraceCheckUtils]: 128: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L290 TraceCheckUtils]: 127: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L290 TraceCheckUtils]: 126: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L272 TraceCheckUtils]: 125: Hoare triple {28079#(< ~counter~0 33)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {24678#true} {28079#(< ~counter~0 33)} #59#return; {28079#(< ~counter~0 33)} is VALID [2022-04-27 12:15:35,109 INFO L290 TraceCheckUtils]: 123: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L290 TraceCheckUtils]: 122: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L290 TraceCheckUtils]: 121: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,109 INFO L272 TraceCheckUtils]: 120: Hoare triple {28079#(< ~counter~0 33)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,110 INFO L290 TraceCheckUtils]: 119: Hoare triple {28079#(< ~counter~0 33)} assume !!(#t~post5 < 50);havoc #t~post5; {28079#(< ~counter~0 33)} is VALID [2022-04-27 12:15:35,110 INFO L290 TraceCheckUtils]: 118: Hoare triple {28164#(< ~counter~0 32)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28079#(< ~counter~0 33)} is VALID [2022-04-27 12:15:35,110 INFO L290 TraceCheckUtils]: 117: Hoare triple {28164#(< ~counter~0 32)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28164#(< ~counter~0 32)} is VALID [2022-04-27 12:15:35,110 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {24678#true} {28164#(< ~counter~0 32)} #67#return; {28164#(< ~counter~0 32)} is VALID [2022-04-27 12:15:35,110 INFO L290 TraceCheckUtils]: 115: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,110 INFO L290 TraceCheckUtils]: 114: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L290 TraceCheckUtils]: 113: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L272 TraceCheckUtils]: 112: Hoare triple {28164#(< ~counter~0 32)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {24678#true} {28164#(< ~counter~0 32)} #65#return; {28164#(< ~counter~0 32)} is VALID [2022-04-27 12:15:35,111 INFO L290 TraceCheckUtils]: 110: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L290 TraceCheckUtils]: 109: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L290 TraceCheckUtils]: 108: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L272 TraceCheckUtils]: 107: Hoare triple {28164#(< ~counter~0 32)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {24678#true} {28164#(< ~counter~0 32)} #63#return; {28164#(< ~counter~0 32)} is VALID [2022-04-27 12:15:35,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L290 TraceCheckUtils]: 104: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L290 TraceCheckUtils]: 103: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,111 INFO L272 TraceCheckUtils]: 102: Hoare triple {28164#(< ~counter~0 32)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,112 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {24678#true} {28164#(< ~counter~0 32)} #61#return; {28164#(< ~counter~0 32)} is VALID [2022-04-27 12:15:35,112 INFO L290 TraceCheckUtils]: 100: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,112 INFO L290 TraceCheckUtils]: 99: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,112 INFO L290 TraceCheckUtils]: 98: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,112 INFO L272 TraceCheckUtils]: 97: Hoare triple {28164#(< ~counter~0 32)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,112 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {24678#true} {28164#(< ~counter~0 32)} #59#return; {28164#(< ~counter~0 32)} is VALID [2022-04-27 12:15:35,112 INFO L290 TraceCheckUtils]: 95: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,112 INFO L290 TraceCheckUtils]: 94: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,112 INFO L290 TraceCheckUtils]: 93: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,112 INFO L272 TraceCheckUtils]: 92: Hoare triple {28164#(< ~counter~0 32)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,112 INFO L290 TraceCheckUtils]: 91: Hoare triple {28164#(< ~counter~0 32)} assume !!(#t~post5 < 50);havoc #t~post5; {28164#(< ~counter~0 32)} is VALID [2022-04-27 12:15:35,113 INFO L290 TraceCheckUtils]: 90: Hoare triple {28249#(< ~counter~0 31)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28164#(< ~counter~0 32)} is VALID [2022-04-27 12:15:35,113 INFO L290 TraceCheckUtils]: 89: Hoare triple {28249#(< ~counter~0 31)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28249#(< ~counter~0 31)} is VALID [2022-04-27 12:15:35,113 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {24678#true} {28249#(< ~counter~0 31)} #67#return; {28249#(< ~counter~0 31)} is VALID [2022-04-27 12:15:35,113 INFO L290 TraceCheckUtils]: 87: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,114 INFO L290 TraceCheckUtils]: 86: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,114 INFO L290 TraceCheckUtils]: 85: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,114 INFO L272 TraceCheckUtils]: 84: Hoare triple {28249#(< ~counter~0 31)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,114 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {24678#true} {28249#(< ~counter~0 31)} #65#return; {28249#(< ~counter~0 31)} is VALID [2022-04-27 12:15:35,114 INFO L290 TraceCheckUtils]: 82: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,114 INFO L290 TraceCheckUtils]: 81: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,114 INFO L290 TraceCheckUtils]: 80: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,114 INFO L272 TraceCheckUtils]: 79: Hoare triple {28249#(< ~counter~0 31)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,114 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {24678#true} {28249#(< ~counter~0 31)} #63#return; {28249#(< ~counter~0 31)} is VALID [2022-04-27 12:15:35,115 INFO L290 TraceCheckUtils]: 77: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,115 INFO L290 TraceCheckUtils]: 76: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,115 INFO L290 TraceCheckUtils]: 75: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,115 INFO L272 TraceCheckUtils]: 74: Hoare triple {28249#(< ~counter~0 31)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,115 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {24678#true} {28249#(< ~counter~0 31)} #61#return; {28249#(< ~counter~0 31)} is VALID [2022-04-27 12:15:35,115 INFO L290 TraceCheckUtils]: 72: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,115 INFO L290 TraceCheckUtils]: 71: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,115 INFO L272 TraceCheckUtils]: 69: Hoare triple {28249#(< ~counter~0 31)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,115 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {24678#true} {28249#(< ~counter~0 31)} #59#return; {28249#(< ~counter~0 31)} is VALID [2022-04-27 12:15:35,116 INFO L290 TraceCheckUtils]: 67: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,116 INFO L272 TraceCheckUtils]: 64: Hoare triple {28249#(< ~counter~0 31)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {28249#(< ~counter~0 31)} assume !!(#t~post5 < 50);havoc #t~post5; {28249#(< ~counter~0 31)} is VALID [2022-04-27 12:15:35,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {28334#(< ~counter~0 30)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28249#(< ~counter~0 31)} is VALID [2022-04-27 12:15:35,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {28334#(< ~counter~0 30)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28334#(< ~counter~0 30)} is VALID [2022-04-27 12:15:35,117 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {24678#true} {28334#(< ~counter~0 30)} #67#return; {28334#(< ~counter~0 30)} is VALID [2022-04-27 12:15:35,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,117 INFO L272 TraceCheckUtils]: 56: Hoare triple {28334#(< ~counter~0 30)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,117 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24678#true} {28334#(< ~counter~0 30)} #65#return; {28334#(< ~counter~0 30)} is VALID [2022-04-27 12:15:35,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,118 INFO L290 TraceCheckUtils]: 52: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,118 INFO L272 TraceCheckUtils]: 51: Hoare triple {28334#(< ~counter~0 30)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,118 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24678#true} {28334#(< ~counter~0 30)} #63#return; {28334#(< ~counter~0 30)} is VALID [2022-04-27 12:15:35,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,118 INFO L272 TraceCheckUtils]: 46: Hoare triple {28334#(< ~counter~0 30)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,118 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24678#true} {28334#(< ~counter~0 30)} #61#return; {28334#(< ~counter~0 30)} is VALID [2022-04-27 12:15:35,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,119 INFO L272 TraceCheckUtils]: 41: Hoare triple {28334#(< ~counter~0 30)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,119 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24678#true} {28334#(< ~counter~0 30)} #59#return; {28334#(< ~counter~0 30)} is VALID [2022-04-27 12:15:35,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,119 INFO L272 TraceCheckUtils]: 36: Hoare triple {28334#(< ~counter~0 30)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {28334#(< ~counter~0 30)} assume !!(#t~post5 < 50);havoc #t~post5; {28334#(< ~counter~0 30)} is VALID [2022-04-27 12:15:35,120 INFO L290 TraceCheckUtils]: 34: Hoare triple {28419#(< ~counter~0 29)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28334#(< ~counter~0 30)} is VALID [2022-04-27 12:15:35,120 INFO L290 TraceCheckUtils]: 33: Hoare triple {28419#(< ~counter~0 29)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28419#(< ~counter~0 29)} is VALID [2022-04-27 12:15:35,120 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {24678#true} {28419#(< ~counter~0 29)} #67#return; {28419#(< ~counter~0 29)} is VALID [2022-04-27 12:15:35,120 INFO L290 TraceCheckUtils]: 31: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,120 INFO L290 TraceCheckUtils]: 30: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,120 INFO L290 TraceCheckUtils]: 29: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,134 INFO L272 TraceCheckUtils]: 28: Hoare triple {28419#(< ~counter~0 29)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,135 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24678#true} {28419#(< ~counter~0 29)} #65#return; {28419#(< ~counter~0 29)} is VALID [2022-04-27 12:15:35,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,135 INFO L272 TraceCheckUtils]: 23: Hoare triple {28419#(< ~counter~0 29)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,135 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24678#true} {28419#(< ~counter~0 29)} #63#return; {28419#(< ~counter~0 29)} is VALID [2022-04-27 12:15:35,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,135 INFO L272 TraceCheckUtils]: 18: Hoare triple {28419#(< ~counter~0 29)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,136 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24678#true} {28419#(< ~counter~0 29)} #61#return; {28419#(< ~counter~0 29)} is VALID [2022-04-27 12:15:35,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,136 INFO L272 TraceCheckUtils]: 13: Hoare triple {28419#(< ~counter~0 29)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,136 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24678#true} {28419#(< ~counter~0 29)} #59#return; {28419#(< ~counter~0 29)} is VALID [2022-04-27 12:15:35,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {24678#true} assume true; {24678#true} is VALID [2022-04-27 12:15:35,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {24678#true} assume !(0 == ~cond); {24678#true} is VALID [2022-04-27 12:15:35,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {24678#true} ~cond := #in~cond; {24678#true} is VALID [2022-04-27 12:15:35,136 INFO L272 TraceCheckUtils]: 8: Hoare triple {28419#(< ~counter~0 29)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {24678#true} is VALID [2022-04-27 12:15:35,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {28419#(< ~counter~0 29)} assume !!(#t~post5 < 50);havoc #t~post5; {28419#(< ~counter~0 29)} is VALID [2022-04-27 12:15:35,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {28504#(< ~counter~0 28)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28419#(< ~counter~0 29)} is VALID [2022-04-27 12:15:35,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {28504#(< ~counter~0 28)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {28504#(< ~counter~0 28)} is VALID [2022-04-27 12:15:35,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {28504#(< ~counter~0 28)} call #t~ret6 := main(); {28504#(< ~counter~0 28)} is VALID [2022-04-27 12:15:35,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28504#(< ~counter~0 28)} {24678#true} #81#return; {28504#(< ~counter~0 28)} is VALID [2022-04-27 12:15:35,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {28504#(< ~counter~0 28)} assume true; {28504#(< ~counter~0 28)} is VALID [2022-04-27 12:15:35,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {24678#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28504#(< ~counter~0 28)} is VALID [2022-04-27 12:15:35,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {24678#true} call ULTIMATE.init(); {24678#true} is VALID [2022-04-27 12:15:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 26534 backedges. 222 proven. 1892 refuted. 0 times theorem prover too weak. 24420 trivial. 0 not checked. [2022-04-27 12:15:35,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:35,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495573298] [2022-04-27 12:15:35,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:35,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331784321] [2022-04-27 12:15:35,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331784321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:15:35,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:15:35,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-27 12:15:35,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072748636] [2022-04-27 12:15:35,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:15:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) Word has length 633 [2022-04-27 12:15:35,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:35,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-27 12:15:35,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 666 edges. 666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:35,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 12:15:35,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 12:15:35,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 12:15:35,757 INFO L87 Difference]: Start difference. First operand 630 states and 631 transitions. Second operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-27 12:15:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:46,080 INFO L93 Difference]: Finished difference Result 1312 states and 1336 transitions. [2022-04-27 12:15:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-27 12:15:46,081 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) Word has length 633 [2022-04-27 12:15:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-27 12:15:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 782 transitions. [2022-04-27 12:15:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-27 12:15:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 782 transitions. [2022-04-27 12:15:46,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 782 transitions. [2022-04-27 12:15:46,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 782 edges. 782 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:46,863 INFO L225 Difference]: With dead ends: 1312 [2022-04-27 12:15:46,863 INFO L226 Difference]: Without dead ends: 1302 [2022-04-27 12:15:46,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1217 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-27 12:15:46,865 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 559 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 733 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 733 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:46,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 738 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [733 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-27 12:15:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-04-27 12:15:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2022-04-27 12:15:47,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:47,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1302 states. Second operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-27 12:15:47,464 INFO L74 IsIncluded]: Start isIncluded. First operand 1302 states. Second operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-27 12:15:47,465 INFO L87 Difference]: Start difference. First operand 1302 states. Second operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-27 12:15:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:47,510 INFO L93 Difference]: Finished difference Result 1302 states and 1303 transitions. [2022-04-27 12:15:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-27 12:15:47,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:47,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:47,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) Second operand 1302 states. [2022-04-27 12:15:47,515 INFO L87 Difference]: Start difference. First operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) Second operand 1302 states. [2022-04-27 12:15:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:47,561 INFO L93 Difference]: Finished difference Result 1302 states and 1303 transitions. [2022-04-27 12:15:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-27 12:15:47,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:47,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:47,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:47,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 836 states have (on average 1.0011961722488039) internal successors, (837), 836 states have internal predecessors, (837), 234 states have call successors, (234), 233 states have call predecessors, (234), 231 states have return successors, (232), 232 states have call predecessors, (232), 232 states have call successors, (232) [2022-04-27 12:15:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1303 transitions. [2022-04-27 12:15:47,626 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1303 transitions. Word has length 633 [2022-04-27 12:15:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:47,627 INFO L495 AbstractCegarLoop]: Abstraction has 1302 states and 1303 transitions. [2022-04-27 12:15:47,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 48 states have call successors, (226), 26 states have call predecessors, (226), 26 states have return successors, (224), 47 states have call predecessors, (224), 46 states have call successors, (224) [2022-04-27 12:15:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-27 12:15:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2022-04-27 12:15:47,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:47,661 INFO L195 NwaCegarLoop]: trace histogram [232, 231, 231, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:47,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-27 12:15:47,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:47,898 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:47,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash 966643877, now seen corresponding path program 5 times [2022-04-27 12:15:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:47,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486049501] [2022-04-27 12:15:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:47,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:47,938 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:47,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446095122] [2022-04-27 12:15:47,938 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 12:15:47,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:47,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:47,939 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:15:47,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-27 12:15:55,924 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 163 check-sat command(s) [2022-04-27 12:15:55,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:15:55,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-27 12:15:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:56,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:59,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {34865#true} call ULTIMATE.init(); {34865#true} is VALID [2022-04-27 12:15:59,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {34865#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34873#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:59,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {34873#(<= ~counter~0 0)} assume true; {34873#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:59,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34873#(<= ~counter~0 0)} {34865#true} #81#return; {34873#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:59,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {34873#(<= ~counter~0 0)} call #t~ret6 := main(); {34873#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:59,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {34873#(<= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34873#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:59,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {34873#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {34889#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,990 INFO L272 TraceCheckUtils]: 8: Hoare triple {34889#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {34889#(<= ~counter~0 1)} ~cond := #in~cond; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {34889#(<= ~counter~0 1)} assume !(0 == ~cond); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {34889#(<= ~counter~0 1)} assume true; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,991 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {34889#(<= ~counter~0 1)} {34889#(<= ~counter~0 1)} #59#return; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,991 INFO L272 TraceCheckUtils]: 13: Hoare triple {34889#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {34889#(<= ~counter~0 1)} ~cond := #in~cond; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {34889#(<= ~counter~0 1)} assume !(0 == ~cond); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {34889#(<= ~counter~0 1)} assume true; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,992 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {34889#(<= ~counter~0 1)} {34889#(<= ~counter~0 1)} #61#return; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,993 INFO L272 TraceCheckUtils]: 18: Hoare triple {34889#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {34889#(<= ~counter~0 1)} ~cond := #in~cond; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {34889#(<= ~counter~0 1)} assume !(0 == ~cond); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {34889#(<= ~counter~0 1)} assume true; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,994 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {34889#(<= ~counter~0 1)} {34889#(<= ~counter~0 1)} #63#return; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,994 INFO L272 TraceCheckUtils]: 23: Hoare triple {34889#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {34889#(<= ~counter~0 1)} ~cond := #in~cond; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {34889#(<= ~counter~0 1)} assume !(0 == ~cond); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {34889#(<= ~counter~0 1)} assume true; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,996 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {34889#(<= ~counter~0 1)} {34889#(<= ~counter~0 1)} #65#return; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,996 INFO L272 TraceCheckUtils]: 28: Hoare triple {34889#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {34889#(<= ~counter~0 1)} ~cond := #in~cond; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {34889#(<= ~counter~0 1)} assume !(0 == ~cond); {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {34889#(<= ~counter~0 1)} assume true; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,998 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {34889#(<= ~counter~0 1)} {34889#(<= ~counter~0 1)} #67#return; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {34889#(<= ~counter~0 1)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {34889#(<= ~counter~0 1)} is VALID [2022-04-27 12:15:59,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {34889#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:59,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {34974#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:59,999 INFO L272 TraceCheckUtils]: 36: Hoare triple {34974#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:15:59,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {34974#(<= ~counter~0 2)} ~cond := #in~cond; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {34974#(<= ~counter~0 2)} assume !(0 == ~cond); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {34974#(<= ~counter~0 2)} assume true; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,001 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {34974#(<= ~counter~0 2)} {34974#(<= ~counter~0 2)} #59#return; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,001 INFO L272 TraceCheckUtils]: 41: Hoare triple {34974#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {34974#(<= ~counter~0 2)} ~cond := #in~cond; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {34974#(<= ~counter~0 2)} assume !(0 == ~cond); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {34974#(<= ~counter~0 2)} assume true; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,002 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34974#(<= ~counter~0 2)} {34974#(<= ~counter~0 2)} #61#return; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,003 INFO L272 TraceCheckUtils]: 46: Hoare triple {34974#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {34974#(<= ~counter~0 2)} ~cond := #in~cond; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,003 INFO L290 TraceCheckUtils]: 48: Hoare triple {34974#(<= ~counter~0 2)} assume !(0 == ~cond); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {34974#(<= ~counter~0 2)} assume true; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,004 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {34974#(<= ~counter~0 2)} {34974#(<= ~counter~0 2)} #63#return; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,005 INFO L272 TraceCheckUtils]: 51: Hoare triple {34974#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {34974#(<= ~counter~0 2)} ~cond := #in~cond; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {34974#(<= ~counter~0 2)} assume !(0 == ~cond); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,006 INFO L290 TraceCheckUtils]: 54: Hoare triple {34974#(<= ~counter~0 2)} assume true; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,006 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34974#(<= ~counter~0 2)} {34974#(<= ~counter~0 2)} #65#return; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,007 INFO L272 TraceCheckUtils]: 56: Hoare triple {34974#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {34974#(<= ~counter~0 2)} ~cond := #in~cond; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {34974#(<= ~counter~0 2)} assume !(0 == ~cond); {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {34974#(<= ~counter~0 2)} assume true; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,008 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {34974#(<= ~counter~0 2)} {34974#(<= ~counter~0 2)} #67#return; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {34974#(<= ~counter~0 2)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {34974#(<= ~counter~0 2)} is VALID [2022-04-27 12:16:00,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {34974#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,009 INFO L290 TraceCheckUtils]: 63: Hoare triple {35059#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,010 INFO L272 TraceCheckUtils]: 64: Hoare triple {35059#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,010 INFO L290 TraceCheckUtils]: 65: Hoare triple {35059#(<= ~counter~0 3)} ~cond := #in~cond; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,010 INFO L290 TraceCheckUtils]: 66: Hoare triple {35059#(<= ~counter~0 3)} assume !(0 == ~cond); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,010 INFO L290 TraceCheckUtils]: 67: Hoare triple {35059#(<= ~counter~0 3)} assume true; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,011 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35059#(<= ~counter~0 3)} {35059#(<= ~counter~0 3)} #59#return; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,011 INFO L272 TraceCheckUtils]: 69: Hoare triple {35059#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {35059#(<= ~counter~0 3)} ~cond := #in~cond; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {35059#(<= ~counter~0 3)} assume !(0 == ~cond); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {35059#(<= ~counter~0 3)} assume true; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,013 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35059#(<= ~counter~0 3)} {35059#(<= ~counter~0 3)} #61#return; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,013 INFO L272 TraceCheckUtils]: 74: Hoare triple {35059#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,013 INFO L290 TraceCheckUtils]: 75: Hoare triple {35059#(<= ~counter~0 3)} ~cond := #in~cond; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,014 INFO L290 TraceCheckUtils]: 76: Hoare triple {35059#(<= ~counter~0 3)} assume !(0 == ~cond); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {35059#(<= ~counter~0 3)} assume true; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,014 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35059#(<= ~counter~0 3)} {35059#(<= ~counter~0 3)} #63#return; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,015 INFO L272 TraceCheckUtils]: 79: Hoare triple {35059#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,015 INFO L290 TraceCheckUtils]: 80: Hoare triple {35059#(<= ~counter~0 3)} ~cond := #in~cond; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,016 INFO L290 TraceCheckUtils]: 81: Hoare triple {35059#(<= ~counter~0 3)} assume !(0 == ~cond); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,016 INFO L290 TraceCheckUtils]: 82: Hoare triple {35059#(<= ~counter~0 3)} assume true; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,016 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {35059#(<= ~counter~0 3)} {35059#(<= ~counter~0 3)} #65#return; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,017 INFO L272 TraceCheckUtils]: 84: Hoare triple {35059#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,017 INFO L290 TraceCheckUtils]: 85: Hoare triple {35059#(<= ~counter~0 3)} ~cond := #in~cond; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,017 INFO L290 TraceCheckUtils]: 86: Hoare triple {35059#(<= ~counter~0 3)} assume !(0 == ~cond); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,018 INFO L290 TraceCheckUtils]: 87: Hoare triple {35059#(<= ~counter~0 3)} assume true; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,018 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {35059#(<= ~counter~0 3)} {35059#(<= ~counter~0 3)} #67#return; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,018 INFO L290 TraceCheckUtils]: 89: Hoare triple {35059#(<= ~counter~0 3)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:00,019 INFO L290 TraceCheckUtils]: 90: Hoare triple {35059#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,019 INFO L290 TraceCheckUtils]: 91: Hoare triple {35144#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,020 INFO L272 TraceCheckUtils]: 92: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,020 INFO L290 TraceCheckUtils]: 93: Hoare triple {35144#(<= ~counter~0 4)} ~cond := #in~cond; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,020 INFO L290 TraceCheckUtils]: 94: Hoare triple {35144#(<= ~counter~0 4)} assume !(0 == ~cond); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,020 INFO L290 TraceCheckUtils]: 95: Hoare triple {35144#(<= ~counter~0 4)} assume true; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,021 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35144#(<= ~counter~0 4)} {35144#(<= ~counter~0 4)} #59#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,021 INFO L272 TraceCheckUtils]: 97: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,021 INFO L290 TraceCheckUtils]: 98: Hoare triple {35144#(<= ~counter~0 4)} ~cond := #in~cond; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,022 INFO L290 TraceCheckUtils]: 99: Hoare triple {35144#(<= ~counter~0 4)} assume !(0 == ~cond); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,022 INFO L290 TraceCheckUtils]: 100: Hoare triple {35144#(<= ~counter~0 4)} assume true; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,022 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35144#(<= ~counter~0 4)} {35144#(<= ~counter~0 4)} #61#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,023 INFO L272 TraceCheckUtils]: 102: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,023 INFO L290 TraceCheckUtils]: 103: Hoare triple {35144#(<= ~counter~0 4)} ~cond := #in~cond; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,023 INFO L290 TraceCheckUtils]: 104: Hoare triple {35144#(<= ~counter~0 4)} assume !(0 == ~cond); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,024 INFO L290 TraceCheckUtils]: 105: Hoare triple {35144#(<= ~counter~0 4)} assume true; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,024 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {35144#(<= ~counter~0 4)} {35144#(<= ~counter~0 4)} #63#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,024 INFO L272 TraceCheckUtils]: 107: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,025 INFO L290 TraceCheckUtils]: 108: Hoare triple {35144#(<= ~counter~0 4)} ~cond := #in~cond; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,025 INFO L290 TraceCheckUtils]: 109: Hoare triple {35144#(<= ~counter~0 4)} assume !(0 == ~cond); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,025 INFO L290 TraceCheckUtils]: 110: Hoare triple {35144#(<= ~counter~0 4)} assume true; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,026 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {35144#(<= ~counter~0 4)} {35144#(<= ~counter~0 4)} #65#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,026 INFO L272 TraceCheckUtils]: 112: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,026 INFO L290 TraceCheckUtils]: 113: Hoare triple {35144#(<= ~counter~0 4)} ~cond := #in~cond; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,026 INFO L290 TraceCheckUtils]: 114: Hoare triple {35144#(<= ~counter~0 4)} assume !(0 == ~cond); {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,027 INFO L290 TraceCheckUtils]: 115: Hoare triple {35144#(<= ~counter~0 4)} assume true; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,027 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {35144#(<= ~counter~0 4)} {35144#(<= ~counter~0 4)} #67#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,027 INFO L290 TraceCheckUtils]: 117: Hoare triple {35144#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:00,028 INFO L290 TraceCheckUtils]: 118: Hoare triple {35144#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,028 INFO L290 TraceCheckUtils]: 119: Hoare triple {35229#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,029 INFO L272 TraceCheckUtils]: 120: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,029 INFO L290 TraceCheckUtils]: 121: Hoare triple {35229#(<= ~counter~0 5)} ~cond := #in~cond; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,029 INFO L290 TraceCheckUtils]: 122: Hoare triple {35229#(<= ~counter~0 5)} assume !(0 == ~cond); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,029 INFO L290 TraceCheckUtils]: 123: Hoare triple {35229#(<= ~counter~0 5)} assume true; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,030 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {35229#(<= ~counter~0 5)} {35229#(<= ~counter~0 5)} #59#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,030 INFO L272 TraceCheckUtils]: 125: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,030 INFO L290 TraceCheckUtils]: 126: Hoare triple {35229#(<= ~counter~0 5)} ~cond := #in~cond; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,031 INFO L290 TraceCheckUtils]: 127: Hoare triple {35229#(<= ~counter~0 5)} assume !(0 == ~cond); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,031 INFO L290 TraceCheckUtils]: 128: Hoare triple {35229#(<= ~counter~0 5)} assume true; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,031 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {35229#(<= ~counter~0 5)} {35229#(<= ~counter~0 5)} #61#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,032 INFO L272 TraceCheckUtils]: 130: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,032 INFO L290 TraceCheckUtils]: 131: Hoare triple {35229#(<= ~counter~0 5)} ~cond := #in~cond; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,032 INFO L290 TraceCheckUtils]: 132: Hoare triple {35229#(<= ~counter~0 5)} assume !(0 == ~cond); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,033 INFO L290 TraceCheckUtils]: 133: Hoare triple {35229#(<= ~counter~0 5)} assume true; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,033 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {35229#(<= ~counter~0 5)} {35229#(<= ~counter~0 5)} #63#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,033 INFO L272 TraceCheckUtils]: 135: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,034 INFO L290 TraceCheckUtils]: 136: Hoare triple {35229#(<= ~counter~0 5)} ~cond := #in~cond; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,034 INFO L290 TraceCheckUtils]: 137: Hoare triple {35229#(<= ~counter~0 5)} assume !(0 == ~cond); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,034 INFO L290 TraceCheckUtils]: 138: Hoare triple {35229#(<= ~counter~0 5)} assume true; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,035 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {35229#(<= ~counter~0 5)} {35229#(<= ~counter~0 5)} #65#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,035 INFO L272 TraceCheckUtils]: 140: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,035 INFO L290 TraceCheckUtils]: 141: Hoare triple {35229#(<= ~counter~0 5)} ~cond := #in~cond; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,035 INFO L290 TraceCheckUtils]: 142: Hoare triple {35229#(<= ~counter~0 5)} assume !(0 == ~cond); {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,036 INFO L290 TraceCheckUtils]: 143: Hoare triple {35229#(<= ~counter~0 5)} assume true; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,036 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {35229#(<= ~counter~0 5)} {35229#(<= ~counter~0 5)} #67#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,036 INFO L290 TraceCheckUtils]: 145: Hoare triple {35229#(<= ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:00,037 INFO L290 TraceCheckUtils]: 146: Hoare triple {35229#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,037 INFO L290 TraceCheckUtils]: 147: Hoare triple {35314#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,038 INFO L272 TraceCheckUtils]: 148: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,038 INFO L290 TraceCheckUtils]: 149: Hoare triple {35314#(<= ~counter~0 6)} ~cond := #in~cond; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,038 INFO L290 TraceCheckUtils]: 150: Hoare triple {35314#(<= ~counter~0 6)} assume !(0 == ~cond); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,038 INFO L290 TraceCheckUtils]: 151: Hoare triple {35314#(<= ~counter~0 6)} assume true; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,039 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {35314#(<= ~counter~0 6)} {35314#(<= ~counter~0 6)} #59#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,039 INFO L272 TraceCheckUtils]: 153: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,039 INFO L290 TraceCheckUtils]: 154: Hoare triple {35314#(<= ~counter~0 6)} ~cond := #in~cond; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,040 INFO L290 TraceCheckUtils]: 155: Hoare triple {35314#(<= ~counter~0 6)} assume !(0 == ~cond); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,040 INFO L290 TraceCheckUtils]: 156: Hoare triple {35314#(<= ~counter~0 6)} assume true; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,040 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {35314#(<= ~counter~0 6)} {35314#(<= ~counter~0 6)} #61#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,041 INFO L272 TraceCheckUtils]: 158: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,041 INFO L290 TraceCheckUtils]: 159: Hoare triple {35314#(<= ~counter~0 6)} ~cond := #in~cond; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,041 INFO L290 TraceCheckUtils]: 160: Hoare triple {35314#(<= ~counter~0 6)} assume !(0 == ~cond); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,042 INFO L290 TraceCheckUtils]: 161: Hoare triple {35314#(<= ~counter~0 6)} assume true; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,042 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {35314#(<= ~counter~0 6)} {35314#(<= ~counter~0 6)} #63#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,042 INFO L272 TraceCheckUtils]: 163: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,043 INFO L290 TraceCheckUtils]: 164: Hoare triple {35314#(<= ~counter~0 6)} ~cond := #in~cond; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,043 INFO L290 TraceCheckUtils]: 165: Hoare triple {35314#(<= ~counter~0 6)} assume !(0 == ~cond); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,043 INFO L290 TraceCheckUtils]: 166: Hoare triple {35314#(<= ~counter~0 6)} assume true; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,044 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {35314#(<= ~counter~0 6)} {35314#(<= ~counter~0 6)} #65#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,044 INFO L272 TraceCheckUtils]: 168: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,044 INFO L290 TraceCheckUtils]: 169: Hoare triple {35314#(<= ~counter~0 6)} ~cond := #in~cond; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,045 INFO L290 TraceCheckUtils]: 170: Hoare triple {35314#(<= ~counter~0 6)} assume !(0 == ~cond); {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,045 INFO L290 TraceCheckUtils]: 171: Hoare triple {35314#(<= ~counter~0 6)} assume true; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,045 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {35314#(<= ~counter~0 6)} {35314#(<= ~counter~0 6)} #67#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,045 INFO L290 TraceCheckUtils]: 173: Hoare triple {35314#(<= ~counter~0 6)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:00,046 INFO L290 TraceCheckUtils]: 174: Hoare triple {35314#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,046 INFO L290 TraceCheckUtils]: 175: Hoare triple {35399#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,047 INFO L272 TraceCheckUtils]: 176: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,047 INFO L290 TraceCheckUtils]: 177: Hoare triple {35399#(<= ~counter~0 7)} ~cond := #in~cond; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,047 INFO L290 TraceCheckUtils]: 178: Hoare triple {35399#(<= ~counter~0 7)} assume !(0 == ~cond); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,047 INFO L290 TraceCheckUtils]: 179: Hoare triple {35399#(<= ~counter~0 7)} assume true; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,048 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {35399#(<= ~counter~0 7)} {35399#(<= ~counter~0 7)} #59#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,048 INFO L272 TraceCheckUtils]: 181: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,049 INFO L290 TraceCheckUtils]: 182: Hoare triple {35399#(<= ~counter~0 7)} ~cond := #in~cond; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,049 INFO L290 TraceCheckUtils]: 183: Hoare triple {35399#(<= ~counter~0 7)} assume !(0 == ~cond); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,049 INFO L290 TraceCheckUtils]: 184: Hoare triple {35399#(<= ~counter~0 7)} assume true; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,049 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {35399#(<= ~counter~0 7)} {35399#(<= ~counter~0 7)} #61#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,050 INFO L272 TraceCheckUtils]: 186: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,050 INFO L290 TraceCheckUtils]: 187: Hoare triple {35399#(<= ~counter~0 7)} ~cond := #in~cond; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,050 INFO L290 TraceCheckUtils]: 188: Hoare triple {35399#(<= ~counter~0 7)} assume !(0 == ~cond); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,051 INFO L290 TraceCheckUtils]: 189: Hoare triple {35399#(<= ~counter~0 7)} assume true; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,051 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {35399#(<= ~counter~0 7)} {35399#(<= ~counter~0 7)} #63#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,051 INFO L272 TraceCheckUtils]: 191: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,052 INFO L290 TraceCheckUtils]: 192: Hoare triple {35399#(<= ~counter~0 7)} ~cond := #in~cond; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,052 INFO L290 TraceCheckUtils]: 193: Hoare triple {35399#(<= ~counter~0 7)} assume !(0 == ~cond); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,052 INFO L290 TraceCheckUtils]: 194: Hoare triple {35399#(<= ~counter~0 7)} assume true; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,053 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {35399#(<= ~counter~0 7)} {35399#(<= ~counter~0 7)} #65#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,053 INFO L272 TraceCheckUtils]: 196: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,053 INFO L290 TraceCheckUtils]: 197: Hoare triple {35399#(<= ~counter~0 7)} ~cond := #in~cond; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,054 INFO L290 TraceCheckUtils]: 198: Hoare triple {35399#(<= ~counter~0 7)} assume !(0 == ~cond); {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,054 INFO L290 TraceCheckUtils]: 199: Hoare triple {35399#(<= ~counter~0 7)} assume true; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,054 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {35399#(<= ~counter~0 7)} {35399#(<= ~counter~0 7)} #67#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,055 INFO L290 TraceCheckUtils]: 201: Hoare triple {35399#(<= ~counter~0 7)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:00,055 INFO L290 TraceCheckUtils]: 202: Hoare triple {35399#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,055 INFO L290 TraceCheckUtils]: 203: Hoare triple {35484#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,056 INFO L272 TraceCheckUtils]: 204: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,056 INFO L290 TraceCheckUtils]: 205: Hoare triple {35484#(<= ~counter~0 8)} ~cond := #in~cond; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,056 INFO L290 TraceCheckUtils]: 206: Hoare triple {35484#(<= ~counter~0 8)} assume !(0 == ~cond); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,056 INFO L290 TraceCheckUtils]: 207: Hoare triple {35484#(<= ~counter~0 8)} assume true; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,057 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {35484#(<= ~counter~0 8)} {35484#(<= ~counter~0 8)} #59#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,057 INFO L272 TraceCheckUtils]: 209: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,058 INFO L290 TraceCheckUtils]: 210: Hoare triple {35484#(<= ~counter~0 8)} ~cond := #in~cond; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,058 INFO L290 TraceCheckUtils]: 211: Hoare triple {35484#(<= ~counter~0 8)} assume !(0 == ~cond); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,058 INFO L290 TraceCheckUtils]: 212: Hoare triple {35484#(<= ~counter~0 8)} assume true; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,058 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {35484#(<= ~counter~0 8)} {35484#(<= ~counter~0 8)} #61#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,080 INFO L272 TraceCheckUtils]: 214: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,080 INFO L290 TraceCheckUtils]: 215: Hoare triple {35484#(<= ~counter~0 8)} ~cond := #in~cond; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,081 INFO L290 TraceCheckUtils]: 216: Hoare triple {35484#(<= ~counter~0 8)} assume !(0 == ~cond); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,081 INFO L290 TraceCheckUtils]: 217: Hoare triple {35484#(<= ~counter~0 8)} assume true; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,081 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {35484#(<= ~counter~0 8)} {35484#(<= ~counter~0 8)} #63#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,082 INFO L272 TraceCheckUtils]: 219: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,082 INFO L290 TraceCheckUtils]: 220: Hoare triple {35484#(<= ~counter~0 8)} ~cond := #in~cond; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,082 INFO L290 TraceCheckUtils]: 221: Hoare triple {35484#(<= ~counter~0 8)} assume !(0 == ~cond); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,082 INFO L290 TraceCheckUtils]: 222: Hoare triple {35484#(<= ~counter~0 8)} assume true; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,083 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {35484#(<= ~counter~0 8)} {35484#(<= ~counter~0 8)} #65#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,083 INFO L272 TraceCheckUtils]: 224: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,084 INFO L290 TraceCheckUtils]: 225: Hoare triple {35484#(<= ~counter~0 8)} ~cond := #in~cond; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,084 INFO L290 TraceCheckUtils]: 226: Hoare triple {35484#(<= ~counter~0 8)} assume !(0 == ~cond); {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,084 INFO L290 TraceCheckUtils]: 227: Hoare triple {35484#(<= ~counter~0 8)} assume true; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,084 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {35484#(<= ~counter~0 8)} {35484#(<= ~counter~0 8)} #67#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,085 INFO L290 TraceCheckUtils]: 229: Hoare triple {35484#(<= ~counter~0 8)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:00,086 INFO L290 TraceCheckUtils]: 230: Hoare triple {35484#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,086 INFO L290 TraceCheckUtils]: 231: Hoare triple {35569#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,086 INFO L272 TraceCheckUtils]: 232: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,086 INFO L290 TraceCheckUtils]: 233: Hoare triple {35569#(<= ~counter~0 9)} ~cond := #in~cond; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,087 INFO L290 TraceCheckUtils]: 234: Hoare triple {35569#(<= ~counter~0 9)} assume !(0 == ~cond); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,087 INFO L290 TraceCheckUtils]: 235: Hoare triple {35569#(<= ~counter~0 9)} assume true; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,087 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {35569#(<= ~counter~0 9)} {35569#(<= ~counter~0 9)} #59#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,088 INFO L272 TraceCheckUtils]: 237: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,088 INFO L290 TraceCheckUtils]: 238: Hoare triple {35569#(<= ~counter~0 9)} ~cond := #in~cond; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,088 INFO L290 TraceCheckUtils]: 239: Hoare triple {35569#(<= ~counter~0 9)} assume !(0 == ~cond); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,089 INFO L290 TraceCheckUtils]: 240: Hoare triple {35569#(<= ~counter~0 9)} assume true; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,089 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {35569#(<= ~counter~0 9)} {35569#(<= ~counter~0 9)} #61#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,089 INFO L272 TraceCheckUtils]: 242: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,090 INFO L290 TraceCheckUtils]: 243: Hoare triple {35569#(<= ~counter~0 9)} ~cond := #in~cond; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,090 INFO L290 TraceCheckUtils]: 244: Hoare triple {35569#(<= ~counter~0 9)} assume !(0 == ~cond); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,090 INFO L290 TraceCheckUtils]: 245: Hoare triple {35569#(<= ~counter~0 9)} assume true; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,091 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {35569#(<= ~counter~0 9)} {35569#(<= ~counter~0 9)} #63#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,091 INFO L272 TraceCheckUtils]: 247: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,091 INFO L290 TraceCheckUtils]: 248: Hoare triple {35569#(<= ~counter~0 9)} ~cond := #in~cond; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,091 INFO L290 TraceCheckUtils]: 249: Hoare triple {35569#(<= ~counter~0 9)} assume !(0 == ~cond); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,092 INFO L290 TraceCheckUtils]: 250: Hoare triple {35569#(<= ~counter~0 9)} assume true; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,092 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {35569#(<= ~counter~0 9)} {35569#(<= ~counter~0 9)} #65#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,092 INFO L272 TraceCheckUtils]: 252: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,093 INFO L290 TraceCheckUtils]: 253: Hoare triple {35569#(<= ~counter~0 9)} ~cond := #in~cond; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,093 INFO L290 TraceCheckUtils]: 254: Hoare triple {35569#(<= ~counter~0 9)} assume !(0 == ~cond); {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,093 INFO L290 TraceCheckUtils]: 255: Hoare triple {35569#(<= ~counter~0 9)} assume true; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,093 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {35569#(<= ~counter~0 9)} {35569#(<= ~counter~0 9)} #67#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,094 INFO L290 TraceCheckUtils]: 257: Hoare triple {35569#(<= ~counter~0 9)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:00,094 INFO L290 TraceCheckUtils]: 258: Hoare triple {35569#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,094 INFO L290 TraceCheckUtils]: 259: Hoare triple {35654#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,095 INFO L272 TraceCheckUtils]: 260: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,095 INFO L290 TraceCheckUtils]: 261: Hoare triple {35654#(<= ~counter~0 10)} ~cond := #in~cond; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,095 INFO L290 TraceCheckUtils]: 262: Hoare triple {35654#(<= ~counter~0 10)} assume !(0 == ~cond); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,096 INFO L290 TraceCheckUtils]: 263: Hoare triple {35654#(<= ~counter~0 10)} assume true; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,096 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {35654#(<= ~counter~0 10)} {35654#(<= ~counter~0 10)} #59#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,096 INFO L272 TraceCheckUtils]: 265: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,097 INFO L290 TraceCheckUtils]: 266: Hoare triple {35654#(<= ~counter~0 10)} ~cond := #in~cond; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,097 INFO L290 TraceCheckUtils]: 267: Hoare triple {35654#(<= ~counter~0 10)} assume !(0 == ~cond); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,097 INFO L290 TraceCheckUtils]: 268: Hoare triple {35654#(<= ~counter~0 10)} assume true; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,097 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {35654#(<= ~counter~0 10)} {35654#(<= ~counter~0 10)} #61#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,098 INFO L272 TraceCheckUtils]: 270: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,098 INFO L290 TraceCheckUtils]: 271: Hoare triple {35654#(<= ~counter~0 10)} ~cond := #in~cond; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,098 INFO L290 TraceCheckUtils]: 272: Hoare triple {35654#(<= ~counter~0 10)} assume !(0 == ~cond); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,098 INFO L290 TraceCheckUtils]: 273: Hoare triple {35654#(<= ~counter~0 10)} assume true; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,099 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {35654#(<= ~counter~0 10)} {35654#(<= ~counter~0 10)} #63#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,099 INFO L272 TraceCheckUtils]: 275: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,099 INFO L290 TraceCheckUtils]: 276: Hoare triple {35654#(<= ~counter~0 10)} ~cond := #in~cond; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,100 INFO L290 TraceCheckUtils]: 277: Hoare triple {35654#(<= ~counter~0 10)} assume !(0 == ~cond); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,100 INFO L290 TraceCheckUtils]: 278: Hoare triple {35654#(<= ~counter~0 10)} assume true; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,100 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {35654#(<= ~counter~0 10)} {35654#(<= ~counter~0 10)} #65#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,101 INFO L272 TraceCheckUtils]: 280: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,101 INFO L290 TraceCheckUtils]: 281: Hoare triple {35654#(<= ~counter~0 10)} ~cond := #in~cond; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,101 INFO L290 TraceCheckUtils]: 282: Hoare triple {35654#(<= ~counter~0 10)} assume !(0 == ~cond); {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,101 INFO L290 TraceCheckUtils]: 283: Hoare triple {35654#(<= ~counter~0 10)} assume true; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,102 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {35654#(<= ~counter~0 10)} {35654#(<= ~counter~0 10)} #67#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,102 INFO L290 TraceCheckUtils]: 285: Hoare triple {35654#(<= ~counter~0 10)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:00,102 INFO L290 TraceCheckUtils]: 286: Hoare triple {35654#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,103 INFO L290 TraceCheckUtils]: 287: Hoare triple {35739#(<= ~counter~0 11)} assume !!(#t~post5 < 50);havoc #t~post5; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,103 INFO L272 TraceCheckUtils]: 288: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,103 INFO L290 TraceCheckUtils]: 289: Hoare triple {35739#(<= ~counter~0 11)} ~cond := #in~cond; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,103 INFO L290 TraceCheckUtils]: 290: Hoare triple {35739#(<= ~counter~0 11)} assume !(0 == ~cond); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,104 INFO L290 TraceCheckUtils]: 291: Hoare triple {35739#(<= ~counter~0 11)} assume true; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,104 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {35739#(<= ~counter~0 11)} {35739#(<= ~counter~0 11)} #59#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,104 INFO L272 TraceCheckUtils]: 293: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,105 INFO L290 TraceCheckUtils]: 294: Hoare triple {35739#(<= ~counter~0 11)} ~cond := #in~cond; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,105 INFO L290 TraceCheckUtils]: 295: Hoare triple {35739#(<= ~counter~0 11)} assume !(0 == ~cond); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,105 INFO L290 TraceCheckUtils]: 296: Hoare triple {35739#(<= ~counter~0 11)} assume true; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,105 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {35739#(<= ~counter~0 11)} {35739#(<= ~counter~0 11)} #61#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,106 INFO L272 TraceCheckUtils]: 298: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,106 INFO L290 TraceCheckUtils]: 299: Hoare triple {35739#(<= ~counter~0 11)} ~cond := #in~cond; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,106 INFO L290 TraceCheckUtils]: 300: Hoare triple {35739#(<= ~counter~0 11)} assume !(0 == ~cond); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,107 INFO L290 TraceCheckUtils]: 301: Hoare triple {35739#(<= ~counter~0 11)} assume true; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,107 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {35739#(<= ~counter~0 11)} {35739#(<= ~counter~0 11)} #63#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,107 INFO L272 TraceCheckUtils]: 303: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,108 INFO L290 TraceCheckUtils]: 304: Hoare triple {35739#(<= ~counter~0 11)} ~cond := #in~cond; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,108 INFO L290 TraceCheckUtils]: 305: Hoare triple {35739#(<= ~counter~0 11)} assume !(0 == ~cond); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,108 INFO L290 TraceCheckUtils]: 306: Hoare triple {35739#(<= ~counter~0 11)} assume true; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,108 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {35739#(<= ~counter~0 11)} {35739#(<= ~counter~0 11)} #65#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,109 INFO L272 TraceCheckUtils]: 308: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,109 INFO L290 TraceCheckUtils]: 309: Hoare triple {35739#(<= ~counter~0 11)} ~cond := #in~cond; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,109 INFO L290 TraceCheckUtils]: 310: Hoare triple {35739#(<= ~counter~0 11)} assume !(0 == ~cond); {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,109 INFO L290 TraceCheckUtils]: 311: Hoare triple {35739#(<= ~counter~0 11)} assume true; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,110 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {35739#(<= ~counter~0 11)} {35739#(<= ~counter~0 11)} #67#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,110 INFO L290 TraceCheckUtils]: 313: Hoare triple {35739#(<= ~counter~0 11)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:00,111 INFO L290 TraceCheckUtils]: 314: Hoare triple {35739#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,111 INFO L290 TraceCheckUtils]: 315: Hoare triple {35824#(<= ~counter~0 12)} assume !!(#t~post5 < 50);havoc #t~post5; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,111 INFO L272 TraceCheckUtils]: 316: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,111 INFO L290 TraceCheckUtils]: 317: Hoare triple {35824#(<= ~counter~0 12)} ~cond := #in~cond; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,112 INFO L290 TraceCheckUtils]: 318: Hoare triple {35824#(<= ~counter~0 12)} assume !(0 == ~cond); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,112 INFO L290 TraceCheckUtils]: 319: Hoare triple {35824#(<= ~counter~0 12)} assume true; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,112 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {35824#(<= ~counter~0 12)} {35824#(<= ~counter~0 12)} #59#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,113 INFO L272 TraceCheckUtils]: 321: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,113 INFO L290 TraceCheckUtils]: 322: Hoare triple {35824#(<= ~counter~0 12)} ~cond := #in~cond; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,113 INFO L290 TraceCheckUtils]: 323: Hoare triple {35824#(<= ~counter~0 12)} assume !(0 == ~cond); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,113 INFO L290 TraceCheckUtils]: 324: Hoare triple {35824#(<= ~counter~0 12)} assume true; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,114 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {35824#(<= ~counter~0 12)} {35824#(<= ~counter~0 12)} #61#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,114 INFO L272 TraceCheckUtils]: 326: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,114 INFO L290 TraceCheckUtils]: 327: Hoare triple {35824#(<= ~counter~0 12)} ~cond := #in~cond; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,114 INFO L290 TraceCheckUtils]: 328: Hoare triple {35824#(<= ~counter~0 12)} assume !(0 == ~cond); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,115 INFO L290 TraceCheckUtils]: 329: Hoare triple {35824#(<= ~counter~0 12)} assume true; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,115 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {35824#(<= ~counter~0 12)} {35824#(<= ~counter~0 12)} #63#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,115 INFO L272 TraceCheckUtils]: 331: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,116 INFO L290 TraceCheckUtils]: 332: Hoare triple {35824#(<= ~counter~0 12)} ~cond := #in~cond; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,116 INFO L290 TraceCheckUtils]: 333: Hoare triple {35824#(<= ~counter~0 12)} assume !(0 == ~cond); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,116 INFO L290 TraceCheckUtils]: 334: Hoare triple {35824#(<= ~counter~0 12)} assume true; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,117 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {35824#(<= ~counter~0 12)} {35824#(<= ~counter~0 12)} #65#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,117 INFO L272 TraceCheckUtils]: 336: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,117 INFO L290 TraceCheckUtils]: 337: Hoare triple {35824#(<= ~counter~0 12)} ~cond := #in~cond; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,117 INFO L290 TraceCheckUtils]: 338: Hoare triple {35824#(<= ~counter~0 12)} assume !(0 == ~cond); {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,118 INFO L290 TraceCheckUtils]: 339: Hoare triple {35824#(<= ~counter~0 12)} assume true; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,118 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {35824#(<= ~counter~0 12)} {35824#(<= ~counter~0 12)} #67#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,118 INFO L290 TraceCheckUtils]: 341: Hoare triple {35824#(<= ~counter~0 12)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:00,119 INFO L290 TraceCheckUtils]: 342: Hoare triple {35824#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,119 INFO L290 TraceCheckUtils]: 343: Hoare triple {35909#(<= ~counter~0 13)} assume !!(#t~post5 < 50);havoc #t~post5; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,119 INFO L272 TraceCheckUtils]: 344: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,120 INFO L290 TraceCheckUtils]: 345: Hoare triple {35909#(<= ~counter~0 13)} ~cond := #in~cond; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,120 INFO L290 TraceCheckUtils]: 346: Hoare triple {35909#(<= ~counter~0 13)} assume !(0 == ~cond); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,120 INFO L290 TraceCheckUtils]: 347: Hoare triple {35909#(<= ~counter~0 13)} assume true; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,120 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {35909#(<= ~counter~0 13)} {35909#(<= ~counter~0 13)} #59#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,121 INFO L272 TraceCheckUtils]: 349: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,121 INFO L290 TraceCheckUtils]: 350: Hoare triple {35909#(<= ~counter~0 13)} ~cond := #in~cond; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,121 INFO L290 TraceCheckUtils]: 351: Hoare triple {35909#(<= ~counter~0 13)} assume !(0 == ~cond); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,121 INFO L290 TraceCheckUtils]: 352: Hoare triple {35909#(<= ~counter~0 13)} assume true; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,122 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {35909#(<= ~counter~0 13)} {35909#(<= ~counter~0 13)} #61#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,122 INFO L272 TraceCheckUtils]: 354: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,122 INFO L290 TraceCheckUtils]: 355: Hoare triple {35909#(<= ~counter~0 13)} ~cond := #in~cond; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,123 INFO L290 TraceCheckUtils]: 356: Hoare triple {35909#(<= ~counter~0 13)} assume !(0 == ~cond); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,123 INFO L290 TraceCheckUtils]: 357: Hoare triple {35909#(<= ~counter~0 13)} assume true; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,123 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {35909#(<= ~counter~0 13)} {35909#(<= ~counter~0 13)} #63#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,124 INFO L272 TraceCheckUtils]: 359: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,124 INFO L290 TraceCheckUtils]: 360: Hoare triple {35909#(<= ~counter~0 13)} ~cond := #in~cond; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,124 INFO L290 TraceCheckUtils]: 361: Hoare triple {35909#(<= ~counter~0 13)} assume !(0 == ~cond); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,124 INFO L290 TraceCheckUtils]: 362: Hoare triple {35909#(<= ~counter~0 13)} assume true; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,125 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {35909#(<= ~counter~0 13)} {35909#(<= ~counter~0 13)} #65#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,125 INFO L272 TraceCheckUtils]: 364: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,125 INFO L290 TraceCheckUtils]: 365: Hoare triple {35909#(<= ~counter~0 13)} ~cond := #in~cond; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,126 INFO L290 TraceCheckUtils]: 366: Hoare triple {35909#(<= ~counter~0 13)} assume !(0 == ~cond); {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,126 INFO L290 TraceCheckUtils]: 367: Hoare triple {35909#(<= ~counter~0 13)} assume true; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,126 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {35909#(<= ~counter~0 13)} {35909#(<= ~counter~0 13)} #67#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,126 INFO L290 TraceCheckUtils]: 369: Hoare triple {35909#(<= ~counter~0 13)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:00,127 INFO L290 TraceCheckUtils]: 370: Hoare triple {35909#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,127 INFO L290 TraceCheckUtils]: 371: Hoare triple {35994#(<= ~counter~0 14)} assume !!(#t~post5 < 50);havoc #t~post5; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,127 INFO L272 TraceCheckUtils]: 372: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,128 INFO L290 TraceCheckUtils]: 373: Hoare triple {35994#(<= ~counter~0 14)} ~cond := #in~cond; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,128 INFO L290 TraceCheckUtils]: 374: Hoare triple {35994#(<= ~counter~0 14)} assume !(0 == ~cond); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,128 INFO L290 TraceCheckUtils]: 375: Hoare triple {35994#(<= ~counter~0 14)} assume true; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,128 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {35994#(<= ~counter~0 14)} {35994#(<= ~counter~0 14)} #59#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,129 INFO L272 TraceCheckUtils]: 377: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,129 INFO L290 TraceCheckUtils]: 378: Hoare triple {35994#(<= ~counter~0 14)} ~cond := #in~cond; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,129 INFO L290 TraceCheckUtils]: 379: Hoare triple {35994#(<= ~counter~0 14)} assume !(0 == ~cond); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,130 INFO L290 TraceCheckUtils]: 380: Hoare triple {35994#(<= ~counter~0 14)} assume true; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,130 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {35994#(<= ~counter~0 14)} {35994#(<= ~counter~0 14)} #61#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,130 INFO L272 TraceCheckUtils]: 382: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,131 INFO L290 TraceCheckUtils]: 383: Hoare triple {35994#(<= ~counter~0 14)} ~cond := #in~cond; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,131 INFO L290 TraceCheckUtils]: 384: Hoare triple {35994#(<= ~counter~0 14)} assume !(0 == ~cond); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,131 INFO L290 TraceCheckUtils]: 385: Hoare triple {35994#(<= ~counter~0 14)} assume true; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,131 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {35994#(<= ~counter~0 14)} {35994#(<= ~counter~0 14)} #63#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,132 INFO L272 TraceCheckUtils]: 387: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,132 INFO L290 TraceCheckUtils]: 388: Hoare triple {35994#(<= ~counter~0 14)} ~cond := #in~cond; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,132 INFO L290 TraceCheckUtils]: 389: Hoare triple {35994#(<= ~counter~0 14)} assume !(0 == ~cond); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,132 INFO L290 TraceCheckUtils]: 390: Hoare triple {35994#(<= ~counter~0 14)} assume true; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,133 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {35994#(<= ~counter~0 14)} {35994#(<= ~counter~0 14)} #65#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,133 INFO L272 TraceCheckUtils]: 392: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,133 INFO L290 TraceCheckUtils]: 393: Hoare triple {35994#(<= ~counter~0 14)} ~cond := #in~cond; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,134 INFO L290 TraceCheckUtils]: 394: Hoare triple {35994#(<= ~counter~0 14)} assume !(0 == ~cond); {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,134 INFO L290 TraceCheckUtils]: 395: Hoare triple {35994#(<= ~counter~0 14)} assume true; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,134 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {35994#(<= ~counter~0 14)} {35994#(<= ~counter~0 14)} #67#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,134 INFO L290 TraceCheckUtils]: 397: Hoare triple {35994#(<= ~counter~0 14)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:00,135 INFO L290 TraceCheckUtils]: 398: Hoare triple {35994#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,135 INFO L290 TraceCheckUtils]: 399: Hoare triple {36079#(<= ~counter~0 15)} assume !!(#t~post5 < 50);havoc #t~post5; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,136 INFO L272 TraceCheckUtils]: 400: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,136 INFO L290 TraceCheckUtils]: 401: Hoare triple {36079#(<= ~counter~0 15)} ~cond := #in~cond; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,136 INFO L290 TraceCheckUtils]: 402: Hoare triple {36079#(<= ~counter~0 15)} assume !(0 == ~cond); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,136 INFO L290 TraceCheckUtils]: 403: Hoare triple {36079#(<= ~counter~0 15)} assume true; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,137 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {36079#(<= ~counter~0 15)} {36079#(<= ~counter~0 15)} #59#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,137 INFO L272 TraceCheckUtils]: 405: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,137 INFO L290 TraceCheckUtils]: 406: Hoare triple {36079#(<= ~counter~0 15)} ~cond := #in~cond; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,138 INFO L290 TraceCheckUtils]: 407: Hoare triple {36079#(<= ~counter~0 15)} assume !(0 == ~cond); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,138 INFO L290 TraceCheckUtils]: 408: Hoare triple {36079#(<= ~counter~0 15)} assume true; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,138 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {36079#(<= ~counter~0 15)} {36079#(<= ~counter~0 15)} #61#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,139 INFO L272 TraceCheckUtils]: 410: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,139 INFO L290 TraceCheckUtils]: 411: Hoare triple {36079#(<= ~counter~0 15)} ~cond := #in~cond; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,139 INFO L290 TraceCheckUtils]: 412: Hoare triple {36079#(<= ~counter~0 15)} assume !(0 == ~cond); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,139 INFO L290 TraceCheckUtils]: 413: Hoare triple {36079#(<= ~counter~0 15)} assume true; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,140 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {36079#(<= ~counter~0 15)} {36079#(<= ~counter~0 15)} #63#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,140 INFO L272 TraceCheckUtils]: 415: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,140 INFO L290 TraceCheckUtils]: 416: Hoare triple {36079#(<= ~counter~0 15)} ~cond := #in~cond; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,140 INFO L290 TraceCheckUtils]: 417: Hoare triple {36079#(<= ~counter~0 15)} assume !(0 == ~cond); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,141 INFO L290 TraceCheckUtils]: 418: Hoare triple {36079#(<= ~counter~0 15)} assume true; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,141 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {36079#(<= ~counter~0 15)} {36079#(<= ~counter~0 15)} #65#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,141 INFO L272 TraceCheckUtils]: 420: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,142 INFO L290 TraceCheckUtils]: 421: Hoare triple {36079#(<= ~counter~0 15)} ~cond := #in~cond; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,142 INFO L290 TraceCheckUtils]: 422: Hoare triple {36079#(<= ~counter~0 15)} assume !(0 == ~cond); {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,142 INFO L290 TraceCheckUtils]: 423: Hoare triple {36079#(<= ~counter~0 15)} assume true; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,142 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {36079#(<= ~counter~0 15)} {36079#(<= ~counter~0 15)} #67#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,143 INFO L290 TraceCheckUtils]: 425: Hoare triple {36079#(<= ~counter~0 15)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:00,143 INFO L290 TraceCheckUtils]: 426: Hoare triple {36079#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,144 INFO L290 TraceCheckUtils]: 427: Hoare triple {36164#(<= ~counter~0 16)} assume !!(#t~post5 < 50);havoc #t~post5; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,144 INFO L272 TraceCheckUtils]: 428: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,144 INFO L290 TraceCheckUtils]: 429: Hoare triple {36164#(<= ~counter~0 16)} ~cond := #in~cond; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,144 INFO L290 TraceCheckUtils]: 430: Hoare triple {36164#(<= ~counter~0 16)} assume !(0 == ~cond); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,145 INFO L290 TraceCheckUtils]: 431: Hoare triple {36164#(<= ~counter~0 16)} assume true; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,145 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {36164#(<= ~counter~0 16)} {36164#(<= ~counter~0 16)} #59#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,145 INFO L272 TraceCheckUtils]: 433: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,146 INFO L290 TraceCheckUtils]: 434: Hoare triple {36164#(<= ~counter~0 16)} ~cond := #in~cond; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,146 INFO L290 TraceCheckUtils]: 435: Hoare triple {36164#(<= ~counter~0 16)} assume !(0 == ~cond); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,146 INFO L290 TraceCheckUtils]: 436: Hoare triple {36164#(<= ~counter~0 16)} assume true; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,146 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {36164#(<= ~counter~0 16)} {36164#(<= ~counter~0 16)} #61#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,147 INFO L272 TraceCheckUtils]: 438: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,147 INFO L290 TraceCheckUtils]: 439: Hoare triple {36164#(<= ~counter~0 16)} ~cond := #in~cond; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,147 INFO L290 TraceCheckUtils]: 440: Hoare triple {36164#(<= ~counter~0 16)} assume !(0 == ~cond); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,147 INFO L290 TraceCheckUtils]: 441: Hoare triple {36164#(<= ~counter~0 16)} assume true; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,148 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {36164#(<= ~counter~0 16)} {36164#(<= ~counter~0 16)} #63#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,148 INFO L272 TraceCheckUtils]: 443: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,148 INFO L290 TraceCheckUtils]: 444: Hoare triple {36164#(<= ~counter~0 16)} ~cond := #in~cond; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,149 INFO L290 TraceCheckUtils]: 445: Hoare triple {36164#(<= ~counter~0 16)} assume !(0 == ~cond); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,149 INFO L290 TraceCheckUtils]: 446: Hoare triple {36164#(<= ~counter~0 16)} assume true; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,149 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {36164#(<= ~counter~0 16)} {36164#(<= ~counter~0 16)} #65#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,150 INFO L272 TraceCheckUtils]: 448: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,150 INFO L290 TraceCheckUtils]: 449: Hoare triple {36164#(<= ~counter~0 16)} ~cond := #in~cond; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,150 INFO L290 TraceCheckUtils]: 450: Hoare triple {36164#(<= ~counter~0 16)} assume !(0 == ~cond); {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,150 INFO L290 TraceCheckUtils]: 451: Hoare triple {36164#(<= ~counter~0 16)} assume true; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,151 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {36164#(<= ~counter~0 16)} {36164#(<= ~counter~0 16)} #67#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,151 INFO L290 TraceCheckUtils]: 453: Hoare triple {36164#(<= ~counter~0 16)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:00,151 INFO L290 TraceCheckUtils]: 454: Hoare triple {36164#(<= ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,152 INFO L290 TraceCheckUtils]: 455: Hoare triple {36249#(<= ~counter~0 17)} assume !!(#t~post5 < 50);havoc #t~post5; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,152 INFO L272 TraceCheckUtils]: 456: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,152 INFO L290 TraceCheckUtils]: 457: Hoare triple {36249#(<= ~counter~0 17)} ~cond := #in~cond; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,153 INFO L290 TraceCheckUtils]: 458: Hoare triple {36249#(<= ~counter~0 17)} assume !(0 == ~cond); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,153 INFO L290 TraceCheckUtils]: 459: Hoare triple {36249#(<= ~counter~0 17)} assume true; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,153 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {36249#(<= ~counter~0 17)} {36249#(<= ~counter~0 17)} #59#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,154 INFO L272 TraceCheckUtils]: 461: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,154 INFO L290 TraceCheckUtils]: 462: Hoare triple {36249#(<= ~counter~0 17)} ~cond := #in~cond; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,154 INFO L290 TraceCheckUtils]: 463: Hoare triple {36249#(<= ~counter~0 17)} assume !(0 == ~cond); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,154 INFO L290 TraceCheckUtils]: 464: Hoare triple {36249#(<= ~counter~0 17)} assume true; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,155 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {36249#(<= ~counter~0 17)} {36249#(<= ~counter~0 17)} #61#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,155 INFO L272 TraceCheckUtils]: 466: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,155 INFO L290 TraceCheckUtils]: 467: Hoare triple {36249#(<= ~counter~0 17)} ~cond := #in~cond; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,156 INFO L290 TraceCheckUtils]: 468: Hoare triple {36249#(<= ~counter~0 17)} assume !(0 == ~cond); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,156 INFO L290 TraceCheckUtils]: 469: Hoare triple {36249#(<= ~counter~0 17)} assume true; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,156 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {36249#(<= ~counter~0 17)} {36249#(<= ~counter~0 17)} #63#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,157 INFO L272 TraceCheckUtils]: 471: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,157 INFO L290 TraceCheckUtils]: 472: Hoare triple {36249#(<= ~counter~0 17)} ~cond := #in~cond; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,157 INFO L290 TraceCheckUtils]: 473: Hoare triple {36249#(<= ~counter~0 17)} assume !(0 == ~cond); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,157 INFO L290 TraceCheckUtils]: 474: Hoare triple {36249#(<= ~counter~0 17)} assume true; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,158 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {36249#(<= ~counter~0 17)} {36249#(<= ~counter~0 17)} #65#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,158 INFO L272 TraceCheckUtils]: 476: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,158 INFO L290 TraceCheckUtils]: 477: Hoare triple {36249#(<= ~counter~0 17)} ~cond := #in~cond; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,159 INFO L290 TraceCheckUtils]: 478: Hoare triple {36249#(<= ~counter~0 17)} assume !(0 == ~cond); {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,159 INFO L290 TraceCheckUtils]: 479: Hoare triple {36249#(<= ~counter~0 17)} assume true; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,159 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {36249#(<= ~counter~0 17)} {36249#(<= ~counter~0 17)} #67#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,159 INFO L290 TraceCheckUtils]: 481: Hoare triple {36249#(<= ~counter~0 17)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:00,160 INFO L290 TraceCheckUtils]: 482: Hoare triple {36249#(<= ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,160 INFO L290 TraceCheckUtils]: 483: Hoare triple {36334#(<= ~counter~0 18)} assume !!(#t~post5 < 50);havoc #t~post5; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,161 INFO L272 TraceCheckUtils]: 484: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,161 INFO L290 TraceCheckUtils]: 485: Hoare triple {36334#(<= ~counter~0 18)} ~cond := #in~cond; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,161 INFO L290 TraceCheckUtils]: 486: Hoare triple {36334#(<= ~counter~0 18)} assume !(0 == ~cond); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,161 INFO L290 TraceCheckUtils]: 487: Hoare triple {36334#(<= ~counter~0 18)} assume true; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,162 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {36334#(<= ~counter~0 18)} {36334#(<= ~counter~0 18)} #59#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,162 INFO L272 TraceCheckUtils]: 489: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,162 INFO L290 TraceCheckUtils]: 490: Hoare triple {36334#(<= ~counter~0 18)} ~cond := #in~cond; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,163 INFO L290 TraceCheckUtils]: 491: Hoare triple {36334#(<= ~counter~0 18)} assume !(0 == ~cond); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,163 INFO L290 TraceCheckUtils]: 492: Hoare triple {36334#(<= ~counter~0 18)} assume true; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,163 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {36334#(<= ~counter~0 18)} {36334#(<= ~counter~0 18)} #61#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,164 INFO L272 TraceCheckUtils]: 494: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,164 INFO L290 TraceCheckUtils]: 495: Hoare triple {36334#(<= ~counter~0 18)} ~cond := #in~cond; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,164 INFO L290 TraceCheckUtils]: 496: Hoare triple {36334#(<= ~counter~0 18)} assume !(0 == ~cond); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,164 INFO L290 TraceCheckUtils]: 497: Hoare triple {36334#(<= ~counter~0 18)} assume true; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,165 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {36334#(<= ~counter~0 18)} {36334#(<= ~counter~0 18)} #63#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,165 INFO L272 TraceCheckUtils]: 499: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,165 INFO L290 TraceCheckUtils]: 500: Hoare triple {36334#(<= ~counter~0 18)} ~cond := #in~cond; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,166 INFO L290 TraceCheckUtils]: 501: Hoare triple {36334#(<= ~counter~0 18)} assume !(0 == ~cond); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,166 INFO L290 TraceCheckUtils]: 502: Hoare triple {36334#(<= ~counter~0 18)} assume true; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,166 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {36334#(<= ~counter~0 18)} {36334#(<= ~counter~0 18)} #65#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,167 INFO L272 TraceCheckUtils]: 504: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,167 INFO L290 TraceCheckUtils]: 505: Hoare triple {36334#(<= ~counter~0 18)} ~cond := #in~cond; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,167 INFO L290 TraceCheckUtils]: 506: Hoare triple {36334#(<= ~counter~0 18)} assume !(0 == ~cond); {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,167 INFO L290 TraceCheckUtils]: 507: Hoare triple {36334#(<= ~counter~0 18)} assume true; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,168 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {36334#(<= ~counter~0 18)} {36334#(<= ~counter~0 18)} #67#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,168 INFO L290 TraceCheckUtils]: 509: Hoare triple {36334#(<= ~counter~0 18)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:00,169 INFO L290 TraceCheckUtils]: 510: Hoare triple {36334#(<= ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,169 INFO L290 TraceCheckUtils]: 511: Hoare triple {36419#(<= ~counter~0 19)} assume !!(#t~post5 < 50);havoc #t~post5; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,169 INFO L272 TraceCheckUtils]: 512: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,169 INFO L290 TraceCheckUtils]: 513: Hoare triple {36419#(<= ~counter~0 19)} ~cond := #in~cond; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,170 INFO L290 TraceCheckUtils]: 514: Hoare triple {36419#(<= ~counter~0 19)} assume !(0 == ~cond); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,170 INFO L290 TraceCheckUtils]: 515: Hoare triple {36419#(<= ~counter~0 19)} assume true; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,170 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {36419#(<= ~counter~0 19)} {36419#(<= ~counter~0 19)} #59#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,171 INFO L272 TraceCheckUtils]: 517: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,171 INFO L290 TraceCheckUtils]: 518: Hoare triple {36419#(<= ~counter~0 19)} ~cond := #in~cond; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,171 INFO L290 TraceCheckUtils]: 519: Hoare triple {36419#(<= ~counter~0 19)} assume !(0 == ~cond); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,171 INFO L290 TraceCheckUtils]: 520: Hoare triple {36419#(<= ~counter~0 19)} assume true; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,172 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {36419#(<= ~counter~0 19)} {36419#(<= ~counter~0 19)} #61#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,172 INFO L272 TraceCheckUtils]: 522: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,172 INFO L290 TraceCheckUtils]: 523: Hoare triple {36419#(<= ~counter~0 19)} ~cond := #in~cond; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,173 INFO L290 TraceCheckUtils]: 524: Hoare triple {36419#(<= ~counter~0 19)} assume !(0 == ~cond); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,173 INFO L290 TraceCheckUtils]: 525: Hoare triple {36419#(<= ~counter~0 19)} assume true; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,173 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {36419#(<= ~counter~0 19)} {36419#(<= ~counter~0 19)} #63#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,174 INFO L272 TraceCheckUtils]: 527: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,174 INFO L290 TraceCheckUtils]: 528: Hoare triple {36419#(<= ~counter~0 19)} ~cond := #in~cond; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,174 INFO L290 TraceCheckUtils]: 529: Hoare triple {36419#(<= ~counter~0 19)} assume !(0 == ~cond); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,174 INFO L290 TraceCheckUtils]: 530: Hoare triple {36419#(<= ~counter~0 19)} assume true; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,175 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {36419#(<= ~counter~0 19)} {36419#(<= ~counter~0 19)} #65#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,175 INFO L272 TraceCheckUtils]: 532: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,175 INFO L290 TraceCheckUtils]: 533: Hoare triple {36419#(<= ~counter~0 19)} ~cond := #in~cond; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,175 INFO L290 TraceCheckUtils]: 534: Hoare triple {36419#(<= ~counter~0 19)} assume !(0 == ~cond); {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,176 INFO L290 TraceCheckUtils]: 535: Hoare triple {36419#(<= ~counter~0 19)} assume true; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,176 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {36419#(<= ~counter~0 19)} {36419#(<= ~counter~0 19)} #67#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,176 INFO L290 TraceCheckUtils]: 537: Hoare triple {36419#(<= ~counter~0 19)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:00,177 INFO L290 TraceCheckUtils]: 538: Hoare triple {36419#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,177 INFO L290 TraceCheckUtils]: 539: Hoare triple {36504#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,177 INFO L272 TraceCheckUtils]: 540: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,178 INFO L290 TraceCheckUtils]: 541: Hoare triple {36504#(<= ~counter~0 20)} ~cond := #in~cond; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,178 INFO L290 TraceCheckUtils]: 542: Hoare triple {36504#(<= ~counter~0 20)} assume !(0 == ~cond); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,178 INFO L290 TraceCheckUtils]: 543: Hoare triple {36504#(<= ~counter~0 20)} assume true; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,179 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {36504#(<= ~counter~0 20)} {36504#(<= ~counter~0 20)} #59#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,179 INFO L272 TraceCheckUtils]: 545: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,179 INFO L290 TraceCheckUtils]: 546: Hoare triple {36504#(<= ~counter~0 20)} ~cond := #in~cond; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,179 INFO L290 TraceCheckUtils]: 547: Hoare triple {36504#(<= ~counter~0 20)} assume !(0 == ~cond); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,180 INFO L290 TraceCheckUtils]: 548: Hoare triple {36504#(<= ~counter~0 20)} assume true; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,180 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {36504#(<= ~counter~0 20)} {36504#(<= ~counter~0 20)} #61#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,180 INFO L272 TraceCheckUtils]: 550: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,181 INFO L290 TraceCheckUtils]: 551: Hoare triple {36504#(<= ~counter~0 20)} ~cond := #in~cond; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,181 INFO L290 TraceCheckUtils]: 552: Hoare triple {36504#(<= ~counter~0 20)} assume !(0 == ~cond); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,181 INFO L290 TraceCheckUtils]: 553: Hoare triple {36504#(<= ~counter~0 20)} assume true; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,181 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {36504#(<= ~counter~0 20)} {36504#(<= ~counter~0 20)} #63#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,182 INFO L272 TraceCheckUtils]: 555: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,182 INFO L290 TraceCheckUtils]: 556: Hoare triple {36504#(<= ~counter~0 20)} ~cond := #in~cond; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,182 INFO L290 TraceCheckUtils]: 557: Hoare triple {36504#(<= ~counter~0 20)} assume !(0 == ~cond); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,183 INFO L290 TraceCheckUtils]: 558: Hoare triple {36504#(<= ~counter~0 20)} assume true; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,183 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {36504#(<= ~counter~0 20)} {36504#(<= ~counter~0 20)} #65#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,183 INFO L272 TraceCheckUtils]: 560: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,184 INFO L290 TraceCheckUtils]: 561: Hoare triple {36504#(<= ~counter~0 20)} ~cond := #in~cond; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,184 INFO L290 TraceCheckUtils]: 562: Hoare triple {36504#(<= ~counter~0 20)} assume !(0 == ~cond); {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,184 INFO L290 TraceCheckUtils]: 563: Hoare triple {36504#(<= ~counter~0 20)} assume true; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,184 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {36504#(<= ~counter~0 20)} {36504#(<= ~counter~0 20)} #67#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,185 INFO L290 TraceCheckUtils]: 565: Hoare triple {36504#(<= ~counter~0 20)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:00,185 INFO L290 TraceCheckUtils]: 566: Hoare triple {36504#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,185 INFO L290 TraceCheckUtils]: 567: Hoare triple {36589#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,186 INFO L272 TraceCheckUtils]: 568: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,186 INFO L290 TraceCheckUtils]: 569: Hoare triple {36589#(<= ~counter~0 21)} ~cond := #in~cond; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,186 INFO L290 TraceCheckUtils]: 570: Hoare triple {36589#(<= ~counter~0 21)} assume !(0 == ~cond); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,186 INFO L290 TraceCheckUtils]: 571: Hoare triple {36589#(<= ~counter~0 21)} assume true; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,187 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {36589#(<= ~counter~0 21)} {36589#(<= ~counter~0 21)} #59#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,187 INFO L272 TraceCheckUtils]: 573: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,187 INFO L290 TraceCheckUtils]: 574: Hoare triple {36589#(<= ~counter~0 21)} ~cond := #in~cond; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,188 INFO L290 TraceCheckUtils]: 575: Hoare triple {36589#(<= ~counter~0 21)} assume !(0 == ~cond); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,188 INFO L290 TraceCheckUtils]: 576: Hoare triple {36589#(<= ~counter~0 21)} assume true; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,188 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {36589#(<= ~counter~0 21)} {36589#(<= ~counter~0 21)} #61#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,189 INFO L272 TraceCheckUtils]: 578: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,189 INFO L290 TraceCheckUtils]: 579: Hoare triple {36589#(<= ~counter~0 21)} ~cond := #in~cond; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,189 INFO L290 TraceCheckUtils]: 580: Hoare triple {36589#(<= ~counter~0 21)} assume !(0 == ~cond); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,189 INFO L290 TraceCheckUtils]: 581: Hoare triple {36589#(<= ~counter~0 21)} assume true; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,190 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {36589#(<= ~counter~0 21)} {36589#(<= ~counter~0 21)} #63#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,190 INFO L272 TraceCheckUtils]: 583: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,190 INFO L290 TraceCheckUtils]: 584: Hoare triple {36589#(<= ~counter~0 21)} ~cond := #in~cond; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,191 INFO L290 TraceCheckUtils]: 585: Hoare triple {36589#(<= ~counter~0 21)} assume !(0 == ~cond); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,191 INFO L290 TraceCheckUtils]: 586: Hoare triple {36589#(<= ~counter~0 21)} assume true; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,191 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {36589#(<= ~counter~0 21)} {36589#(<= ~counter~0 21)} #65#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,192 INFO L272 TraceCheckUtils]: 588: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,192 INFO L290 TraceCheckUtils]: 589: Hoare triple {36589#(<= ~counter~0 21)} ~cond := #in~cond; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,192 INFO L290 TraceCheckUtils]: 590: Hoare triple {36589#(<= ~counter~0 21)} assume !(0 == ~cond); {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,192 INFO L290 TraceCheckUtils]: 591: Hoare triple {36589#(<= ~counter~0 21)} assume true; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,193 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {36589#(<= ~counter~0 21)} {36589#(<= ~counter~0 21)} #67#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,193 INFO L290 TraceCheckUtils]: 593: Hoare triple {36589#(<= ~counter~0 21)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:00,193 INFO L290 TraceCheckUtils]: 594: Hoare triple {36589#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,194 INFO L290 TraceCheckUtils]: 595: Hoare triple {36674#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,194 INFO L272 TraceCheckUtils]: 596: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,194 INFO L290 TraceCheckUtils]: 597: Hoare triple {36674#(<= ~counter~0 22)} ~cond := #in~cond; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,194 INFO L290 TraceCheckUtils]: 598: Hoare triple {36674#(<= ~counter~0 22)} assume !(0 == ~cond); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,195 INFO L290 TraceCheckUtils]: 599: Hoare triple {36674#(<= ~counter~0 22)} assume true; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,195 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {36674#(<= ~counter~0 22)} {36674#(<= ~counter~0 22)} #59#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,195 INFO L272 TraceCheckUtils]: 601: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,196 INFO L290 TraceCheckUtils]: 602: Hoare triple {36674#(<= ~counter~0 22)} ~cond := #in~cond; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,196 INFO L290 TraceCheckUtils]: 603: Hoare triple {36674#(<= ~counter~0 22)} assume !(0 == ~cond); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,196 INFO L290 TraceCheckUtils]: 604: Hoare triple {36674#(<= ~counter~0 22)} assume true; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,196 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {36674#(<= ~counter~0 22)} {36674#(<= ~counter~0 22)} #61#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,197 INFO L272 TraceCheckUtils]: 606: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,197 INFO L290 TraceCheckUtils]: 607: Hoare triple {36674#(<= ~counter~0 22)} ~cond := #in~cond; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,197 INFO L290 TraceCheckUtils]: 608: Hoare triple {36674#(<= ~counter~0 22)} assume !(0 == ~cond); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,197 INFO L290 TraceCheckUtils]: 609: Hoare triple {36674#(<= ~counter~0 22)} assume true; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,198 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {36674#(<= ~counter~0 22)} {36674#(<= ~counter~0 22)} #63#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,198 INFO L272 TraceCheckUtils]: 611: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,198 INFO L290 TraceCheckUtils]: 612: Hoare triple {36674#(<= ~counter~0 22)} ~cond := #in~cond; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,199 INFO L290 TraceCheckUtils]: 613: Hoare triple {36674#(<= ~counter~0 22)} assume !(0 == ~cond); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,199 INFO L290 TraceCheckUtils]: 614: Hoare triple {36674#(<= ~counter~0 22)} assume true; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,199 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {36674#(<= ~counter~0 22)} {36674#(<= ~counter~0 22)} #65#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,200 INFO L272 TraceCheckUtils]: 616: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,200 INFO L290 TraceCheckUtils]: 617: Hoare triple {36674#(<= ~counter~0 22)} ~cond := #in~cond; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,200 INFO L290 TraceCheckUtils]: 618: Hoare triple {36674#(<= ~counter~0 22)} assume !(0 == ~cond); {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,200 INFO L290 TraceCheckUtils]: 619: Hoare triple {36674#(<= ~counter~0 22)} assume true; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,201 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {36674#(<= ~counter~0 22)} {36674#(<= ~counter~0 22)} #67#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,201 INFO L290 TraceCheckUtils]: 621: Hoare triple {36674#(<= ~counter~0 22)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:00,202 INFO L290 TraceCheckUtils]: 622: Hoare triple {36674#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,202 INFO L290 TraceCheckUtils]: 623: Hoare triple {36759#(<= ~counter~0 23)} assume !!(#t~post5 < 50);havoc #t~post5; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,202 INFO L272 TraceCheckUtils]: 624: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,202 INFO L290 TraceCheckUtils]: 625: Hoare triple {36759#(<= ~counter~0 23)} ~cond := #in~cond; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,203 INFO L290 TraceCheckUtils]: 626: Hoare triple {36759#(<= ~counter~0 23)} assume !(0 == ~cond); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,203 INFO L290 TraceCheckUtils]: 627: Hoare triple {36759#(<= ~counter~0 23)} assume true; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,203 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {36759#(<= ~counter~0 23)} {36759#(<= ~counter~0 23)} #59#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,204 INFO L272 TraceCheckUtils]: 629: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,204 INFO L290 TraceCheckUtils]: 630: Hoare triple {36759#(<= ~counter~0 23)} ~cond := #in~cond; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,204 INFO L290 TraceCheckUtils]: 631: Hoare triple {36759#(<= ~counter~0 23)} assume !(0 == ~cond); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,204 INFO L290 TraceCheckUtils]: 632: Hoare triple {36759#(<= ~counter~0 23)} assume true; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,205 INFO L284 TraceCheckUtils]: 633: Hoare quadruple {36759#(<= ~counter~0 23)} {36759#(<= ~counter~0 23)} #61#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,205 INFO L272 TraceCheckUtils]: 634: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,205 INFO L290 TraceCheckUtils]: 635: Hoare triple {36759#(<= ~counter~0 23)} ~cond := #in~cond; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,205 INFO L290 TraceCheckUtils]: 636: Hoare triple {36759#(<= ~counter~0 23)} assume !(0 == ~cond); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,206 INFO L290 TraceCheckUtils]: 637: Hoare triple {36759#(<= ~counter~0 23)} assume true; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,206 INFO L284 TraceCheckUtils]: 638: Hoare quadruple {36759#(<= ~counter~0 23)} {36759#(<= ~counter~0 23)} #63#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,206 INFO L272 TraceCheckUtils]: 639: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,207 INFO L290 TraceCheckUtils]: 640: Hoare triple {36759#(<= ~counter~0 23)} ~cond := #in~cond; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,207 INFO L290 TraceCheckUtils]: 641: Hoare triple {36759#(<= ~counter~0 23)} assume !(0 == ~cond); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,207 INFO L290 TraceCheckUtils]: 642: Hoare triple {36759#(<= ~counter~0 23)} assume true; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,207 INFO L284 TraceCheckUtils]: 643: Hoare quadruple {36759#(<= ~counter~0 23)} {36759#(<= ~counter~0 23)} #65#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,208 INFO L272 TraceCheckUtils]: 644: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,208 INFO L290 TraceCheckUtils]: 645: Hoare triple {36759#(<= ~counter~0 23)} ~cond := #in~cond; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,208 INFO L290 TraceCheckUtils]: 646: Hoare triple {36759#(<= ~counter~0 23)} assume !(0 == ~cond); {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,209 INFO L290 TraceCheckUtils]: 647: Hoare triple {36759#(<= ~counter~0 23)} assume true; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,209 INFO L284 TraceCheckUtils]: 648: Hoare quadruple {36759#(<= ~counter~0 23)} {36759#(<= ~counter~0 23)} #67#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,209 INFO L290 TraceCheckUtils]: 649: Hoare triple {36759#(<= ~counter~0 23)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:00,210 INFO L290 TraceCheckUtils]: 650: Hoare triple {36759#(<= ~counter~0 23)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,210 INFO L290 TraceCheckUtils]: 651: Hoare triple {36844#(<= ~counter~0 24)} assume !!(#t~post5 < 50);havoc #t~post5; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,210 INFO L272 TraceCheckUtils]: 652: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,211 INFO L290 TraceCheckUtils]: 653: Hoare triple {36844#(<= ~counter~0 24)} ~cond := #in~cond; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,211 INFO L290 TraceCheckUtils]: 654: Hoare triple {36844#(<= ~counter~0 24)} assume !(0 == ~cond); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,211 INFO L290 TraceCheckUtils]: 655: Hoare triple {36844#(<= ~counter~0 24)} assume true; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,211 INFO L284 TraceCheckUtils]: 656: Hoare quadruple {36844#(<= ~counter~0 24)} {36844#(<= ~counter~0 24)} #59#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,212 INFO L272 TraceCheckUtils]: 657: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,212 INFO L290 TraceCheckUtils]: 658: Hoare triple {36844#(<= ~counter~0 24)} ~cond := #in~cond; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,212 INFO L290 TraceCheckUtils]: 659: Hoare triple {36844#(<= ~counter~0 24)} assume !(0 == ~cond); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,212 INFO L290 TraceCheckUtils]: 660: Hoare triple {36844#(<= ~counter~0 24)} assume true; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,213 INFO L284 TraceCheckUtils]: 661: Hoare quadruple {36844#(<= ~counter~0 24)} {36844#(<= ~counter~0 24)} #61#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,213 INFO L272 TraceCheckUtils]: 662: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,213 INFO L290 TraceCheckUtils]: 663: Hoare triple {36844#(<= ~counter~0 24)} ~cond := #in~cond; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,214 INFO L290 TraceCheckUtils]: 664: Hoare triple {36844#(<= ~counter~0 24)} assume !(0 == ~cond); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,214 INFO L290 TraceCheckUtils]: 665: Hoare triple {36844#(<= ~counter~0 24)} assume true; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,214 INFO L284 TraceCheckUtils]: 666: Hoare quadruple {36844#(<= ~counter~0 24)} {36844#(<= ~counter~0 24)} #63#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,215 INFO L272 TraceCheckUtils]: 667: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,215 INFO L290 TraceCheckUtils]: 668: Hoare triple {36844#(<= ~counter~0 24)} ~cond := #in~cond; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,215 INFO L290 TraceCheckUtils]: 669: Hoare triple {36844#(<= ~counter~0 24)} assume !(0 == ~cond); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,215 INFO L290 TraceCheckUtils]: 670: Hoare triple {36844#(<= ~counter~0 24)} assume true; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,216 INFO L284 TraceCheckUtils]: 671: Hoare quadruple {36844#(<= ~counter~0 24)} {36844#(<= ~counter~0 24)} #65#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,216 INFO L272 TraceCheckUtils]: 672: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,216 INFO L290 TraceCheckUtils]: 673: Hoare triple {36844#(<= ~counter~0 24)} ~cond := #in~cond; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,217 INFO L290 TraceCheckUtils]: 674: Hoare triple {36844#(<= ~counter~0 24)} assume !(0 == ~cond); {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,217 INFO L290 TraceCheckUtils]: 675: Hoare triple {36844#(<= ~counter~0 24)} assume true; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,217 INFO L284 TraceCheckUtils]: 676: Hoare quadruple {36844#(<= ~counter~0 24)} {36844#(<= ~counter~0 24)} #67#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,217 INFO L290 TraceCheckUtils]: 677: Hoare triple {36844#(<= ~counter~0 24)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:00,218 INFO L290 TraceCheckUtils]: 678: Hoare triple {36844#(<= ~counter~0 24)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,218 INFO L290 TraceCheckUtils]: 679: Hoare triple {36929#(<= ~counter~0 25)} assume !!(#t~post5 < 50);havoc #t~post5; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,218 INFO L272 TraceCheckUtils]: 680: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,219 INFO L290 TraceCheckUtils]: 681: Hoare triple {36929#(<= ~counter~0 25)} ~cond := #in~cond; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,219 INFO L290 TraceCheckUtils]: 682: Hoare triple {36929#(<= ~counter~0 25)} assume !(0 == ~cond); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,219 INFO L290 TraceCheckUtils]: 683: Hoare triple {36929#(<= ~counter~0 25)} assume true; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,220 INFO L284 TraceCheckUtils]: 684: Hoare quadruple {36929#(<= ~counter~0 25)} {36929#(<= ~counter~0 25)} #59#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,220 INFO L272 TraceCheckUtils]: 685: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,220 INFO L290 TraceCheckUtils]: 686: Hoare triple {36929#(<= ~counter~0 25)} ~cond := #in~cond; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,220 INFO L290 TraceCheckUtils]: 687: Hoare triple {36929#(<= ~counter~0 25)} assume !(0 == ~cond); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,221 INFO L290 TraceCheckUtils]: 688: Hoare triple {36929#(<= ~counter~0 25)} assume true; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,221 INFO L284 TraceCheckUtils]: 689: Hoare quadruple {36929#(<= ~counter~0 25)} {36929#(<= ~counter~0 25)} #61#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,221 INFO L272 TraceCheckUtils]: 690: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,222 INFO L290 TraceCheckUtils]: 691: Hoare triple {36929#(<= ~counter~0 25)} ~cond := #in~cond; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,222 INFO L290 TraceCheckUtils]: 692: Hoare triple {36929#(<= ~counter~0 25)} assume !(0 == ~cond); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,222 INFO L290 TraceCheckUtils]: 693: Hoare triple {36929#(<= ~counter~0 25)} assume true; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,222 INFO L284 TraceCheckUtils]: 694: Hoare quadruple {36929#(<= ~counter~0 25)} {36929#(<= ~counter~0 25)} #63#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,223 INFO L272 TraceCheckUtils]: 695: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,223 INFO L290 TraceCheckUtils]: 696: Hoare triple {36929#(<= ~counter~0 25)} ~cond := #in~cond; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,223 INFO L290 TraceCheckUtils]: 697: Hoare triple {36929#(<= ~counter~0 25)} assume !(0 == ~cond); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,224 INFO L290 TraceCheckUtils]: 698: Hoare triple {36929#(<= ~counter~0 25)} assume true; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,224 INFO L284 TraceCheckUtils]: 699: Hoare quadruple {36929#(<= ~counter~0 25)} {36929#(<= ~counter~0 25)} #65#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,224 INFO L272 TraceCheckUtils]: 700: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,225 INFO L290 TraceCheckUtils]: 701: Hoare triple {36929#(<= ~counter~0 25)} ~cond := #in~cond; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,225 INFO L290 TraceCheckUtils]: 702: Hoare triple {36929#(<= ~counter~0 25)} assume !(0 == ~cond); {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,225 INFO L290 TraceCheckUtils]: 703: Hoare triple {36929#(<= ~counter~0 25)} assume true; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,225 INFO L284 TraceCheckUtils]: 704: Hoare quadruple {36929#(<= ~counter~0 25)} {36929#(<= ~counter~0 25)} #67#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,226 INFO L290 TraceCheckUtils]: 705: Hoare triple {36929#(<= ~counter~0 25)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:00,226 INFO L290 TraceCheckUtils]: 706: Hoare triple {36929#(<= ~counter~0 25)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,226 INFO L290 TraceCheckUtils]: 707: Hoare triple {37014#(<= ~counter~0 26)} assume !!(#t~post5 < 50);havoc #t~post5; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,227 INFO L272 TraceCheckUtils]: 708: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,227 INFO L290 TraceCheckUtils]: 709: Hoare triple {37014#(<= ~counter~0 26)} ~cond := #in~cond; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,227 INFO L290 TraceCheckUtils]: 710: Hoare triple {37014#(<= ~counter~0 26)} assume !(0 == ~cond); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,227 INFO L290 TraceCheckUtils]: 711: Hoare triple {37014#(<= ~counter~0 26)} assume true; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,228 INFO L284 TraceCheckUtils]: 712: Hoare quadruple {37014#(<= ~counter~0 26)} {37014#(<= ~counter~0 26)} #59#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,228 INFO L272 TraceCheckUtils]: 713: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,228 INFO L290 TraceCheckUtils]: 714: Hoare triple {37014#(<= ~counter~0 26)} ~cond := #in~cond; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,229 INFO L290 TraceCheckUtils]: 715: Hoare triple {37014#(<= ~counter~0 26)} assume !(0 == ~cond); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,229 INFO L290 TraceCheckUtils]: 716: Hoare triple {37014#(<= ~counter~0 26)} assume true; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,229 INFO L284 TraceCheckUtils]: 717: Hoare quadruple {37014#(<= ~counter~0 26)} {37014#(<= ~counter~0 26)} #61#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,230 INFO L272 TraceCheckUtils]: 718: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,230 INFO L290 TraceCheckUtils]: 719: Hoare triple {37014#(<= ~counter~0 26)} ~cond := #in~cond; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,230 INFO L290 TraceCheckUtils]: 720: Hoare triple {37014#(<= ~counter~0 26)} assume !(0 == ~cond); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,230 INFO L290 TraceCheckUtils]: 721: Hoare triple {37014#(<= ~counter~0 26)} assume true; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,231 INFO L284 TraceCheckUtils]: 722: Hoare quadruple {37014#(<= ~counter~0 26)} {37014#(<= ~counter~0 26)} #63#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,231 INFO L272 TraceCheckUtils]: 723: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,231 INFO L290 TraceCheckUtils]: 724: Hoare triple {37014#(<= ~counter~0 26)} ~cond := #in~cond; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,232 INFO L290 TraceCheckUtils]: 725: Hoare triple {37014#(<= ~counter~0 26)} assume !(0 == ~cond); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,232 INFO L290 TraceCheckUtils]: 726: Hoare triple {37014#(<= ~counter~0 26)} assume true; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,232 INFO L284 TraceCheckUtils]: 727: Hoare quadruple {37014#(<= ~counter~0 26)} {37014#(<= ~counter~0 26)} #65#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,233 INFO L272 TraceCheckUtils]: 728: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,233 INFO L290 TraceCheckUtils]: 729: Hoare triple {37014#(<= ~counter~0 26)} ~cond := #in~cond; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,233 INFO L290 TraceCheckUtils]: 730: Hoare triple {37014#(<= ~counter~0 26)} assume !(0 == ~cond); {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,233 INFO L290 TraceCheckUtils]: 731: Hoare triple {37014#(<= ~counter~0 26)} assume true; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,234 INFO L284 TraceCheckUtils]: 732: Hoare quadruple {37014#(<= ~counter~0 26)} {37014#(<= ~counter~0 26)} #67#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,234 INFO L290 TraceCheckUtils]: 733: Hoare triple {37014#(<= ~counter~0 26)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:00,234 INFO L290 TraceCheckUtils]: 734: Hoare triple {37014#(<= ~counter~0 26)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,235 INFO L290 TraceCheckUtils]: 735: Hoare triple {37099#(<= ~counter~0 27)} assume !!(#t~post5 < 50);havoc #t~post5; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,235 INFO L272 TraceCheckUtils]: 736: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,235 INFO L290 TraceCheckUtils]: 737: Hoare triple {37099#(<= ~counter~0 27)} ~cond := #in~cond; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,236 INFO L290 TraceCheckUtils]: 738: Hoare triple {37099#(<= ~counter~0 27)} assume !(0 == ~cond); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,236 INFO L290 TraceCheckUtils]: 739: Hoare triple {37099#(<= ~counter~0 27)} assume true; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,236 INFO L284 TraceCheckUtils]: 740: Hoare quadruple {37099#(<= ~counter~0 27)} {37099#(<= ~counter~0 27)} #59#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,237 INFO L272 TraceCheckUtils]: 741: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,237 INFO L290 TraceCheckUtils]: 742: Hoare triple {37099#(<= ~counter~0 27)} ~cond := #in~cond; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,237 INFO L290 TraceCheckUtils]: 743: Hoare triple {37099#(<= ~counter~0 27)} assume !(0 == ~cond); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,237 INFO L290 TraceCheckUtils]: 744: Hoare triple {37099#(<= ~counter~0 27)} assume true; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,238 INFO L284 TraceCheckUtils]: 745: Hoare quadruple {37099#(<= ~counter~0 27)} {37099#(<= ~counter~0 27)} #61#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,238 INFO L272 TraceCheckUtils]: 746: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,238 INFO L290 TraceCheckUtils]: 747: Hoare triple {37099#(<= ~counter~0 27)} ~cond := #in~cond; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,238 INFO L290 TraceCheckUtils]: 748: Hoare triple {37099#(<= ~counter~0 27)} assume !(0 == ~cond); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,239 INFO L290 TraceCheckUtils]: 749: Hoare triple {37099#(<= ~counter~0 27)} assume true; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,239 INFO L284 TraceCheckUtils]: 750: Hoare quadruple {37099#(<= ~counter~0 27)} {37099#(<= ~counter~0 27)} #63#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,239 INFO L272 TraceCheckUtils]: 751: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,240 INFO L290 TraceCheckUtils]: 752: Hoare triple {37099#(<= ~counter~0 27)} ~cond := #in~cond; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,240 INFO L290 TraceCheckUtils]: 753: Hoare triple {37099#(<= ~counter~0 27)} assume !(0 == ~cond); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,240 INFO L290 TraceCheckUtils]: 754: Hoare triple {37099#(<= ~counter~0 27)} assume true; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,241 INFO L284 TraceCheckUtils]: 755: Hoare quadruple {37099#(<= ~counter~0 27)} {37099#(<= ~counter~0 27)} #65#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,241 INFO L272 TraceCheckUtils]: 756: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,241 INFO L290 TraceCheckUtils]: 757: Hoare triple {37099#(<= ~counter~0 27)} ~cond := #in~cond; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,241 INFO L290 TraceCheckUtils]: 758: Hoare triple {37099#(<= ~counter~0 27)} assume !(0 == ~cond); {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,242 INFO L290 TraceCheckUtils]: 759: Hoare triple {37099#(<= ~counter~0 27)} assume true; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,242 INFO L284 TraceCheckUtils]: 760: Hoare quadruple {37099#(<= ~counter~0 27)} {37099#(<= ~counter~0 27)} #67#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,242 INFO L290 TraceCheckUtils]: 761: Hoare triple {37099#(<= ~counter~0 27)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:00,243 INFO L290 TraceCheckUtils]: 762: Hoare triple {37099#(<= ~counter~0 27)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,243 INFO L290 TraceCheckUtils]: 763: Hoare triple {37184#(<= ~counter~0 28)} assume !!(#t~post5 < 50);havoc #t~post5; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,243 INFO L272 TraceCheckUtils]: 764: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,244 INFO L290 TraceCheckUtils]: 765: Hoare triple {37184#(<= ~counter~0 28)} ~cond := #in~cond; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,244 INFO L290 TraceCheckUtils]: 766: Hoare triple {37184#(<= ~counter~0 28)} assume !(0 == ~cond); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,244 INFO L290 TraceCheckUtils]: 767: Hoare triple {37184#(<= ~counter~0 28)} assume true; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,244 INFO L284 TraceCheckUtils]: 768: Hoare quadruple {37184#(<= ~counter~0 28)} {37184#(<= ~counter~0 28)} #59#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,245 INFO L272 TraceCheckUtils]: 769: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,245 INFO L290 TraceCheckUtils]: 770: Hoare triple {37184#(<= ~counter~0 28)} ~cond := #in~cond; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,245 INFO L290 TraceCheckUtils]: 771: Hoare triple {37184#(<= ~counter~0 28)} assume !(0 == ~cond); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,246 INFO L290 TraceCheckUtils]: 772: Hoare triple {37184#(<= ~counter~0 28)} assume true; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,246 INFO L284 TraceCheckUtils]: 773: Hoare quadruple {37184#(<= ~counter~0 28)} {37184#(<= ~counter~0 28)} #61#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,246 INFO L272 TraceCheckUtils]: 774: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,247 INFO L290 TraceCheckUtils]: 775: Hoare triple {37184#(<= ~counter~0 28)} ~cond := #in~cond; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,247 INFO L290 TraceCheckUtils]: 776: Hoare triple {37184#(<= ~counter~0 28)} assume !(0 == ~cond); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,247 INFO L290 TraceCheckUtils]: 777: Hoare triple {37184#(<= ~counter~0 28)} assume true; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,247 INFO L284 TraceCheckUtils]: 778: Hoare quadruple {37184#(<= ~counter~0 28)} {37184#(<= ~counter~0 28)} #63#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,248 INFO L272 TraceCheckUtils]: 779: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,248 INFO L290 TraceCheckUtils]: 780: Hoare triple {37184#(<= ~counter~0 28)} ~cond := #in~cond; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,248 INFO L290 TraceCheckUtils]: 781: Hoare triple {37184#(<= ~counter~0 28)} assume !(0 == ~cond); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,248 INFO L290 TraceCheckUtils]: 782: Hoare triple {37184#(<= ~counter~0 28)} assume true; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,249 INFO L284 TraceCheckUtils]: 783: Hoare quadruple {37184#(<= ~counter~0 28)} {37184#(<= ~counter~0 28)} #65#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,249 INFO L272 TraceCheckUtils]: 784: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,250 INFO L290 TraceCheckUtils]: 785: Hoare triple {37184#(<= ~counter~0 28)} ~cond := #in~cond; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,250 INFO L290 TraceCheckUtils]: 786: Hoare triple {37184#(<= ~counter~0 28)} assume !(0 == ~cond); {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,250 INFO L290 TraceCheckUtils]: 787: Hoare triple {37184#(<= ~counter~0 28)} assume true; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,250 INFO L284 TraceCheckUtils]: 788: Hoare quadruple {37184#(<= ~counter~0 28)} {37184#(<= ~counter~0 28)} #67#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,251 INFO L290 TraceCheckUtils]: 789: Hoare triple {37184#(<= ~counter~0 28)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:00,251 INFO L290 TraceCheckUtils]: 790: Hoare triple {37184#(<= ~counter~0 28)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,251 INFO L290 TraceCheckUtils]: 791: Hoare triple {37269#(<= ~counter~0 29)} assume !!(#t~post5 < 50);havoc #t~post5; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,252 INFO L272 TraceCheckUtils]: 792: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,252 INFO L290 TraceCheckUtils]: 793: Hoare triple {37269#(<= ~counter~0 29)} ~cond := #in~cond; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,252 INFO L290 TraceCheckUtils]: 794: Hoare triple {37269#(<= ~counter~0 29)} assume !(0 == ~cond); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,252 INFO L290 TraceCheckUtils]: 795: Hoare triple {37269#(<= ~counter~0 29)} assume true; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,253 INFO L284 TraceCheckUtils]: 796: Hoare quadruple {37269#(<= ~counter~0 29)} {37269#(<= ~counter~0 29)} #59#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,253 INFO L272 TraceCheckUtils]: 797: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,253 INFO L290 TraceCheckUtils]: 798: Hoare triple {37269#(<= ~counter~0 29)} ~cond := #in~cond; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,254 INFO L290 TraceCheckUtils]: 799: Hoare triple {37269#(<= ~counter~0 29)} assume !(0 == ~cond); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,254 INFO L290 TraceCheckUtils]: 800: Hoare triple {37269#(<= ~counter~0 29)} assume true; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,254 INFO L284 TraceCheckUtils]: 801: Hoare quadruple {37269#(<= ~counter~0 29)} {37269#(<= ~counter~0 29)} #61#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,255 INFO L272 TraceCheckUtils]: 802: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,255 INFO L290 TraceCheckUtils]: 803: Hoare triple {37269#(<= ~counter~0 29)} ~cond := #in~cond; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,255 INFO L290 TraceCheckUtils]: 804: Hoare triple {37269#(<= ~counter~0 29)} assume !(0 == ~cond); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,255 INFO L290 TraceCheckUtils]: 805: Hoare triple {37269#(<= ~counter~0 29)} assume true; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,256 INFO L284 TraceCheckUtils]: 806: Hoare quadruple {37269#(<= ~counter~0 29)} {37269#(<= ~counter~0 29)} #63#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,256 INFO L272 TraceCheckUtils]: 807: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,256 INFO L290 TraceCheckUtils]: 808: Hoare triple {37269#(<= ~counter~0 29)} ~cond := #in~cond; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,257 INFO L290 TraceCheckUtils]: 809: Hoare triple {37269#(<= ~counter~0 29)} assume !(0 == ~cond); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,257 INFO L290 TraceCheckUtils]: 810: Hoare triple {37269#(<= ~counter~0 29)} assume true; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,257 INFO L284 TraceCheckUtils]: 811: Hoare quadruple {37269#(<= ~counter~0 29)} {37269#(<= ~counter~0 29)} #65#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,258 INFO L272 TraceCheckUtils]: 812: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,258 INFO L290 TraceCheckUtils]: 813: Hoare triple {37269#(<= ~counter~0 29)} ~cond := #in~cond; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,258 INFO L290 TraceCheckUtils]: 814: Hoare triple {37269#(<= ~counter~0 29)} assume !(0 == ~cond); {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,258 INFO L290 TraceCheckUtils]: 815: Hoare triple {37269#(<= ~counter~0 29)} assume true; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,259 INFO L284 TraceCheckUtils]: 816: Hoare quadruple {37269#(<= ~counter~0 29)} {37269#(<= ~counter~0 29)} #67#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,259 INFO L290 TraceCheckUtils]: 817: Hoare triple {37269#(<= ~counter~0 29)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:00,259 INFO L290 TraceCheckUtils]: 818: Hoare triple {37269#(<= ~counter~0 29)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,260 INFO L290 TraceCheckUtils]: 819: Hoare triple {37354#(<= ~counter~0 30)} assume !!(#t~post5 < 50);havoc #t~post5; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,260 INFO L272 TraceCheckUtils]: 820: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,260 INFO L290 TraceCheckUtils]: 821: Hoare triple {37354#(<= ~counter~0 30)} ~cond := #in~cond; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,260 INFO L290 TraceCheckUtils]: 822: Hoare triple {37354#(<= ~counter~0 30)} assume !(0 == ~cond); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,261 INFO L290 TraceCheckUtils]: 823: Hoare triple {37354#(<= ~counter~0 30)} assume true; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,261 INFO L284 TraceCheckUtils]: 824: Hoare quadruple {37354#(<= ~counter~0 30)} {37354#(<= ~counter~0 30)} #59#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,261 INFO L272 TraceCheckUtils]: 825: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,262 INFO L290 TraceCheckUtils]: 826: Hoare triple {37354#(<= ~counter~0 30)} ~cond := #in~cond; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,262 INFO L290 TraceCheckUtils]: 827: Hoare triple {37354#(<= ~counter~0 30)} assume !(0 == ~cond); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,262 INFO L290 TraceCheckUtils]: 828: Hoare triple {37354#(<= ~counter~0 30)} assume true; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,262 INFO L284 TraceCheckUtils]: 829: Hoare quadruple {37354#(<= ~counter~0 30)} {37354#(<= ~counter~0 30)} #61#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,263 INFO L272 TraceCheckUtils]: 830: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,263 INFO L290 TraceCheckUtils]: 831: Hoare triple {37354#(<= ~counter~0 30)} ~cond := #in~cond; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,263 INFO L290 TraceCheckUtils]: 832: Hoare triple {37354#(<= ~counter~0 30)} assume !(0 == ~cond); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,263 INFO L290 TraceCheckUtils]: 833: Hoare triple {37354#(<= ~counter~0 30)} assume true; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,264 INFO L284 TraceCheckUtils]: 834: Hoare quadruple {37354#(<= ~counter~0 30)} {37354#(<= ~counter~0 30)} #63#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,264 INFO L272 TraceCheckUtils]: 835: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,264 INFO L290 TraceCheckUtils]: 836: Hoare triple {37354#(<= ~counter~0 30)} ~cond := #in~cond; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,265 INFO L290 TraceCheckUtils]: 837: Hoare triple {37354#(<= ~counter~0 30)} assume !(0 == ~cond); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,265 INFO L290 TraceCheckUtils]: 838: Hoare triple {37354#(<= ~counter~0 30)} assume true; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,265 INFO L284 TraceCheckUtils]: 839: Hoare quadruple {37354#(<= ~counter~0 30)} {37354#(<= ~counter~0 30)} #65#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,266 INFO L272 TraceCheckUtils]: 840: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,266 INFO L290 TraceCheckUtils]: 841: Hoare triple {37354#(<= ~counter~0 30)} ~cond := #in~cond; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,266 INFO L290 TraceCheckUtils]: 842: Hoare triple {37354#(<= ~counter~0 30)} assume !(0 == ~cond); {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,266 INFO L290 TraceCheckUtils]: 843: Hoare triple {37354#(<= ~counter~0 30)} assume true; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,267 INFO L284 TraceCheckUtils]: 844: Hoare quadruple {37354#(<= ~counter~0 30)} {37354#(<= ~counter~0 30)} #67#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,267 INFO L290 TraceCheckUtils]: 845: Hoare triple {37354#(<= ~counter~0 30)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:00,268 INFO L290 TraceCheckUtils]: 846: Hoare triple {37354#(<= ~counter~0 30)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,268 INFO L290 TraceCheckUtils]: 847: Hoare triple {37439#(<= ~counter~0 31)} assume !!(#t~post5 < 50);havoc #t~post5; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,268 INFO L272 TraceCheckUtils]: 848: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,268 INFO L290 TraceCheckUtils]: 849: Hoare triple {37439#(<= ~counter~0 31)} ~cond := #in~cond; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,269 INFO L290 TraceCheckUtils]: 850: Hoare triple {37439#(<= ~counter~0 31)} assume !(0 == ~cond); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,269 INFO L290 TraceCheckUtils]: 851: Hoare triple {37439#(<= ~counter~0 31)} assume true; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,269 INFO L284 TraceCheckUtils]: 852: Hoare quadruple {37439#(<= ~counter~0 31)} {37439#(<= ~counter~0 31)} #59#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,270 INFO L272 TraceCheckUtils]: 853: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,270 INFO L290 TraceCheckUtils]: 854: Hoare triple {37439#(<= ~counter~0 31)} ~cond := #in~cond; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,270 INFO L290 TraceCheckUtils]: 855: Hoare triple {37439#(<= ~counter~0 31)} assume !(0 == ~cond); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,270 INFO L290 TraceCheckUtils]: 856: Hoare triple {37439#(<= ~counter~0 31)} assume true; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,271 INFO L284 TraceCheckUtils]: 857: Hoare quadruple {37439#(<= ~counter~0 31)} {37439#(<= ~counter~0 31)} #61#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,271 INFO L272 TraceCheckUtils]: 858: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,271 INFO L290 TraceCheckUtils]: 859: Hoare triple {37439#(<= ~counter~0 31)} ~cond := #in~cond; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,271 INFO L290 TraceCheckUtils]: 860: Hoare triple {37439#(<= ~counter~0 31)} assume !(0 == ~cond); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,272 INFO L290 TraceCheckUtils]: 861: Hoare triple {37439#(<= ~counter~0 31)} assume true; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,272 INFO L284 TraceCheckUtils]: 862: Hoare quadruple {37439#(<= ~counter~0 31)} {37439#(<= ~counter~0 31)} #63#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,272 INFO L272 TraceCheckUtils]: 863: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,273 INFO L290 TraceCheckUtils]: 864: Hoare triple {37439#(<= ~counter~0 31)} ~cond := #in~cond; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,273 INFO L290 TraceCheckUtils]: 865: Hoare triple {37439#(<= ~counter~0 31)} assume !(0 == ~cond); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,273 INFO L290 TraceCheckUtils]: 866: Hoare triple {37439#(<= ~counter~0 31)} assume true; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,273 INFO L284 TraceCheckUtils]: 867: Hoare quadruple {37439#(<= ~counter~0 31)} {37439#(<= ~counter~0 31)} #65#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,274 INFO L272 TraceCheckUtils]: 868: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,274 INFO L290 TraceCheckUtils]: 869: Hoare triple {37439#(<= ~counter~0 31)} ~cond := #in~cond; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,274 INFO L290 TraceCheckUtils]: 870: Hoare triple {37439#(<= ~counter~0 31)} assume !(0 == ~cond); {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,274 INFO L290 TraceCheckUtils]: 871: Hoare triple {37439#(<= ~counter~0 31)} assume true; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,275 INFO L284 TraceCheckUtils]: 872: Hoare quadruple {37439#(<= ~counter~0 31)} {37439#(<= ~counter~0 31)} #67#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,275 INFO L290 TraceCheckUtils]: 873: Hoare triple {37439#(<= ~counter~0 31)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:00,275 INFO L290 TraceCheckUtils]: 874: Hoare triple {37439#(<= ~counter~0 31)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,276 INFO L290 TraceCheckUtils]: 875: Hoare triple {37524#(<= ~counter~0 32)} assume !!(#t~post5 < 50);havoc #t~post5; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,276 INFO L272 TraceCheckUtils]: 876: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,276 INFO L290 TraceCheckUtils]: 877: Hoare triple {37524#(<= ~counter~0 32)} ~cond := #in~cond; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,277 INFO L290 TraceCheckUtils]: 878: Hoare triple {37524#(<= ~counter~0 32)} assume !(0 == ~cond); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,277 INFO L290 TraceCheckUtils]: 879: Hoare triple {37524#(<= ~counter~0 32)} assume true; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,277 INFO L284 TraceCheckUtils]: 880: Hoare quadruple {37524#(<= ~counter~0 32)} {37524#(<= ~counter~0 32)} #59#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,277 INFO L272 TraceCheckUtils]: 881: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,278 INFO L290 TraceCheckUtils]: 882: Hoare triple {37524#(<= ~counter~0 32)} ~cond := #in~cond; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,278 INFO L290 TraceCheckUtils]: 883: Hoare triple {37524#(<= ~counter~0 32)} assume !(0 == ~cond); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,278 INFO L290 TraceCheckUtils]: 884: Hoare triple {37524#(<= ~counter~0 32)} assume true; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,279 INFO L284 TraceCheckUtils]: 885: Hoare quadruple {37524#(<= ~counter~0 32)} {37524#(<= ~counter~0 32)} #61#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,279 INFO L272 TraceCheckUtils]: 886: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,279 INFO L290 TraceCheckUtils]: 887: Hoare triple {37524#(<= ~counter~0 32)} ~cond := #in~cond; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,279 INFO L290 TraceCheckUtils]: 888: Hoare triple {37524#(<= ~counter~0 32)} assume !(0 == ~cond); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,280 INFO L290 TraceCheckUtils]: 889: Hoare triple {37524#(<= ~counter~0 32)} assume true; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,280 INFO L284 TraceCheckUtils]: 890: Hoare quadruple {37524#(<= ~counter~0 32)} {37524#(<= ~counter~0 32)} #63#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,280 INFO L272 TraceCheckUtils]: 891: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,281 INFO L290 TraceCheckUtils]: 892: Hoare triple {37524#(<= ~counter~0 32)} ~cond := #in~cond; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,281 INFO L290 TraceCheckUtils]: 893: Hoare triple {37524#(<= ~counter~0 32)} assume !(0 == ~cond); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,281 INFO L290 TraceCheckUtils]: 894: Hoare triple {37524#(<= ~counter~0 32)} assume true; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,281 INFO L284 TraceCheckUtils]: 895: Hoare quadruple {37524#(<= ~counter~0 32)} {37524#(<= ~counter~0 32)} #65#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,282 INFO L272 TraceCheckUtils]: 896: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,282 INFO L290 TraceCheckUtils]: 897: Hoare triple {37524#(<= ~counter~0 32)} ~cond := #in~cond; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,282 INFO L290 TraceCheckUtils]: 898: Hoare triple {37524#(<= ~counter~0 32)} assume !(0 == ~cond); {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,282 INFO L290 TraceCheckUtils]: 899: Hoare triple {37524#(<= ~counter~0 32)} assume true; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,283 INFO L284 TraceCheckUtils]: 900: Hoare quadruple {37524#(<= ~counter~0 32)} {37524#(<= ~counter~0 32)} #67#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,283 INFO L290 TraceCheckUtils]: 901: Hoare triple {37524#(<= ~counter~0 32)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:00,284 INFO L290 TraceCheckUtils]: 902: Hoare triple {37524#(<= ~counter~0 32)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,284 INFO L290 TraceCheckUtils]: 903: Hoare triple {37609#(<= ~counter~0 33)} assume !!(#t~post5 < 50);havoc #t~post5; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,284 INFO L272 TraceCheckUtils]: 904: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,284 INFO L290 TraceCheckUtils]: 905: Hoare triple {37609#(<= ~counter~0 33)} ~cond := #in~cond; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,285 INFO L290 TraceCheckUtils]: 906: Hoare triple {37609#(<= ~counter~0 33)} assume !(0 == ~cond); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,285 INFO L290 TraceCheckUtils]: 907: Hoare triple {37609#(<= ~counter~0 33)} assume true; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,285 INFO L284 TraceCheckUtils]: 908: Hoare quadruple {37609#(<= ~counter~0 33)} {37609#(<= ~counter~0 33)} #59#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,286 INFO L272 TraceCheckUtils]: 909: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,286 INFO L290 TraceCheckUtils]: 910: Hoare triple {37609#(<= ~counter~0 33)} ~cond := #in~cond; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,286 INFO L290 TraceCheckUtils]: 911: Hoare triple {37609#(<= ~counter~0 33)} assume !(0 == ~cond); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,286 INFO L290 TraceCheckUtils]: 912: Hoare triple {37609#(<= ~counter~0 33)} assume true; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,287 INFO L284 TraceCheckUtils]: 913: Hoare quadruple {37609#(<= ~counter~0 33)} {37609#(<= ~counter~0 33)} #61#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,287 INFO L272 TraceCheckUtils]: 914: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,287 INFO L290 TraceCheckUtils]: 915: Hoare triple {37609#(<= ~counter~0 33)} ~cond := #in~cond; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,287 INFO L290 TraceCheckUtils]: 916: Hoare triple {37609#(<= ~counter~0 33)} assume !(0 == ~cond); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,288 INFO L290 TraceCheckUtils]: 917: Hoare triple {37609#(<= ~counter~0 33)} assume true; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,288 INFO L284 TraceCheckUtils]: 918: Hoare quadruple {37609#(<= ~counter~0 33)} {37609#(<= ~counter~0 33)} #63#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,288 INFO L272 TraceCheckUtils]: 919: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,289 INFO L290 TraceCheckUtils]: 920: Hoare triple {37609#(<= ~counter~0 33)} ~cond := #in~cond; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,289 INFO L290 TraceCheckUtils]: 921: Hoare triple {37609#(<= ~counter~0 33)} assume !(0 == ~cond); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,289 INFO L290 TraceCheckUtils]: 922: Hoare triple {37609#(<= ~counter~0 33)} assume true; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,289 INFO L284 TraceCheckUtils]: 923: Hoare quadruple {37609#(<= ~counter~0 33)} {37609#(<= ~counter~0 33)} #65#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,290 INFO L272 TraceCheckUtils]: 924: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,290 INFO L290 TraceCheckUtils]: 925: Hoare triple {37609#(<= ~counter~0 33)} ~cond := #in~cond; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,290 INFO L290 TraceCheckUtils]: 926: Hoare triple {37609#(<= ~counter~0 33)} assume !(0 == ~cond); {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,291 INFO L290 TraceCheckUtils]: 927: Hoare triple {37609#(<= ~counter~0 33)} assume true; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,291 INFO L284 TraceCheckUtils]: 928: Hoare quadruple {37609#(<= ~counter~0 33)} {37609#(<= ~counter~0 33)} #67#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,291 INFO L290 TraceCheckUtils]: 929: Hoare triple {37609#(<= ~counter~0 33)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:00,292 INFO L290 TraceCheckUtils]: 930: Hoare triple {37609#(<= ~counter~0 33)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,292 INFO L290 TraceCheckUtils]: 931: Hoare triple {37694#(<= ~counter~0 34)} assume !!(#t~post5 < 50);havoc #t~post5; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,292 INFO L272 TraceCheckUtils]: 932: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,292 INFO L290 TraceCheckUtils]: 933: Hoare triple {37694#(<= ~counter~0 34)} ~cond := #in~cond; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,293 INFO L290 TraceCheckUtils]: 934: Hoare triple {37694#(<= ~counter~0 34)} assume !(0 == ~cond); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,293 INFO L290 TraceCheckUtils]: 935: Hoare triple {37694#(<= ~counter~0 34)} assume true; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,293 INFO L284 TraceCheckUtils]: 936: Hoare quadruple {37694#(<= ~counter~0 34)} {37694#(<= ~counter~0 34)} #59#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,294 INFO L272 TraceCheckUtils]: 937: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,294 INFO L290 TraceCheckUtils]: 938: Hoare triple {37694#(<= ~counter~0 34)} ~cond := #in~cond; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,294 INFO L290 TraceCheckUtils]: 939: Hoare triple {37694#(<= ~counter~0 34)} assume !(0 == ~cond); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,294 INFO L290 TraceCheckUtils]: 940: Hoare triple {37694#(<= ~counter~0 34)} assume true; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,295 INFO L284 TraceCheckUtils]: 941: Hoare quadruple {37694#(<= ~counter~0 34)} {37694#(<= ~counter~0 34)} #61#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,295 INFO L272 TraceCheckUtils]: 942: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,295 INFO L290 TraceCheckUtils]: 943: Hoare triple {37694#(<= ~counter~0 34)} ~cond := #in~cond; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,296 INFO L290 TraceCheckUtils]: 944: Hoare triple {37694#(<= ~counter~0 34)} assume !(0 == ~cond); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,296 INFO L290 TraceCheckUtils]: 945: Hoare triple {37694#(<= ~counter~0 34)} assume true; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,296 INFO L284 TraceCheckUtils]: 946: Hoare quadruple {37694#(<= ~counter~0 34)} {37694#(<= ~counter~0 34)} #63#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,297 INFO L272 TraceCheckUtils]: 947: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,297 INFO L290 TraceCheckUtils]: 948: Hoare triple {37694#(<= ~counter~0 34)} ~cond := #in~cond; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,297 INFO L290 TraceCheckUtils]: 949: Hoare triple {37694#(<= ~counter~0 34)} assume !(0 == ~cond); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,297 INFO L290 TraceCheckUtils]: 950: Hoare triple {37694#(<= ~counter~0 34)} assume true; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,298 INFO L284 TraceCheckUtils]: 951: Hoare quadruple {37694#(<= ~counter~0 34)} {37694#(<= ~counter~0 34)} #65#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,298 INFO L272 TraceCheckUtils]: 952: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,298 INFO L290 TraceCheckUtils]: 953: Hoare triple {37694#(<= ~counter~0 34)} ~cond := #in~cond; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,298 INFO L290 TraceCheckUtils]: 954: Hoare triple {37694#(<= ~counter~0 34)} assume !(0 == ~cond); {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,299 INFO L290 TraceCheckUtils]: 955: Hoare triple {37694#(<= ~counter~0 34)} assume true; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,299 INFO L284 TraceCheckUtils]: 956: Hoare quadruple {37694#(<= ~counter~0 34)} {37694#(<= ~counter~0 34)} #67#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,300 INFO L290 TraceCheckUtils]: 957: Hoare triple {37694#(<= ~counter~0 34)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:00,300 INFO L290 TraceCheckUtils]: 958: Hoare triple {37694#(<= ~counter~0 34)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,300 INFO L290 TraceCheckUtils]: 959: Hoare triple {37779#(<= ~counter~0 35)} assume !!(#t~post5 < 50);havoc #t~post5; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,301 INFO L272 TraceCheckUtils]: 960: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,301 INFO L290 TraceCheckUtils]: 961: Hoare triple {37779#(<= ~counter~0 35)} ~cond := #in~cond; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,301 INFO L290 TraceCheckUtils]: 962: Hoare triple {37779#(<= ~counter~0 35)} assume !(0 == ~cond); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,302 INFO L290 TraceCheckUtils]: 963: Hoare triple {37779#(<= ~counter~0 35)} assume true; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,302 INFO L284 TraceCheckUtils]: 964: Hoare quadruple {37779#(<= ~counter~0 35)} {37779#(<= ~counter~0 35)} #59#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,312 INFO L272 TraceCheckUtils]: 965: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,313 INFO L290 TraceCheckUtils]: 966: Hoare triple {37779#(<= ~counter~0 35)} ~cond := #in~cond; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,313 INFO L290 TraceCheckUtils]: 967: Hoare triple {37779#(<= ~counter~0 35)} assume !(0 == ~cond); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,313 INFO L290 TraceCheckUtils]: 968: Hoare triple {37779#(<= ~counter~0 35)} assume true; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,314 INFO L284 TraceCheckUtils]: 969: Hoare quadruple {37779#(<= ~counter~0 35)} {37779#(<= ~counter~0 35)} #61#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,314 INFO L272 TraceCheckUtils]: 970: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,314 INFO L290 TraceCheckUtils]: 971: Hoare triple {37779#(<= ~counter~0 35)} ~cond := #in~cond; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,314 INFO L290 TraceCheckUtils]: 972: Hoare triple {37779#(<= ~counter~0 35)} assume !(0 == ~cond); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,315 INFO L290 TraceCheckUtils]: 973: Hoare triple {37779#(<= ~counter~0 35)} assume true; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,315 INFO L284 TraceCheckUtils]: 974: Hoare quadruple {37779#(<= ~counter~0 35)} {37779#(<= ~counter~0 35)} #63#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,315 INFO L272 TraceCheckUtils]: 975: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,316 INFO L290 TraceCheckUtils]: 976: Hoare triple {37779#(<= ~counter~0 35)} ~cond := #in~cond; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,316 INFO L290 TraceCheckUtils]: 977: Hoare triple {37779#(<= ~counter~0 35)} assume !(0 == ~cond); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,316 INFO L290 TraceCheckUtils]: 978: Hoare triple {37779#(<= ~counter~0 35)} assume true; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,316 INFO L284 TraceCheckUtils]: 979: Hoare quadruple {37779#(<= ~counter~0 35)} {37779#(<= ~counter~0 35)} #65#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,317 INFO L272 TraceCheckUtils]: 980: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,317 INFO L290 TraceCheckUtils]: 981: Hoare triple {37779#(<= ~counter~0 35)} ~cond := #in~cond; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,317 INFO L290 TraceCheckUtils]: 982: Hoare triple {37779#(<= ~counter~0 35)} assume !(0 == ~cond); {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,317 INFO L290 TraceCheckUtils]: 983: Hoare triple {37779#(<= ~counter~0 35)} assume true; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,318 INFO L284 TraceCheckUtils]: 984: Hoare quadruple {37779#(<= ~counter~0 35)} {37779#(<= ~counter~0 35)} #67#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,318 INFO L290 TraceCheckUtils]: 985: Hoare triple {37779#(<= ~counter~0 35)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:00,318 INFO L290 TraceCheckUtils]: 986: Hoare triple {37779#(<= ~counter~0 35)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,318 INFO L290 TraceCheckUtils]: 987: Hoare triple {37864#(<= ~counter~0 36)} assume !!(#t~post5 < 50);havoc #t~post5; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,319 INFO L272 TraceCheckUtils]: 988: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,319 INFO L290 TraceCheckUtils]: 989: Hoare triple {37864#(<= ~counter~0 36)} ~cond := #in~cond; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,319 INFO L290 TraceCheckUtils]: 990: Hoare triple {37864#(<= ~counter~0 36)} assume !(0 == ~cond); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,319 INFO L290 TraceCheckUtils]: 991: Hoare triple {37864#(<= ~counter~0 36)} assume true; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,320 INFO L284 TraceCheckUtils]: 992: Hoare quadruple {37864#(<= ~counter~0 36)} {37864#(<= ~counter~0 36)} #59#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,320 INFO L272 TraceCheckUtils]: 993: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,320 INFO L290 TraceCheckUtils]: 994: Hoare triple {37864#(<= ~counter~0 36)} ~cond := #in~cond; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,321 INFO L290 TraceCheckUtils]: 995: Hoare triple {37864#(<= ~counter~0 36)} assume !(0 == ~cond); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,321 INFO L290 TraceCheckUtils]: 996: Hoare triple {37864#(<= ~counter~0 36)} assume true; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,321 INFO L284 TraceCheckUtils]: 997: Hoare quadruple {37864#(<= ~counter~0 36)} {37864#(<= ~counter~0 36)} #61#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,321 INFO L272 TraceCheckUtils]: 998: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,322 INFO L290 TraceCheckUtils]: 999: Hoare triple {37864#(<= ~counter~0 36)} ~cond := #in~cond; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,322 INFO L290 TraceCheckUtils]: 1,000: Hoare triple {37864#(<= ~counter~0 36)} assume !(0 == ~cond); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,322 INFO L290 TraceCheckUtils]: 1,001: Hoare triple {37864#(<= ~counter~0 36)} assume true; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,323 INFO L284 TraceCheckUtils]: 1,002: Hoare quadruple {37864#(<= ~counter~0 36)} {37864#(<= ~counter~0 36)} #63#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,323 INFO L272 TraceCheckUtils]: 1,003: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,323 INFO L290 TraceCheckUtils]: 1,004: Hoare triple {37864#(<= ~counter~0 36)} ~cond := #in~cond; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,323 INFO L290 TraceCheckUtils]: 1,005: Hoare triple {37864#(<= ~counter~0 36)} assume !(0 == ~cond); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,324 INFO L290 TraceCheckUtils]: 1,006: Hoare triple {37864#(<= ~counter~0 36)} assume true; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,324 INFO L284 TraceCheckUtils]: 1,007: Hoare quadruple {37864#(<= ~counter~0 36)} {37864#(<= ~counter~0 36)} #65#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,324 INFO L272 TraceCheckUtils]: 1,008: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,324 INFO L290 TraceCheckUtils]: 1,009: Hoare triple {37864#(<= ~counter~0 36)} ~cond := #in~cond; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,325 INFO L290 TraceCheckUtils]: 1,010: Hoare triple {37864#(<= ~counter~0 36)} assume !(0 == ~cond); {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,325 INFO L290 TraceCheckUtils]: 1,011: Hoare triple {37864#(<= ~counter~0 36)} assume true; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,325 INFO L284 TraceCheckUtils]: 1,012: Hoare quadruple {37864#(<= ~counter~0 36)} {37864#(<= ~counter~0 36)} #67#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,325 INFO L290 TraceCheckUtils]: 1,013: Hoare triple {37864#(<= ~counter~0 36)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:00,326 INFO L290 TraceCheckUtils]: 1,014: Hoare triple {37864#(<= ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,326 INFO L290 TraceCheckUtils]: 1,015: Hoare triple {37949#(<= ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,327 INFO L272 TraceCheckUtils]: 1,016: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,327 INFO L290 TraceCheckUtils]: 1,017: Hoare triple {37949#(<= ~counter~0 37)} ~cond := #in~cond; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,327 INFO L290 TraceCheckUtils]: 1,018: Hoare triple {37949#(<= ~counter~0 37)} assume !(0 == ~cond); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,327 INFO L290 TraceCheckUtils]: 1,019: Hoare triple {37949#(<= ~counter~0 37)} assume true; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,328 INFO L284 TraceCheckUtils]: 1,020: Hoare quadruple {37949#(<= ~counter~0 37)} {37949#(<= ~counter~0 37)} #59#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,328 INFO L272 TraceCheckUtils]: 1,021: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,328 INFO L290 TraceCheckUtils]: 1,022: Hoare triple {37949#(<= ~counter~0 37)} ~cond := #in~cond; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,328 INFO L290 TraceCheckUtils]: 1,023: Hoare triple {37949#(<= ~counter~0 37)} assume !(0 == ~cond); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,329 INFO L290 TraceCheckUtils]: 1,024: Hoare triple {37949#(<= ~counter~0 37)} assume true; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,329 INFO L284 TraceCheckUtils]: 1,025: Hoare quadruple {37949#(<= ~counter~0 37)} {37949#(<= ~counter~0 37)} #61#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,329 INFO L272 TraceCheckUtils]: 1,026: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,329 INFO L290 TraceCheckUtils]: 1,027: Hoare triple {37949#(<= ~counter~0 37)} ~cond := #in~cond; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,330 INFO L290 TraceCheckUtils]: 1,028: Hoare triple {37949#(<= ~counter~0 37)} assume !(0 == ~cond); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,330 INFO L290 TraceCheckUtils]: 1,029: Hoare triple {37949#(<= ~counter~0 37)} assume true; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,330 INFO L284 TraceCheckUtils]: 1,030: Hoare quadruple {37949#(<= ~counter~0 37)} {37949#(<= ~counter~0 37)} #63#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,331 INFO L272 TraceCheckUtils]: 1,031: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,331 INFO L290 TraceCheckUtils]: 1,032: Hoare triple {37949#(<= ~counter~0 37)} ~cond := #in~cond; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,331 INFO L290 TraceCheckUtils]: 1,033: Hoare triple {37949#(<= ~counter~0 37)} assume !(0 == ~cond); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,331 INFO L290 TraceCheckUtils]: 1,034: Hoare triple {37949#(<= ~counter~0 37)} assume true; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,332 INFO L284 TraceCheckUtils]: 1,035: Hoare quadruple {37949#(<= ~counter~0 37)} {37949#(<= ~counter~0 37)} #65#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,332 INFO L272 TraceCheckUtils]: 1,036: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,332 INFO L290 TraceCheckUtils]: 1,037: Hoare triple {37949#(<= ~counter~0 37)} ~cond := #in~cond; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,332 INFO L290 TraceCheckUtils]: 1,038: Hoare triple {37949#(<= ~counter~0 37)} assume !(0 == ~cond); {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,333 INFO L290 TraceCheckUtils]: 1,039: Hoare triple {37949#(<= ~counter~0 37)} assume true; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,333 INFO L284 TraceCheckUtils]: 1,040: Hoare quadruple {37949#(<= ~counter~0 37)} {37949#(<= ~counter~0 37)} #67#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,333 INFO L290 TraceCheckUtils]: 1,041: Hoare triple {37949#(<= ~counter~0 37)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:00,334 INFO L290 TraceCheckUtils]: 1,042: Hoare triple {37949#(<= ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,334 INFO L290 TraceCheckUtils]: 1,043: Hoare triple {38034#(<= ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,334 INFO L272 TraceCheckUtils]: 1,044: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,335 INFO L290 TraceCheckUtils]: 1,045: Hoare triple {38034#(<= ~counter~0 38)} ~cond := #in~cond; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,335 INFO L290 TraceCheckUtils]: 1,046: Hoare triple {38034#(<= ~counter~0 38)} assume !(0 == ~cond); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,335 INFO L290 TraceCheckUtils]: 1,047: Hoare triple {38034#(<= ~counter~0 38)} assume true; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,335 INFO L284 TraceCheckUtils]: 1,048: Hoare quadruple {38034#(<= ~counter~0 38)} {38034#(<= ~counter~0 38)} #59#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,336 INFO L272 TraceCheckUtils]: 1,049: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,336 INFO L290 TraceCheckUtils]: 1,050: Hoare triple {38034#(<= ~counter~0 38)} ~cond := #in~cond; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,336 INFO L290 TraceCheckUtils]: 1,051: Hoare triple {38034#(<= ~counter~0 38)} assume !(0 == ~cond); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,336 INFO L290 TraceCheckUtils]: 1,052: Hoare triple {38034#(<= ~counter~0 38)} assume true; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,337 INFO L284 TraceCheckUtils]: 1,053: Hoare quadruple {38034#(<= ~counter~0 38)} {38034#(<= ~counter~0 38)} #61#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,337 INFO L272 TraceCheckUtils]: 1,054: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,337 INFO L290 TraceCheckUtils]: 1,055: Hoare triple {38034#(<= ~counter~0 38)} ~cond := #in~cond; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,337 INFO L290 TraceCheckUtils]: 1,056: Hoare triple {38034#(<= ~counter~0 38)} assume !(0 == ~cond); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,338 INFO L290 TraceCheckUtils]: 1,057: Hoare triple {38034#(<= ~counter~0 38)} assume true; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,338 INFO L284 TraceCheckUtils]: 1,058: Hoare quadruple {38034#(<= ~counter~0 38)} {38034#(<= ~counter~0 38)} #63#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,338 INFO L272 TraceCheckUtils]: 1,059: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,338 INFO L290 TraceCheckUtils]: 1,060: Hoare triple {38034#(<= ~counter~0 38)} ~cond := #in~cond; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,339 INFO L290 TraceCheckUtils]: 1,061: Hoare triple {38034#(<= ~counter~0 38)} assume !(0 == ~cond); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,339 INFO L290 TraceCheckUtils]: 1,062: Hoare triple {38034#(<= ~counter~0 38)} assume true; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,339 INFO L284 TraceCheckUtils]: 1,063: Hoare quadruple {38034#(<= ~counter~0 38)} {38034#(<= ~counter~0 38)} #65#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,340 INFO L272 TraceCheckUtils]: 1,064: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,340 INFO L290 TraceCheckUtils]: 1,065: Hoare triple {38034#(<= ~counter~0 38)} ~cond := #in~cond; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,340 INFO L290 TraceCheckUtils]: 1,066: Hoare triple {38034#(<= ~counter~0 38)} assume !(0 == ~cond); {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,340 INFO L290 TraceCheckUtils]: 1,067: Hoare triple {38034#(<= ~counter~0 38)} assume true; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,340 INFO L284 TraceCheckUtils]: 1,068: Hoare quadruple {38034#(<= ~counter~0 38)} {38034#(<= ~counter~0 38)} #67#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,341 INFO L290 TraceCheckUtils]: 1,069: Hoare triple {38034#(<= ~counter~0 38)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:00,341 INFO L290 TraceCheckUtils]: 1,070: Hoare triple {38034#(<= ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,341 INFO L290 TraceCheckUtils]: 1,071: Hoare triple {38119#(<= ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,342 INFO L272 TraceCheckUtils]: 1,072: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,342 INFO L290 TraceCheckUtils]: 1,073: Hoare triple {38119#(<= ~counter~0 39)} ~cond := #in~cond; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,342 INFO L290 TraceCheckUtils]: 1,074: Hoare triple {38119#(<= ~counter~0 39)} assume !(0 == ~cond); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,342 INFO L290 TraceCheckUtils]: 1,075: Hoare triple {38119#(<= ~counter~0 39)} assume true; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,343 INFO L284 TraceCheckUtils]: 1,076: Hoare quadruple {38119#(<= ~counter~0 39)} {38119#(<= ~counter~0 39)} #59#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,343 INFO L272 TraceCheckUtils]: 1,077: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,343 INFO L290 TraceCheckUtils]: 1,078: Hoare triple {38119#(<= ~counter~0 39)} ~cond := #in~cond; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,343 INFO L290 TraceCheckUtils]: 1,079: Hoare triple {38119#(<= ~counter~0 39)} assume !(0 == ~cond); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,343 INFO L290 TraceCheckUtils]: 1,080: Hoare triple {38119#(<= ~counter~0 39)} assume true; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,344 INFO L284 TraceCheckUtils]: 1,081: Hoare quadruple {38119#(<= ~counter~0 39)} {38119#(<= ~counter~0 39)} #61#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,344 INFO L272 TraceCheckUtils]: 1,082: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,345 INFO L290 TraceCheckUtils]: 1,083: Hoare triple {38119#(<= ~counter~0 39)} ~cond := #in~cond; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,345 INFO L290 TraceCheckUtils]: 1,084: Hoare triple {38119#(<= ~counter~0 39)} assume !(0 == ~cond); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,345 INFO L290 TraceCheckUtils]: 1,085: Hoare triple {38119#(<= ~counter~0 39)} assume true; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,345 INFO L284 TraceCheckUtils]: 1,086: Hoare quadruple {38119#(<= ~counter~0 39)} {38119#(<= ~counter~0 39)} #63#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,346 INFO L272 TraceCheckUtils]: 1,087: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,346 INFO L290 TraceCheckUtils]: 1,088: Hoare triple {38119#(<= ~counter~0 39)} ~cond := #in~cond; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,346 INFO L290 TraceCheckUtils]: 1,089: Hoare triple {38119#(<= ~counter~0 39)} assume !(0 == ~cond); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,346 INFO L290 TraceCheckUtils]: 1,090: Hoare triple {38119#(<= ~counter~0 39)} assume true; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,347 INFO L284 TraceCheckUtils]: 1,091: Hoare quadruple {38119#(<= ~counter~0 39)} {38119#(<= ~counter~0 39)} #65#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,347 INFO L272 TraceCheckUtils]: 1,092: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,347 INFO L290 TraceCheckUtils]: 1,093: Hoare triple {38119#(<= ~counter~0 39)} ~cond := #in~cond; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,347 INFO L290 TraceCheckUtils]: 1,094: Hoare triple {38119#(<= ~counter~0 39)} assume !(0 == ~cond); {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,348 INFO L290 TraceCheckUtils]: 1,095: Hoare triple {38119#(<= ~counter~0 39)} assume true; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,348 INFO L284 TraceCheckUtils]: 1,096: Hoare quadruple {38119#(<= ~counter~0 39)} {38119#(<= ~counter~0 39)} #67#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,348 INFO L290 TraceCheckUtils]: 1,097: Hoare triple {38119#(<= ~counter~0 39)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:00,349 INFO L290 TraceCheckUtils]: 1,098: Hoare triple {38119#(<= ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,349 INFO L290 TraceCheckUtils]: 1,099: Hoare triple {38204#(<= ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,349 INFO L272 TraceCheckUtils]: 1,100: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,349 INFO L290 TraceCheckUtils]: 1,101: Hoare triple {38204#(<= ~counter~0 40)} ~cond := #in~cond; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,350 INFO L290 TraceCheckUtils]: 1,102: Hoare triple {38204#(<= ~counter~0 40)} assume !(0 == ~cond); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,350 INFO L290 TraceCheckUtils]: 1,103: Hoare triple {38204#(<= ~counter~0 40)} assume true; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,350 INFO L284 TraceCheckUtils]: 1,104: Hoare quadruple {38204#(<= ~counter~0 40)} {38204#(<= ~counter~0 40)} #59#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,350 INFO L272 TraceCheckUtils]: 1,105: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,351 INFO L290 TraceCheckUtils]: 1,106: Hoare triple {38204#(<= ~counter~0 40)} ~cond := #in~cond; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,351 INFO L290 TraceCheckUtils]: 1,107: Hoare triple {38204#(<= ~counter~0 40)} assume !(0 == ~cond); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,351 INFO L290 TraceCheckUtils]: 1,108: Hoare triple {38204#(<= ~counter~0 40)} assume true; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,351 INFO L284 TraceCheckUtils]: 1,109: Hoare quadruple {38204#(<= ~counter~0 40)} {38204#(<= ~counter~0 40)} #61#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,352 INFO L272 TraceCheckUtils]: 1,110: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,352 INFO L290 TraceCheckUtils]: 1,111: Hoare triple {38204#(<= ~counter~0 40)} ~cond := #in~cond; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,352 INFO L290 TraceCheckUtils]: 1,112: Hoare triple {38204#(<= ~counter~0 40)} assume !(0 == ~cond); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,352 INFO L290 TraceCheckUtils]: 1,113: Hoare triple {38204#(<= ~counter~0 40)} assume true; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,353 INFO L284 TraceCheckUtils]: 1,114: Hoare quadruple {38204#(<= ~counter~0 40)} {38204#(<= ~counter~0 40)} #63#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,353 INFO L272 TraceCheckUtils]: 1,115: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,353 INFO L290 TraceCheckUtils]: 1,116: Hoare triple {38204#(<= ~counter~0 40)} ~cond := #in~cond; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,353 INFO L290 TraceCheckUtils]: 1,117: Hoare triple {38204#(<= ~counter~0 40)} assume !(0 == ~cond); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,353 INFO L290 TraceCheckUtils]: 1,118: Hoare triple {38204#(<= ~counter~0 40)} assume true; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,354 INFO L284 TraceCheckUtils]: 1,119: Hoare quadruple {38204#(<= ~counter~0 40)} {38204#(<= ~counter~0 40)} #65#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,354 INFO L272 TraceCheckUtils]: 1,120: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,354 INFO L290 TraceCheckUtils]: 1,121: Hoare triple {38204#(<= ~counter~0 40)} ~cond := #in~cond; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,355 INFO L290 TraceCheckUtils]: 1,122: Hoare triple {38204#(<= ~counter~0 40)} assume !(0 == ~cond); {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,355 INFO L290 TraceCheckUtils]: 1,123: Hoare triple {38204#(<= ~counter~0 40)} assume true; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,355 INFO L284 TraceCheckUtils]: 1,124: Hoare quadruple {38204#(<= ~counter~0 40)} {38204#(<= ~counter~0 40)} #67#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,355 INFO L290 TraceCheckUtils]: 1,125: Hoare triple {38204#(<= ~counter~0 40)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:00,356 INFO L290 TraceCheckUtils]: 1,126: Hoare triple {38204#(<= ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,356 INFO L290 TraceCheckUtils]: 1,127: Hoare triple {38289#(<= ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,356 INFO L272 TraceCheckUtils]: 1,128: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,356 INFO L290 TraceCheckUtils]: 1,129: Hoare triple {38289#(<= ~counter~0 41)} ~cond := #in~cond; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,357 INFO L290 TraceCheckUtils]: 1,130: Hoare triple {38289#(<= ~counter~0 41)} assume !(0 == ~cond); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,357 INFO L290 TraceCheckUtils]: 1,131: Hoare triple {38289#(<= ~counter~0 41)} assume true; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,357 INFO L284 TraceCheckUtils]: 1,132: Hoare quadruple {38289#(<= ~counter~0 41)} {38289#(<= ~counter~0 41)} #59#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,357 INFO L272 TraceCheckUtils]: 1,133: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,358 INFO L290 TraceCheckUtils]: 1,134: Hoare triple {38289#(<= ~counter~0 41)} ~cond := #in~cond; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,358 INFO L290 TraceCheckUtils]: 1,135: Hoare triple {38289#(<= ~counter~0 41)} assume !(0 == ~cond); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,358 INFO L290 TraceCheckUtils]: 1,136: Hoare triple {38289#(<= ~counter~0 41)} assume true; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,358 INFO L284 TraceCheckUtils]: 1,137: Hoare quadruple {38289#(<= ~counter~0 41)} {38289#(<= ~counter~0 41)} #61#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,359 INFO L272 TraceCheckUtils]: 1,138: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,359 INFO L290 TraceCheckUtils]: 1,139: Hoare triple {38289#(<= ~counter~0 41)} ~cond := #in~cond; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,359 INFO L290 TraceCheckUtils]: 1,140: Hoare triple {38289#(<= ~counter~0 41)} assume !(0 == ~cond); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,359 INFO L290 TraceCheckUtils]: 1,141: Hoare triple {38289#(<= ~counter~0 41)} assume true; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,360 INFO L284 TraceCheckUtils]: 1,142: Hoare quadruple {38289#(<= ~counter~0 41)} {38289#(<= ~counter~0 41)} #63#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,360 INFO L272 TraceCheckUtils]: 1,143: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,360 INFO L290 TraceCheckUtils]: 1,144: Hoare triple {38289#(<= ~counter~0 41)} ~cond := #in~cond; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,360 INFO L290 TraceCheckUtils]: 1,145: Hoare triple {38289#(<= ~counter~0 41)} assume !(0 == ~cond); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,361 INFO L290 TraceCheckUtils]: 1,146: Hoare triple {38289#(<= ~counter~0 41)} assume true; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,361 INFO L284 TraceCheckUtils]: 1,147: Hoare quadruple {38289#(<= ~counter~0 41)} {38289#(<= ~counter~0 41)} #65#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,361 INFO L272 TraceCheckUtils]: 1,148: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,361 INFO L290 TraceCheckUtils]: 1,149: Hoare triple {38289#(<= ~counter~0 41)} ~cond := #in~cond; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,362 INFO L290 TraceCheckUtils]: 1,150: Hoare triple {38289#(<= ~counter~0 41)} assume !(0 == ~cond); {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,362 INFO L290 TraceCheckUtils]: 1,151: Hoare triple {38289#(<= ~counter~0 41)} assume true; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,362 INFO L284 TraceCheckUtils]: 1,152: Hoare quadruple {38289#(<= ~counter~0 41)} {38289#(<= ~counter~0 41)} #67#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,362 INFO L290 TraceCheckUtils]: 1,153: Hoare triple {38289#(<= ~counter~0 41)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:00,363 INFO L290 TraceCheckUtils]: 1,154: Hoare triple {38289#(<= ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,363 INFO L290 TraceCheckUtils]: 1,155: Hoare triple {38374#(<= ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,363 INFO L272 TraceCheckUtils]: 1,156: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,364 INFO L290 TraceCheckUtils]: 1,157: Hoare triple {38374#(<= ~counter~0 42)} ~cond := #in~cond; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,364 INFO L290 TraceCheckUtils]: 1,158: Hoare triple {38374#(<= ~counter~0 42)} assume !(0 == ~cond); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,364 INFO L290 TraceCheckUtils]: 1,159: Hoare triple {38374#(<= ~counter~0 42)} assume true; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,364 INFO L284 TraceCheckUtils]: 1,160: Hoare quadruple {38374#(<= ~counter~0 42)} {38374#(<= ~counter~0 42)} #59#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,365 INFO L272 TraceCheckUtils]: 1,161: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,365 INFO L290 TraceCheckUtils]: 1,162: Hoare triple {38374#(<= ~counter~0 42)} ~cond := #in~cond; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,365 INFO L290 TraceCheckUtils]: 1,163: Hoare triple {38374#(<= ~counter~0 42)} assume !(0 == ~cond); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,365 INFO L290 TraceCheckUtils]: 1,164: Hoare triple {38374#(<= ~counter~0 42)} assume true; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,365 INFO L284 TraceCheckUtils]: 1,165: Hoare quadruple {38374#(<= ~counter~0 42)} {38374#(<= ~counter~0 42)} #61#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,366 INFO L272 TraceCheckUtils]: 1,166: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,366 INFO L290 TraceCheckUtils]: 1,167: Hoare triple {38374#(<= ~counter~0 42)} ~cond := #in~cond; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,366 INFO L290 TraceCheckUtils]: 1,168: Hoare triple {38374#(<= ~counter~0 42)} assume !(0 == ~cond); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,366 INFO L290 TraceCheckUtils]: 1,169: Hoare triple {38374#(<= ~counter~0 42)} assume true; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,367 INFO L284 TraceCheckUtils]: 1,170: Hoare quadruple {38374#(<= ~counter~0 42)} {38374#(<= ~counter~0 42)} #63#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,367 INFO L272 TraceCheckUtils]: 1,171: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,367 INFO L290 TraceCheckUtils]: 1,172: Hoare triple {38374#(<= ~counter~0 42)} ~cond := #in~cond; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,367 INFO L290 TraceCheckUtils]: 1,173: Hoare triple {38374#(<= ~counter~0 42)} assume !(0 == ~cond); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,368 INFO L290 TraceCheckUtils]: 1,174: Hoare triple {38374#(<= ~counter~0 42)} assume true; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,368 INFO L284 TraceCheckUtils]: 1,175: Hoare quadruple {38374#(<= ~counter~0 42)} {38374#(<= ~counter~0 42)} #65#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,368 INFO L272 TraceCheckUtils]: 1,176: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,369 INFO L290 TraceCheckUtils]: 1,177: Hoare triple {38374#(<= ~counter~0 42)} ~cond := #in~cond; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,369 INFO L290 TraceCheckUtils]: 1,178: Hoare triple {38374#(<= ~counter~0 42)} assume !(0 == ~cond); {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,369 INFO L290 TraceCheckUtils]: 1,179: Hoare triple {38374#(<= ~counter~0 42)} assume true; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,369 INFO L284 TraceCheckUtils]: 1,180: Hoare quadruple {38374#(<= ~counter~0 42)} {38374#(<= ~counter~0 42)} #67#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,369 INFO L290 TraceCheckUtils]: 1,181: Hoare triple {38374#(<= ~counter~0 42)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:00,370 INFO L290 TraceCheckUtils]: 1,182: Hoare triple {38374#(<= ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,370 INFO L290 TraceCheckUtils]: 1,183: Hoare triple {38459#(<= ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,370 INFO L272 TraceCheckUtils]: 1,184: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,371 INFO L290 TraceCheckUtils]: 1,185: Hoare triple {38459#(<= ~counter~0 43)} ~cond := #in~cond; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,371 INFO L290 TraceCheckUtils]: 1,186: Hoare triple {38459#(<= ~counter~0 43)} assume !(0 == ~cond); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,371 INFO L290 TraceCheckUtils]: 1,187: Hoare triple {38459#(<= ~counter~0 43)} assume true; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,371 INFO L284 TraceCheckUtils]: 1,188: Hoare quadruple {38459#(<= ~counter~0 43)} {38459#(<= ~counter~0 43)} #59#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,372 INFO L272 TraceCheckUtils]: 1,189: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,372 INFO L290 TraceCheckUtils]: 1,190: Hoare triple {38459#(<= ~counter~0 43)} ~cond := #in~cond; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,372 INFO L290 TraceCheckUtils]: 1,191: Hoare triple {38459#(<= ~counter~0 43)} assume !(0 == ~cond); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,372 INFO L290 TraceCheckUtils]: 1,192: Hoare triple {38459#(<= ~counter~0 43)} assume true; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,373 INFO L284 TraceCheckUtils]: 1,193: Hoare quadruple {38459#(<= ~counter~0 43)} {38459#(<= ~counter~0 43)} #61#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,373 INFO L272 TraceCheckUtils]: 1,194: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,373 INFO L290 TraceCheckUtils]: 1,195: Hoare triple {38459#(<= ~counter~0 43)} ~cond := #in~cond; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,373 INFO L290 TraceCheckUtils]: 1,196: Hoare triple {38459#(<= ~counter~0 43)} assume !(0 == ~cond); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,374 INFO L290 TraceCheckUtils]: 1,197: Hoare triple {38459#(<= ~counter~0 43)} assume true; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,374 INFO L284 TraceCheckUtils]: 1,198: Hoare quadruple {38459#(<= ~counter~0 43)} {38459#(<= ~counter~0 43)} #63#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,374 INFO L272 TraceCheckUtils]: 1,199: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,374 INFO L290 TraceCheckUtils]: 1,200: Hoare triple {38459#(<= ~counter~0 43)} ~cond := #in~cond; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,375 INFO L290 TraceCheckUtils]: 1,201: Hoare triple {38459#(<= ~counter~0 43)} assume !(0 == ~cond); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,375 INFO L290 TraceCheckUtils]: 1,202: Hoare triple {38459#(<= ~counter~0 43)} assume true; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,375 INFO L284 TraceCheckUtils]: 1,203: Hoare quadruple {38459#(<= ~counter~0 43)} {38459#(<= ~counter~0 43)} #65#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,375 INFO L272 TraceCheckUtils]: 1,204: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,376 INFO L290 TraceCheckUtils]: 1,205: Hoare triple {38459#(<= ~counter~0 43)} ~cond := #in~cond; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,376 INFO L290 TraceCheckUtils]: 1,206: Hoare triple {38459#(<= ~counter~0 43)} assume !(0 == ~cond); {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,376 INFO L290 TraceCheckUtils]: 1,207: Hoare triple {38459#(<= ~counter~0 43)} assume true; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,376 INFO L284 TraceCheckUtils]: 1,208: Hoare quadruple {38459#(<= ~counter~0 43)} {38459#(<= ~counter~0 43)} #67#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,377 INFO L290 TraceCheckUtils]: 1,209: Hoare triple {38459#(<= ~counter~0 43)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:00,377 INFO L290 TraceCheckUtils]: 1,210: Hoare triple {38459#(<= ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,377 INFO L290 TraceCheckUtils]: 1,211: Hoare triple {38544#(<= ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,378 INFO L272 TraceCheckUtils]: 1,212: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,378 INFO L290 TraceCheckUtils]: 1,213: Hoare triple {38544#(<= ~counter~0 44)} ~cond := #in~cond; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,378 INFO L290 TraceCheckUtils]: 1,214: Hoare triple {38544#(<= ~counter~0 44)} assume !(0 == ~cond); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,378 INFO L290 TraceCheckUtils]: 1,215: Hoare triple {38544#(<= ~counter~0 44)} assume true; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,379 INFO L284 TraceCheckUtils]: 1,216: Hoare quadruple {38544#(<= ~counter~0 44)} {38544#(<= ~counter~0 44)} #59#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,379 INFO L272 TraceCheckUtils]: 1,217: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,379 INFO L290 TraceCheckUtils]: 1,218: Hoare triple {38544#(<= ~counter~0 44)} ~cond := #in~cond; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,379 INFO L290 TraceCheckUtils]: 1,219: Hoare triple {38544#(<= ~counter~0 44)} assume !(0 == ~cond); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,379 INFO L290 TraceCheckUtils]: 1,220: Hoare triple {38544#(<= ~counter~0 44)} assume true; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,380 INFO L284 TraceCheckUtils]: 1,221: Hoare quadruple {38544#(<= ~counter~0 44)} {38544#(<= ~counter~0 44)} #61#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,380 INFO L272 TraceCheckUtils]: 1,222: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,380 INFO L290 TraceCheckUtils]: 1,223: Hoare triple {38544#(<= ~counter~0 44)} ~cond := #in~cond; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,381 INFO L290 TraceCheckUtils]: 1,224: Hoare triple {38544#(<= ~counter~0 44)} assume !(0 == ~cond); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,381 INFO L290 TraceCheckUtils]: 1,225: Hoare triple {38544#(<= ~counter~0 44)} assume true; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,381 INFO L284 TraceCheckUtils]: 1,226: Hoare quadruple {38544#(<= ~counter~0 44)} {38544#(<= ~counter~0 44)} #63#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,381 INFO L272 TraceCheckUtils]: 1,227: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,382 INFO L290 TraceCheckUtils]: 1,228: Hoare triple {38544#(<= ~counter~0 44)} ~cond := #in~cond; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,382 INFO L290 TraceCheckUtils]: 1,229: Hoare triple {38544#(<= ~counter~0 44)} assume !(0 == ~cond); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,382 INFO L290 TraceCheckUtils]: 1,230: Hoare triple {38544#(<= ~counter~0 44)} assume true; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,382 INFO L284 TraceCheckUtils]: 1,231: Hoare quadruple {38544#(<= ~counter~0 44)} {38544#(<= ~counter~0 44)} #65#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,383 INFO L272 TraceCheckUtils]: 1,232: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,383 INFO L290 TraceCheckUtils]: 1,233: Hoare triple {38544#(<= ~counter~0 44)} ~cond := #in~cond; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,383 INFO L290 TraceCheckUtils]: 1,234: Hoare triple {38544#(<= ~counter~0 44)} assume !(0 == ~cond); {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,383 INFO L290 TraceCheckUtils]: 1,235: Hoare triple {38544#(<= ~counter~0 44)} assume true; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,384 INFO L284 TraceCheckUtils]: 1,236: Hoare quadruple {38544#(<= ~counter~0 44)} {38544#(<= ~counter~0 44)} #67#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,384 INFO L290 TraceCheckUtils]: 1,237: Hoare triple {38544#(<= ~counter~0 44)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:00,384 INFO L290 TraceCheckUtils]: 1,238: Hoare triple {38544#(<= ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,384 INFO L290 TraceCheckUtils]: 1,239: Hoare triple {38629#(<= ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,385 INFO L272 TraceCheckUtils]: 1,240: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,385 INFO L290 TraceCheckUtils]: 1,241: Hoare triple {38629#(<= ~counter~0 45)} ~cond := #in~cond; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,385 INFO L290 TraceCheckUtils]: 1,242: Hoare triple {38629#(<= ~counter~0 45)} assume !(0 == ~cond); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,385 INFO L290 TraceCheckUtils]: 1,243: Hoare triple {38629#(<= ~counter~0 45)} assume true; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,386 INFO L284 TraceCheckUtils]: 1,244: Hoare quadruple {38629#(<= ~counter~0 45)} {38629#(<= ~counter~0 45)} #59#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,386 INFO L272 TraceCheckUtils]: 1,245: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,386 INFO L290 TraceCheckUtils]: 1,246: Hoare triple {38629#(<= ~counter~0 45)} ~cond := #in~cond; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,386 INFO L290 TraceCheckUtils]: 1,247: Hoare triple {38629#(<= ~counter~0 45)} assume !(0 == ~cond); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,387 INFO L290 TraceCheckUtils]: 1,248: Hoare triple {38629#(<= ~counter~0 45)} assume true; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,387 INFO L284 TraceCheckUtils]: 1,249: Hoare quadruple {38629#(<= ~counter~0 45)} {38629#(<= ~counter~0 45)} #61#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,387 INFO L272 TraceCheckUtils]: 1,250: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,387 INFO L290 TraceCheckUtils]: 1,251: Hoare triple {38629#(<= ~counter~0 45)} ~cond := #in~cond; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,388 INFO L290 TraceCheckUtils]: 1,252: Hoare triple {38629#(<= ~counter~0 45)} assume !(0 == ~cond); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,388 INFO L290 TraceCheckUtils]: 1,253: Hoare triple {38629#(<= ~counter~0 45)} assume true; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,388 INFO L284 TraceCheckUtils]: 1,254: Hoare quadruple {38629#(<= ~counter~0 45)} {38629#(<= ~counter~0 45)} #63#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,389 INFO L272 TraceCheckUtils]: 1,255: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,389 INFO L290 TraceCheckUtils]: 1,256: Hoare triple {38629#(<= ~counter~0 45)} ~cond := #in~cond; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,389 INFO L290 TraceCheckUtils]: 1,257: Hoare triple {38629#(<= ~counter~0 45)} assume !(0 == ~cond); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,390 INFO L290 TraceCheckUtils]: 1,258: Hoare triple {38629#(<= ~counter~0 45)} assume true; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,390 INFO L284 TraceCheckUtils]: 1,259: Hoare quadruple {38629#(<= ~counter~0 45)} {38629#(<= ~counter~0 45)} #65#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,390 INFO L272 TraceCheckUtils]: 1,260: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,390 INFO L290 TraceCheckUtils]: 1,261: Hoare triple {38629#(<= ~counter~0 45)} ~cond := #in~cond; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,391 INFO L290 TraceCheckUtils]: 1,262: Hoare triple {38629#(<= ~counter~0 45)} assume !(0 == ~cond); {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,391 INFO L290 TraceCheckUtils]: 1,263: Hoare triple {38629#(<= ~counter~0 45)} assume true; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,391 INFO L284 TraceCheckUtils]: 1,264: Hoare quadruple {38629#(<= ~counter~0 45)} {38629#(<= ~counter~0 45)} #67#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,391 INFO L290 TraceCheckUtils]: 1,265: Hoare triple {38629#(<= ~counter~0 45)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:00,392 INFO L290 TraceCheckUtils]: 1,266: Hoare triple {38629#(<= ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,392 INFO L290 TraceCheckUtils]: 1,267: Hoare triple {38714#(<= ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,392 INFO L272 TraceCheckUtils]: 1,268: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,392 INFO L290 TraceCheckUtils]: 1,269: Hoare triple {38714#(<= ~counter~0 46)} ~cond := #in~cond; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,393 INFO L290 TraceCheckUtils]: 1,270: Hoare triple {38714#(<= ~counter~0 46)} assume !(0 == ~cond); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,393 INFO L290 TraceCheckUtils]: 1,271: Hoare triple {38714#(<= ~counter~0 46)} assume true; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,393 INFO L284 TraceCheckUtils]: 1,272: Hoare quadruple {38714#(<= ~counter~0 46)} {38714#(<= ~counter~0 46)} #59#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,394 INFO L272 TraceCheckUtils]: 1,273: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,394 INFO L290 TraceCheckUtils]: 1,274: Hoare triple {38714#(<= ~counter~0 46)} ~cond := #in~cond; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,394 INFO L290 TraceCheckUtils]: 1,275: Hoare triple {38714#(<= ~counter~0 46)} assume !(0 == ~cond); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,394 INFO L290 TraceCheckUtils]: 1,276: Hoare triple {38714#(<= ~counter~0 46)} assume true; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,394 INFO L284 TraceCheckUtils]: 1,277: Hoare quadruple {38714#(<= ~counter~0 46)} {38714#(<= ~counter~0 46)} #61#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,395 INFO L272 TraceCheckUtils]: 1,278: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,395 INFO L290 TraceCheckUtils]: 1,279: Hoare triple {38714#(<= ~counter~0 46)} ~cond := #in~cond; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,395 INFO L290 TraceCheckUtils]: 1,280: Hoare triple {38714#(<= ~counter~0 46)} assume !(0 == ~cond); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,395 INFO L290 TraceCheckUtils]: 1,281: Hoare triple {38714#(<= ~counter~0 46)} assume true; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,396 INFO L284 TraceCheckUtils]: 1,282: Hoare quadruple {38714#(<= ~counter~0 46)} {38714#(<= ~counter~0 46)} #63#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,396 INFO L272 TraceCheckUtils]: 1,283: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,396 INFO L290 TraceCheckUtils]: 1,284: Hoare triple {38714#(<= ~counter~0 46)} ~cond := #in~cond; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,396 INFO L290 TraceCheckUtils]: 1,285: Hoare triple {38714#(<= ~counter~0 46)} assume !(0 == ~cond); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,397 INFO L290 TraceCheckUtils]: 1,286: Hoare triple {38714#(<= ~counter~0 46)} assume true; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,397 INFO L284 TraceCheckUtils]: 1,287: Hoare quadruple {38714#(<= ~counter~0 46)} {38714#(<= ~counter~0 46)} #65#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,398 INFO L272 TraceCheckUtils]: 1,288: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,398 INFO L290 TraceCheckUtils]: 1,289: Hoare triple {38714#(<= ~counter~0 46)} ~cond := #in~cond; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,398 INFO L290 TraceCheckUtils]: 1,290: Hoare triple {38714#(<= ~counter~0 46)} assume !(0 == ~cond); {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,399 INFO L290 TraceCheckUtils]: 1,291: Hoare triple {38714#(<= ~counter~0 46)} assume true; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,399 INFO L284 TraceCheckUtils]: 1,292: Hoare quadruple {38714#(<= ~counter~0 46)} {38714#(<= ~counter~0 46)} #67#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,399 INFO L290 TraceCheckUtils]: 1,293: Hoare triple {38714#(<= ~counter~0 46)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:00,399 INFO L290 TraceCheckUtils]: 1,294: Hoare triple {38714#(<= ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38799#(<= |main_#t~post5| 46)} is VALID [2022-04-27 12:16:00,400 INFO L290 TraceCheckUtils]: 1,295: Hoare triple {38799#(<= |main_#t~post5| 46)} assume !(#t~post5 < 50);havoc #t~post5; {34866#false} is VALID [2022-04-27 12:16:00,400 INFO L272 TraceCheckUtils]: 1,296: Hoare triple {34866#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34866#false} is VALID [2022-04-27 12:16:00,400 INFO L290 TraceCheckUtils]: 1,297: Hoare triple {34866#false} ~cond := #in~cond; {34866#false} is VALID [2022-04-27 12:16:00,400 INFO L290 TraceCheckUtils]: 1,298: Hoare triple {34866#false} assume !(0 == ~cond); {34866#false} is VALID [2022-04-27 12:16:00,400 INFO L290 TraceCheckUtils]: 1,299: Hoare triple {34866#false} assume true; {34866#false} is VALID [2022-04-27 12:16:00,400 INFO L284 TraceCheckUtils]: 1,300: Hoare quadruple {34866#false} {34866#false} #69#return; {34866#false} is VALID [2022-04-27 12:16:00,400 INFO L272 TraceCheckUtils]: 1,301: Hoare triple {34866#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {34866#false} is VALID [2022-04-27 12:16:00,400 INFO L290 TraceCheckUtils]: 1,302: Hoare triple {34866#false} ~cond := #in~cond; {34866#false} is VALID [2022-04-27 12:16:00,400 INFO L290 TraceCheckUtils]: 1,303: Hoare triple {34866#false} assume 0 == ~cond; {34866#false} is VALID [2022-04-27 12:16:00,400 INFO L290 TraceCheckUtils]: 1,304: Hoare triple {34866#false} assume !false; {34866#false} is VALID [2022-04-27 12:16:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 1380 proven. 111872 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2022-04-27 12:16:00,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:16:03,650 INFO L290 TraceCheckUtils]: 1,304: Hoare triple {34866#false} assume !false; {34866#false} is VALID [2022-04-27 12:16:03,650 INFO L290 TraceCheckUtils]: 1,303: Hoare triple {34866#false} assume 0 == ~cond; {34866#false} is VALID [2022-04-27 12:16:03,650 INFO L290 TraceCheckUtils]: 1,302: Hoare triple {34866#false} ~cond := #in~cond; {34866#false} is VALID [2022-04-27 12:16:03,650 INFO L272 TraceCheckUtils]: 1,301: Hoare triple {34866#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {34866#false} is VALID [2022-04-27 12:16:03,650 INFO L284 TraceCheckUtils]: 1,300: Hoare quadruple {34865#true} {34866#false} #69#return; {34866#false} is VALID [2022-04-27 12:16:03,650 INFO L290 TraceCheckUtils]: 1,299: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,650 INFO L290 TraceCheckUtils]: 1,298: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,650 INFO L290 TraceCheckUtils]: 1,297: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,650 INFO L272 TraceCheckUtils]: 1,296: Hoare triple {34866#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,675 INFO L290 TraceCheckUtils]: 1,295: Hoare triple {38857#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {34866#false} is VALID [2022-04-27 12:16:03,675 INFO L290 TraceCheckUtils]: 1,294: Hoare triple {38861#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38857#(< |main_#t~post5| 50)} is VALID [2022-04-27 12:16:03,676 INFO L290 TraceCheckUtils]: 1,293: Hoare triple {38861#(< ~counter~0 50)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38861#(< ~counter~0 50)} is VALID [2022-04-27 12:16:03,676 INFO L284 TraceCheckUtils]: 1,292: Hoare quadruple {34865#true} {38861#(< ~counter~0 50)} #67#return; {38861#(< ~counter~0 50)} is VALID [2022-04-27 12:16:03,676 INFO L290 TraceCheckUtils]: 1,291: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,676 INFO L290 TraceCheckUtils]: 1,290: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,676 INFO L290 TraceCheckUtils]: 1,289: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,676 INFO L272 TraceCheckUtils]: 1,288: Hoare triple {38861#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,677 INFO L284 TraceCheckUtils]: 1,287: Hoare quadruple {34865#true} {38861#(< ~counter~0 50)} #65#return; {38861#(< ~counter~0 50)} is VALID [2022-04-27 12:16:03,677 INFO L290 TraceCheckUtils]: 1,286: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,677 INFO L290 TraceCheckUtils]: 1,285: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,677 INFO L290 TraceCheckUtils]: 1,284: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,677 INFO L272 TraceCheckUtils]: 1,283: Hoare triple {38861#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,677 INFO L284 TraceCheckUtils]: 1,282: Hoare quadruple {34865#true} {38861#(< ~counter~0 50)} #63#return; {38861#(< ~counter~0 50)} is VALID [2022-04-27 12:16:03,677 INFO L290 TraceCheckUtils]: 1,281: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,677 INFO L290 TraceCheckUtils]: 1,280: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,677 INFO L290 TraceCheckUtils]: 1,279: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,678 INFO L272 TraceCheckUtils]: 1,278: Hoare triple {38861#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,678 INFO L284 TraceCheckUtils]: 1,277: Hoare quadruple {34865#true} {38861#(< ~counter~0 50)} #61#return; {38861#(< ~counter~0 50)} is VALID [2022-04-27 12:16:03,678 INFO L290 TraceCheckUtils]: 1,276: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,678 INFO L290 TraceCheckUtils]: 1,275: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,678 INFO L290 TraceCheckUtils]: 1,274: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,678 INFO L272 TraceCheckUtils]: 1,273: Hoare triple {38861#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,678 INFO L284 TraceCheckUtils]: 1,272: Hoare quadruple {34865#true} {38861#(< ~counter~0 50)} #59#return; {38861#(< ~counter~0 50)} is VALID [2022-04-27 12:16:03,679 INFO L290 TraceCheckUtils]: 1,271: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,679 INFO L290 TraceCheckUtils]: 1,270: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,679 INFO L290 TraceCheckUtils]: 1,269: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,679 INFO L272 TraceCheckUtils]: 1,268: Hoare triple {38861#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,679 INFO L290 TraceCheckUtils]: 1,267: Hoare triple {38861#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {38861#(< ~counter~0 50)} is VALID [2022-04-27 12:16:03,680 INFO L290 TraceCheckUtils]: 1,266: Hoare triple {38946#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38861#(< ~counter~0 50)} is VALID [2022-04-27 12:16:03,680 INFO L290 TraceCheckUtils]: 1,265: Hoare triple {38946#(< ~counter~0 49)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38946#(< ~counter~0 49)} is VALID [2022-04-27 12:16:03,680 INFO L284 TraceCheckUtils]: 1,264: Hoare quadruple {34865#true} {38946#(< ~counter~0 49)} #67#return; {38946#(< ~counter~0 49)} is VALID [2022-04-27 12:16:03,680 INFO L290 TraceCheckUtils]: 1,263: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,681 INFO L290 TraceCheckUtils]: 1,262: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,681 INFO L290 TraceCheckUtils]: 1,261: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,681 INFO L272 TraceCheckUtils]: 1,260: Hoare triple {38946#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,681 INFO L284 TraceCheckUtils]: 1,259: Hoare quadruple {34865#true} {38946#(< ~counter~0 49)} #65#return; {38946#(< ~counter~0 49)} is VALID [2022-04-27 12:16:03,681 INFO L290 TraceCheckUtils]: 1,258: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,681 INFO L290 TraceCheckUtils]: 1,257: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,681 INFO L290 TraceCheckUtils]: 1,256: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,681 INFO L272 TraceCheckUtils]: 1,255: Hoare triple {38946#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,682 INFO L284 TraceCheckUtils]: 1,254: Hoare quadruple {34865#true} {38946#(< ~counter~0 49)} #63#return; {38946#(< ~counter~0 49)} is VALID [2022-04-27 12:16:03,682 INFO L290 TraceCheckUtils]: 1,253: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,682 INFO L290 TraceCheckUtils]: 1,252: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,682 INFO L290 TraceCheckUtils]: 1,251: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,682 INFO L272 TraceCheckUtils]: 1,250: Hoare triple {38946#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,682 INFO L284 TraceCheckUtils]: 1,249: Hoare quadruple {34865#true} {38946#(< ~counter~0 49)} #61#return; {38946#(< ~counter~0 49)} is VALID [2022-04-27 12:16:03,682 INFO L290 TraceCheckUtils]: 1,248: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,682 INFO L290 TraceCheckUtils]: 1,247: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,682 INFO L290 TraceCheckUtils]: 1,246: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,682 INFO L272 TraceCheckUtils]: 1,245: Hoare triple {38946#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,683 INFO L284 TraceCheckUtils]: 1,244: Hoare quadruple {34865#true} {38946#(< ~counter~0 49)} #59#return; {38946#(< ~counter~0 49)} is VALID [2022-04-27 12:16:03,683 INFO L290 TraceCheckUtils]: 1,243: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,683 INFO L290 TraceCheckUtils]: 1,242: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,683 INFO L290 TraceCheckUtils]: 1,241: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,683 INFO L272 TraceCheckUtils]: 1,240: Hoare triple {38946#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,683 INFO L290 TraceCheckUtils]: 1,239: Hoare triple {38946#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {38946#(< ~counter~0 49)} is VALID [2022-04-27 12:16:03,684 INFO L290 TraceCheckUtils]: 1,238: Hoare triple {39031#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38946#(< ~counter~0 49)} is VALID [2022-04-27 12:16:03,684 INFO L290 TraceCheckUtils]: 1,237: Hoare triple {39031#(< ~counter~0 48)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {39031#(< ~counter~0 48)} is VALID [2022-04-27 12:16:03,684 INFO L284 TraceCheckUtils]: 1,236: Hoare quadruple {34865#true} {39031#(< ~counter~0 48)} #67#return; {39031#(< ~counter~0 48)} is VALID [2022-04-27 12:16:03,684 INFO L290 TraceCheckUtils]: 1,235: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,684 INFO L290 TraceCheckUtils]: 1,234: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,684 INFO L290 TraceCheckUtils]: 1,233: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,685 INFO L272 TraceCheckUtils]: 1,232: Hoare triple {39031#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,685 INFO L284 TraceCheckUtils]: 1,231: Hoare quadruple {34865#true} {39031#(< ~counter~0 48)} #65#return; {39031#(< ~counter~0 48)} is VALID [2022-04-27 12:16:03,685 INFO L290 TraceCheckUtils]: 1,230: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,685 INFO L290 TraceCheckUtils]: 1,229: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,685 INFO L290 TraceCheckUtils]: 1,228: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,685 INFO L272 TraceCheckUtils]: 1,227: Hoare triple {39031#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,686 INFO L284 TraceCheckUtils]: 1,226: Hoare quadruple {34865#true} {39031#(< ~counter~0 48)} #63#return; {39031#(< ~counter~0 48)} is VALID [2022-04-27 12:16:03,686 INFO L290 TraceCheckUtils]: 1,225: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,686 INFO L290 TraceCheckUtils]: 1,224: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,686 INFO L290 TraceCheckUtils]: 1,223: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,686 INFO L272 TraceCheckUtils]: 1,222: Hoare triple {39031#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,686 INFO L284 TraceCheckUtils]: 1,221: Hoare quadruple {34865#true} {39031#(< ~counter~0 48)} #61#return; {39031#(< ~counter~0 48)} is VALID [2022-04-27 12:16:03,686 INFO L290 TraceCheckUtils]: 1,220: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,686 INFO L290 TraceCheckUtils]: 1,219: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,686 INFO L290 TraceCheckUtils]: 1,218: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,686 INFO L272 TraceCheckUtils]: 1,217: Hoare triple {39031#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,687 INFO L284 TraceCheckUtils]: 1,216: Hoare quadruple {34865#true} {39031#(< ~counter~0 48)} #59#return; {39031#(< ~counter~0 48)} is VALID [2022-04-27 12:16:03,687 INFO L290 TraceCheckUtils]: 1,215: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,687 INFO L290 TraceCheckUtils]: 1,214: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,687 INFO L290 TraceCheckUtils]: 1,213: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,687 INFO L272 TraceCheckUtils]: 1,212: Hoare triple {39031#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,687 INFO L290 TraceCheckUtils]: 1,211: Hoare triple {39031#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {39031#(< ~counter~0 48)} is VALID [2022-04-27 12:16:03,688 INFO L290 TraceCheckUtils]: 1,210: Hoare triple {38714#(<= ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39031#(< ~counter~0 48)} is VALID [2022-04-27 12:16:03,688 INFO L290 TraceCheckUtils]: 1,209: Hoare triple {38714#(<= ~counter~0 46)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:03,688 INFO L284 TraceCheckUtils]: 1,208: Hoare quadruple {34865#true} {38714#(<= ~counter~0 46)} #67#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:03,688 INFO L290 TraceCheckUtils]: 1,207: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,688 INFO L290 TraceCheckUtils]: 1,206: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,688 INFO L290 TraceCheckUtils]: 1,205: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,689 INFO L272 TraceCheckUtils]: 1,204: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,689 INFO L284 TraceCheckUtils]: 1,203: Hoare quadruple {34865#true} {38714#(<= ~counter~0 46)} #65#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:03,689 INFO L290 TraceCheckUtils]: 1,202: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,689 INFO L290 TraceCheckUtils]: 1,201: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,689 INFO L290 TraceCheckUtils]: 1,200: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,689 INFO L272 TraceCheckUtils]: 1,199: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,689 INFO L284 TraceCheckUtils]: 1,198: Hoare quadruple {34865#true} {38714#(<= ~counter~0 46)} #63#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:03,690 INFO L290 TraceCheckUtils]: 1,197: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,690 INFO L290 TraceCheckUtils]: 1,196: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,690 INFO L290 TraceCheckUtils]: 1,195: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,690 INFO L272 TraceCheckUtils]: 1,194: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,690 INFO L284 TraceCheckUtils]: 1,193: Hoare quadruple {34865#true} {38714#(<= ~counter~0 46)} #61#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:03,690 INFO L290 TraceCheckUtils]: 1,192: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,690 INFO L290 TraceCheckUtils]: 1,191: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,690 INFO L290 TraceCheckUtils]: 1,190: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,690 INFO L272 TraceCheckUtils]: 1,189: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,691 INFO L284 TraceCheckUtils]: 1,188: Hoare quadruple {34865#true} {38714#(<= ~counter~0 46)} #59#return; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:03,691 INFO L290 TraceCheckUtils]: 1,187: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,691 INFO L290 TraceCheckUtils]: 1,186: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,691 INFO L290 TraceCheckUtils]: 1,185: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,691 INFO L272 TraceCheckUtils]: 1,184: Hoare triple {38714#(<= ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,691 INFO L290 TraceCheckUtils]: 1,183: Hoare triple {38714#(<= ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:03,692 INFO L290 TraceCheckUtils]: 1,182: Hoare triple {38629#(<= ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38714#(<= ~counter~0 46)} is VALID [2022-04-27 12:16:03,692 INFO L290 TraceCheckUtils]: 1,181: Hoare triple {38629#(<= ~counter~0 45)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:03,692 INFO L284 TraceCheckUtils]: 1,180: Hoare quadruple {34865#true} {38629#(<= ~counter~0 45)} #67#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:03,692 INFO L290 TraceCheckUtils]: 1,179: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,692 INFO L290 TraceCheckUtils]: 1,178: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,692 INFO L290 TraceCheckUtils]: 1,177: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,692 INFO L272 TraceCheckUtils]: 1,176: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,693 INFO L284 TraceCheckUtils]: 1,175: Hoare quadruple {34865#true} {38629#(<= ~counter~0 45)} #65#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:03,693 INFO L290 TraceCheckUtils]: 1,174: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,693 INFO L290 TraceCheckUtils]: 1,173: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,693 INFO L290 TraceCheckUtils]: 1,172: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,693 INFO L272 TraceCheckUtils]: 1,171: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,693 INFO L284 TraceCheckUtils]: 1,170: Hoare quadruple {34865#true} {38629#(<= ~counter~0 45)} #63#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:03,694 INFO L290 TraceCheckUtils]: 1,169: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,694 INFO L290 TraceCheckUtils]: 1,168: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,694 INFO L290 TraceCheckUtils]: 1,167: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,694 INFO L272 TraceCheckUtils]: 1,166: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,694 INFO L284 TraceCheckUtils]: 1,165: Hoare quadruple {34865#true} {38629#(<= ~counter~0 45)} #61#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:03,694 INFO L290 TraceCheckUtils]: 1,164: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,694 INFO L290 TraceCheckUtils]: 1,163: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,694 INFO L290 TraceCheckUtils]: 1,162: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,694 INFO L272 TraceCheckUtils]: 1,161: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,695 INFO L284 TraceCheckUtils]: 1,160: Hoare quadruple {34865#true} {38629#(<= ~counter~0 45)} #59#return; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:03,695 INFO L290 TraceCheckUtils]: 1,159: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,695 INFO L290 TraceCheckUtils]: 1,158: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,695 INFO L290 TraceCheckUtils]: 1,157: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,695 INFO L272 TraceCheckUtils]: 1,156: Hoare triple {38629#(<= ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,695 INFO L290 TraceCheckUtils]: 1,155: Hoare triple {38629#(<= ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:03,696 INFO L290 TraceCheckUtils]: 1,154: Hoare triple {38544#(<= ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38629#(<= ~counter~0 45)} is VALID [2022-04-27 12:16:03,696 INFO L290 TraceCheckUtils]: 1,153: Hoare triple {38544#(<= ~counter~0 44)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:03,696 INFO L284 TraceCheckUtils]: 1,152: Hoare quadruple {34865#true} {38544#(<= ~counter~0 44)} #67#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:03,696 INFO L290 TraceCheckUtils]: 1,151: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,696 INFO L290 TraceCheckUtils]: 1,150: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,696 INFO L290 TraceCheckUtils]: 1,149: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,696 INFO L272 TraceCheckUtils]: 1,148: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,697 INFO L284 TraceCheckUtils]: 1,147: Hoare quadruple {34865#true} {38544#(<= ~counter~0 44)} #65#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:03,697 INFO L290 TraceCheckUtils]: 1,146: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,697 INFO L290 TraceCheckUtils]: 1,145: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,697 INFO L290 TraceCheckUtils]: 1,144: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,697 INFO L272 TraceCheckUtils]: 1,143: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,697 INFO L284 TraceCheckUtils]: 1,142: Hoare quadruple {34865#true} {38544#(<= ~counter~0 44)} #63#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:03,698 INFO L290 TraceCheckUtils]: 1,141: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,698 INFO L290 TraceCheckUtils]: 1,140: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,698 INFO L290 TraceCheckUtils]: 1,139: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,698 INFO L272 TraceCheckUtils]: 1,138: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,698 INFO L284 TraceCheckUtils]: 1,137: Hoare quadruple {34865#true} {38544#(<= ~counter~0 44)} #61#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:03,698 INFO L290 TraceCheckUtils]: 1,136: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,698 INFO L290 TraceCheckUtils]: 1,135: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,698 INFO L290 TraceCheckUtils]: 1,134: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,698 INFO L272 TraceCheckUtils]: 1,133: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,699 INFO L284 TraceCheckUtils]: 1,132: Hoare quadruple {34865#true} {38544#(<= ~counter~0 44)} #59#return; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:03,699 INFO L290 TraceCheckUtils]: 1,131: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,699 INFO L290 TraceCheckUtils]: 1,130: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,699 INFO L290 TraceCheckUtils]: 1,129: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,699 INFO L272 TraceCheckUtils]: 1,128: Hoare triple {38544#(<= ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,699 INFO L290 TraceCheckUtils]: 1,127: Hoare triple {38544#(<= ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:03,700 INFO L290 TraceCheckUtils]: 1,126: Hoare triple {38459#(<= ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38544#(<= ~counter~0 44)} is VALID [2022-04-27 12:16:03,700 INFO L290 TraceCheckUtils]: 1,125: Hoare triple {38459#(<= ~counter~0 43)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:03,700 INFO L284 TraceCheckUtils]: 1,124: Hoare quadruple {34865#true} {38459#(<= ~counter~0 43)} #67#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:03,700 INFO L290 TraceCheckUtils]: 1,123: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,700 INFO L290 TraceCheckUtils]: 1,122: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,700 INFO L290 TraceCheckUtils]: 1,121: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,700 INFO L272 TraceCheckUtils]: 1,120: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,701 INFO L284 TraceCheckUtils]: 1,119: Hoare quadruple {34865#true} {38459#(<= ~counter~0 43)} #65#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:03,701 INFO L290 TraceCheckUtils]: 1,118: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,701 INFO L290 TraceCheckUtils]: 1,117: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,701 INFO L290 TraceCheckUtils]: 1,116: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,701 INFO L272 TraceCheckUtils]: 1,115: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,701 INFO L284 TraceCheckUtils]: 1,114: Hoare quadruple {34865#true} {38459#(<= ~counter~0 43)} #63#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:03,701 INFO L290 TraceCheckUtils]: 1,113: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,702 INFO L290 TraceCheckUtils]: 1,112: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,702 INFO L290 TraceCheckUtils]: 1,111: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,702 INFO L272 TraceCheckUtils]: 1,110: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,702 INFO L284 TraceCheckUtils]: 1,109: Hoare quadruple {34865#true} {38459#(<= ~counter~0 43)} #61#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:03,702 INFO L290 TraceCheckUtils]: 1,108: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,702 INFO L290 TraceCheckUtils]: 1,107: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,702 INFO L290 TraceCheckUtils]: 1,106: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,702 INFO L272 TraceCheckUtils]: 1,105: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,703 INFO L284 TraceCheckUtils]: 1,104: Hoare quadruple {34865#true} {38459#(<= ~counter~0 43)} #59#return; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:03,703 INFO L290 TraceCheckUtils]: 1,103: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,703 INFO L290 TraceCheckUtils]: 1,102: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,703 INFO L290 TraceCheckUtils]: 1,101: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,703 INFO L272 TraceCheckUtils]: 1,100: Hoare triple {38459#(<= ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,703 INFO L290 TraceCheckUtils]: 1,099: Hoare triple {38459#(<= ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:03,703 INFO L290 TraceCheckUtils]: 1,098: Hoare triple {38374#(<= ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38459#(<= ~counter~0 43)} is VALID [2022-04-27 12:16:03,704 INFO L290 TraceCheckUtils]: 1,097: Hoare triple {38374#(<= ~counter~0 42)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:03,704 INFO L284 TraceCheckUtils]: 1,096: Hoare quadruple {34865#true} {38374#(<= ~counter~0 42)} #67#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:03,704 INFO L290 TraceCheckUtils]: 1,095: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,704 INFO L290 TraceCheckUtils]: 1,094: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,704 INFO L290 TraceCheckUtils]: 1,093: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,704 INFO L272 TraceCheckUtils]: 1,092: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,705 INFO L284 TraceCheckUtils]: 1,091: Hoare quadruple {34865#true} {38374#(<= ~counter~0 42)} #65#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:03,705 INFO L290 TraceCheckUtils]: 1,090: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,705 INFO L290 TraceCheckUtils]: 1,089: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,705 INFO L290 TraceCheckUtils]: 1,088: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,705 INFO L272 TraceCheckUtils]: 1,087: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,705 INFO L284 TraceCheckUtils]: 1,086: Hoare quadruple {34865#true} {38374#(<= ~counter~0 42)} #63#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:03,705 INFO L290 TraceCheckUtils]: 1,085: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,705 INFO L290 TraceCheckUtils]: 1,084: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,705 INFO L290 TraceCheckUtils]: 1,083: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,706 INFO L272 TraceCheckUtils]: 1,082: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,706 INFO L284 TraceCheckUtils]: 1,081: Hoare quadruple {34865#true} {38374#(<= ~counter~0 42)} #61#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:03,706 INFO L290 TraceCheckUtils]: 1,080: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,706 INFO L290 TraceCheckUtils]: 1,079: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,706 INFO L290 TraceCheckUtils]: 1,078: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,706 INFO L272 TraceCheckUtils]: 1,077: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,706 INFO L284 TraceCheckUtils]: 1,076: Hoare quadruple {34865#true} {38374#(<= ~counter~0 42)} #59#return; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:03,707 INFO L290 TraceCheckUtils]: 1,075: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,707 INFO L290 TraceCheckUtils]: 1,074: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,707 INFO L290 TraceCheckUtils]: 1,073: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,707 INFO L272 TraceCheckUtils]: 1,072: Hoare triple {38374#(<= ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,707 INFO L290 TraceCheckUtils]: 1,071: Hoare triple {38374#(<= ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:03,707 INFO L290 TraceCheckUtils]: 1,070: Hoare triple {38289#(<= ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38374#(<= ~counter~0 42)} is VALID [2022-04-27 12:16:03,708 INFO L290 TraceCheckUtils]: 1,069: Hoare triple {38289#(<= ~counter~0 41)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:03,708 INFO L284 TraceCheckUtils]: 1,068: Hoare quadruple {34865#true} {38289#(<= ~counter~0 41)} #67#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:03,708 INFO L290 TraceCheckUtils]: 1,067: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,708 INFO L290 TraceCheckUtils]: 1,066: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,708 INFO L290 TraceCheckUtils]: 1,065: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,708 INFO L272 TraceCheckUtils]: 1,064: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,709 INFO L284 TraceCheckUtils]: 1,063: Hoare quadruple {34865#true} {38289#(<= ~counter~0 41)} #65#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:03,709 INFO L290 TraceCheckUtils]: 1,062: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,709 INFO L290 TraceCheckUtils]: 1,061: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,709 INFO L290 TraceCheckUtils]: 1,060: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,709 INFO L272 TraceCheckUtils]: 1,059: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,709 INFO L284 TraceCheckUtils]: 1,058: Hoare quadruple {34865#true} {38289#(<= ~counter~0 41)} #63#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:03,709 INFO L290 TraceCheckUtils]: 1,057: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,709 INFO L290 TraceCheckUtils]: 1,056: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,709 INFO L290 TraceCheckUtils]: 1,055: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,709 INFO L272 TraceCheckUtils]: 1,054: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,710 INFO L284 TraceCheckUtils]: 1,053: Hoare quadruple {34865#true} {38289#(<= ~counter~0 41)} #61#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:03,710 INFO L290 TraceCheckUtils]: 1,052: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,710 INFO L290 TraceCheckUtils]: 1,051: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,710 INFO L290 TraceCheckUtils]: 1,050: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,710 INFO L272 TraceCheckUtils]: 1,049: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,710 INFO L284 TraceCheckUtils]: 1,048: Hoare quadruple {34865#true} {38289#(<= ~counter~0 41)} #59#return; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:03,710 INFO L290 TraceCheckUtils]: 1,047: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,711 INFO L290 TraceCheckUtils]: 1,046: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,711 INFO L290 TraceCheckUtils]: 1,045: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,711 INFO L272 TraceCheckUtils]: 1,044: Hoare triple {38289#(<= ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,711 INFO L290 TraceCheckUtils]: 1,043: Hoare triple {38289#(<= ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:03,711 INFO L290 TraceCheckUtils]: 1,042: Hoare triple {38204#(<= ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38289#(<= ~counter~0 41)} is VALID [2022-04-27 12:16:03,712 INFO L290 TraceCheckUtils]: 1,041: Hoare triple {38204#(<= ~counter~0 40)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:03,712 INFO L284 TraceCheckUtils]: 1,040: Hoare quadruple {34865#true} {38204#(<= ~counter~0 40)} #67#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:03,712 INFO L290 TraceCheckUtils]: 1,039: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,712 INFO L290 TraceCheckUtils]: 1,038: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,712 INFO L290 TraceCheckUtils]: 1,037: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,712 INFO L272 TraceCheckUtils]: 1,036: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,713 INFO L284 TraceCheckUtils]: 1,035: Hoare quadruple {34865#true} {38204#(<= ~counter~0 40)} #65#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:03,713 INFO L290 TraceCheckUtils]: 1,034: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,713 INFO L290 TraceCheckUtils]: 1,033: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,713 INFO L290 TraceCheckUtils]: 1,032: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,713 INFO L272 TraceCheckUtils]: 1,031: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,713 INFO L284 TraceCheckUtils]: 1,030: Hoare quadruple {34865#true} {38204#(<= ~counter~0 40)} #63#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:03,713 INFO L290 TraceCheckUtils]: 1,029: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,713 INFO L290 TraceCheckUtils]: 1,028: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,713 INFO L290 TraceCheckUtils]: 1,027: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,713 INFO L272 TraceCheckUtils]: 1,026: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,714 INFO L284 TraceCheckUtils]: 1,025: Hoare quadruple {34865#true} {38204#(<= ~counter~0 40)} #61#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:03,714 INFO L290 TraceCheckUtils]: 1,024: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,714 INFO L290 TraceCheckUtils]: 1,023: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,714 INFO L290 TraceCheckUtils]: 1,022: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,714 INFO L272 TraceCheckUtils]: 1,021: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,714 INFO L284 TraceCheckUtils]: 1,020: Hoare quadruple {34865#true} {38204#(<= ~counter~0 40)} #59#return; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:03,714 INFO L290 TraceCheckUtils]: 1,019: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,714 INFO L290 TraceCheckUtils]: 1,018: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,715 INFO L290 TraceCheckUtils]: 1,017: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,715 INFO L272 TraceCheckUtils]: 1,016: Hoare triple {38204#(<= ~counter~0 40)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,715 INFO L290 TraceCheckUtils]: 1,015: Hoare triple {38204#(<= ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:03,715 INFO L290 TraceCheckUtils]: 1,014: Hoare triple {38119#(<= ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38204#(<= ~counter~0 40)} is VALID [2022-04-27 12:16:03,716 INFO L290 TraceCheckUtils]: 1,013: Hoare triple {38119#(<= ~counter~0 39)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:03,716 INFO L284 TraceCheckUtils]: 1,012: Hoare quadruple {34865#true} {38119#(<= ~counter~0 39)} #67#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:03,716 INFO L290 TraceCheckUtils]: 1,011: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,716 INFO L290 TraceCheckUtils]: 1,010: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,716 INFO L290 TraceCheckUtils]: 1,009: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,716 INFO L272 TraceCheckUtils]: 1,008: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,717 INFO L284 TraceCheckUtils]: 1,007: Hoare quadruple {34865#true} {38119#(<= ~counter~0 39)} #65#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:03,717 INFO L290 TraceCheckUtils]: 1,006: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,717 INFO L290 TraceCheckUtils]: 1,005: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,717 INFO L290 TraceCheckUtils]: 1,004: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,717 INFO L272 TraceCheckUtils]: 1,003: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,717 INFO L284 TraceCheckUtils]: 1,002: Hoare quadruple {34865#true} {38119#(<= ~counter~0 39)} #63#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:03,717 INFO L290 TraceCheckUtils]: 1,001: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,717 INFO L290 TraceCheckUtils]: 1,000: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,717 INFO L290 TraceCheckUtils]: 999: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,717 INFO L272 TraceCheckUtils]: 998: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,718 INFO L284 TraceCheckUtils]: 997: Hoare quadruple {34865#true} {38119#(<= ~counter~0 39)} #61#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:03,718 INFO L290 TraceCheckUtils]: 996: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,718 INFO L290 TraceCheckUtils]: 995: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,718 INFO L290 TraceCheckUtils]: 994: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,718 INFO L272 TraceCheckUtils]: 993: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,719 INFO L284 TraceCheckUtils]: 992: Hoare quadruple {34865#true} {38119#(<= ~counter~0 39)} #59#return; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:03,719 INFO L290 TraceCheckUtils]: 991: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,719 INFO L290 TraceCheckUtils]: 990: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,719 INFO L290 TraceCheckUtils]: 989: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,719 INFO L272 TraceCheckUtils]: 988: Hoare triple {38119#(<= ~counter~0 39)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,719 INFO L290 TraceCheckUtils]: 987: Hoare triple {38119#(<= ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:03,720 INFO L290 TraceCheckUtils]: 986: Hoare triple {38034#(<= ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38119#(<= ~counter~0 39)} is VALID [2022-04-27 12:16:03,720 INFO L290 TraceCheckUtils]: 985: Hoare triple {38034#(<= ~counter~0 38)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:03,720 INFO L284 TraceCheckUtils]: 984: Hoare quadruple {34865#true} {38034#(<= ~counter~0 38)} #67#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:03,720 INFO L290 TraceCheckUtils]: 983: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,720 INFO L290 TraceCheckUtils]: 982: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,720 INFO L290 TraceCheckUtils]: 981: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,721 INFO L272 TraceCheckUtils]: 980: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,721 INFO L284 TraceCheckUtils]: 979: Hoare quadruple {34865#true} {38034#(<= ~counter~0 38)} #65#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:03,721 INFO L290 TraceCheckUtils]: 978: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,721 INFO L290 TraceCheckUtils]: 977: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,721 INFO L290 TraceCheckUtils]: 976: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,721 INFO L272 TraceCheckUtils]: 975: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,722 INFO L284 TraceCheckUtils]: 974: Hoare quadruple {34865#true} {38034#(<= ~counter~0 38)} #63#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:03,722 INFO L290 TraceCheckUtils]: 973: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,722 INFO L290 TraceCheckUtils]: 972: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,722 INFO L290 TraceCheckUtils]: 971: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,722 INFO L272 TraceCheckUtils]: 970: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,722 INFO L284 TraceCheckUtils]: 969: Hoare quadruple {34865#true} {38034#(<= ~counter~0 38)} #61#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:03,722 INFO L290 TraceCheckUtils]: 968: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,722 INFO L290 TraceCheckUtils]: 967: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,722 INFO L290 TraceCheckUtils]: 966: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,723 INFO L272 TraceCheckUtils]: 965: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,723 INFO L284 TraceCheckUtils]: 964: Hoare quadruple {34865#true} {38034#(<= ~counter~0 38)} #59#return; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:03,723 INFO L290 TraceCheckUtils]: 963: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,723 INFO L290 TraceCheckUtils]: 962: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,723 INFO L290 TraceCheckUtils]: 961: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,723 INFO L272 TraceCheckUtils]: 960: Hoare triple {38034#(<= ~counter~0 38)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,723 INFO L290 TraceCheckUtils]: 959: Hoare triple {38034#(<= ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:03,724 INFO L290 TraceCheckUtils]: 958: Hoare triple {37949#(<= ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38034#(<= ~counter~0 38)} is VALID [2022-04-27 12:16:03,724 INFO L290 TraceCheckUtils]: 957: Hoare triple {37949#(<= ~counter~0 37)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:03,725 INFO L284 TraceCheckUtils]: 956: Hoare quadruple {34865#true} {37949#(<= ~counter~0 37)} #67#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:03,725 INFO L290 TraceCheckUtils]: 955: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,725 INFO L290 TraceCheckUtils]: 954: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,725 INFO L290 TraceCheckUtils]: 953: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,725 INFO L272 TraceCheckUtils]: 952: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,726 INFO L284 TraceCheckUtils]: 951: Hoare quadruple {34865#true} {37949#(<= ~counter~0 37)} #65#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:03,726 INFO L290 TraceCheckUtils]: 950: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,726 INFO L290 TraceCheckUtils]: 949: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,726 INFO L290 TraceCheckUtils]: 948: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,726 INFO L272 TraceCheckUtils]: 947: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,726 INFO L284 TraceCheckUtils]: 946: Hoare quadruple {34865#true} {37949#(<= ~counter~0 37)} #63#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:03,726 INFO L290 TraceCheckUtils]: 945: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,726 INFO L290 TraceCheckUtils]: 944: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,726 INFO L290 TraceCheckUtils]: 943: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,726 INFO L272 TraceCheckUtils]: 942: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,727 INFO L284 TraceCheckUtils]: 941: Hoare quadruple {34865#true} {37949#(<= ~counter~0 37)} #61#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:03,727 INFO L290 TraceCheckUtils]: 940: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,727 INFO L290 TraceCheckUtils]: 939: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,727 INFO L290 TraceCheckUtils]: 938: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,727 INFO L272 TraceCheckUtils]: 937: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,728 INFO L284 TraceCheckUtils]: 936: Hoare quadruple {34865#true} {37949#(<= ~counter~0 37)} #59#return; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:03,728 INFO L290 TraceCheckUtils]: 935: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,728 INFO L290 TraceCheckUtils]: 934: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,728 INFO L290 TraceCheckUtils]: 933: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,728 INFO L272 TraceCheckUtils]: 932: Hoare triple {37949#(<= ~counter~0 37)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,728 INFO L290 TraceCheckUtils]: 931: Hoare triple {37949#(<= ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:03,729 INFO L290 TraceCheckUtils]: 930: Hoare triple {37864#(<= ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37949#(<= ~counter~0 37)} is VALID [2022-04-27 12:16:03,729 INFO L290 TraceCheckUtils]: 929: Hoare triple {37864#(<= ~counter~0 36)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:03,729 INFO L284 TraceCheckUtils]: 928: Hoare quadruple {34865#true} {37864#(<= ~counter~0 36)} #67#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:03,729 INFO L290 TraceCheckUtils]: 927: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,730 INFO L290 TraceCheckUtils]: 926: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,730 INFO L290 TraceCheckUtils]: 925: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,730 INFO L272 TraceCheckUtils]: 924: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,730 INFO L284 TraceCheckUtils]: 923: Hoare quadruple {34865#true} {37864#(<= ~counter~0 36)} #65#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:03,730 INFO L290 TraceCheckUtils]: 922: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,730 INFO L290 TraceCheckUtils]: 921: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,730 INFO L290 TraceCheckUtils]: 920: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,730 INFO L272 TraceCheckUtils]: 919: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,731 INFO L284 TraceCheckUtils]: 918: Hoare quadruple {34865#true} {37864#(<= ~counter~0 36)} #63#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:03,731 INFO L290 TraceCheckUtils]: 917: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,731 INFO L290 TraceCheckUtils]: 916: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,731 INFO L290 TraceCheckUtils]: 915: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,731 INFO L272 TraceCheckUtils]: 914: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,731 INFO L284 TraceCheckUtils]: 913: Hoare quadruple {34865#true} {37864#(<= ~counter~0 36)} #61#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:03,731 INFO L290 TraceCheckUtils]: 912: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,731 INFO L290 TraceCheckUtils]: 911: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,732 INFO L290 TraceCheckUtils]: 910: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,732 INFO L272 TraceCheckUtils]: 909: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,732 INFO L284 TraceCheckUtils]: 908: Hoare quadruple {34865#true} {37864#(<= ~counter~0 36)} #59#return; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:03,732 INFO L290 TraceCheckUtils]: 907: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,732 INFO L290 TraceCheckUtils]: 906: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,732 INFO L290 TraceCheckUtils]: 905: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,732 INFO L272 TraceCheckUtils]: 904: Hoare triple {37864#(<= ~counter~0 36)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,732 INFO L290 TraceCheckUtils]: 903: Hoare triple {37864#(<= ~counter~0 36)} assume !!(#t~post5 < 50);havoc #t~post5; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:03,733 INFO L290 TraceCheckUtils]: 902: Hoare triple {37779#(<= ~counter~0 35)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37864#(<= ~counter~0 36)} is VALID [2022-04-27 12:16:03,733 INFO L290 TraceCheckUtils]: 901: Hoare triple {37779#(<= ~counter~0 35)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:03,734 INFO L284 TraceCheckUtils]: 900: Hoare quadruple {34865#true} {37779#(<= ~counter~0 35)} #67#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:03,734 INFO L290 TraceCheckUtils]: 899: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,734 INFO L290 TraceCheckUtils]: 898: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,734 INFO L290 TraceCheckUtils]: 897: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,734 INFO L272 TraceCheckUtils]: 896: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,734 INFO L284 TraceCheckUtils]: 895: Hoare quadruple {34865#true} {37779#(<= ~counter~0 35)} #65#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:03,734 INFO L290 TraceCheckUtils]: 894: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,734 INFO L290 TraceCheckUtils]: 893: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,734 INFO L290 TraceCheckUtils]: 892: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,734 INFO L272 TraceCheckUtils]: 891: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,735 INFO L284 TraceCheckUtils]: 890: Hoare quadruple {34865#true} {37779#(<= ~counter~0 35)} #63#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:03,735 INFO L290 TraceCheckUtils]: 889: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,735 INFO L290 TraceCheckUtils]: 888: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,735 INFO L290 TraceCheckUtils]: 887: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,735 INFO L272 TraceCheckUtils]: 886: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,735 INFO L284 TraceCheckUtils]: 885: Hoare quadruple {34865#true} {37779#(<= ~counter~0 35)} #61#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:03,736 INFO L290 TraceCheckUtils]: 884: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,736 INFO L290 TraceCheckUtils]: 883: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,736 INFO L290 TraceCheckUtils]: 882: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,736 INFO L272 TraceCheckUtils]: 881: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,736 INFO L284 TraceCheckUtils]: 880: Hoare quadruple {34865#true} {37779#(<= ~counter~0 35)} #59#return; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:03,736 INFO L290 TraceCheckUtils]: 879: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,736 INFO L290 TraceCheckUtils]: 878: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,736 INFO L290 TraceCheckUtils]: 877: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,736 INFO L272 TraceCheckUtils]: 876: Hoare triple {37779#(<= ~counter~0 35)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,736 INFO L290 TraceCheckUtils]: 875: Hoare triple {37779#(<= ~counter~0 35)} assume !!(#t~post5 < 50);havoc #t~post5; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:03,737 INFO L290 TraceCheckUtils]: 874: Hoare triple {37694#(<= ~counter~0 34)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37779#(<= ~counter~0 35)} is VALID [2022-04-27 12:16:03,737 INFO L290 TraceCheckUtils]: 873: Hoare triple {37694#(<= ~counter~0 34)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:03,738 INFO L284 TraceCheckUtils]: 872: Hoare quadruple {34865#true} {37694#(<= ~counter~0 34)} #67#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:03,738 INFO L290 TraceCheckUtils]: 871: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,738 INFO L290 TraceCheckUtils]: 870: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,738 INFO L290 TraceCheckUtils]: 869: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,738 INFO L272 TraceCheckUtils]: 868: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,738 INFO L284 TraceCheckUtils]: 867: Hoare quadruple {34865#true} {37694#(<= ~counter~0 34)} #65#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:03,738 INFO L290 TraceCheckUtils]: 866: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,738 INFO L290 TraceCheckUtils]: 865: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,738 INFO L290 TraceCheckUtils]: 864: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,739 INFO L272 TraceCheckUtils]: 863: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,739 INFO L284 TraceCheckUtils]: 862: Hoare quadruple {34865#true} {37694#(<= ~counter~0 34)} #63#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:03,739 INFO L290 TraceCheckUtils]: 861: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,739 INFO L290 TraceCheckUtils]: 860: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,739 INFO L290 TraceCheckUtils]: 859: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,739 INFO L272 TraceCheckUtils]: 858: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,740 INFO L284 TraceCheckUtils]: 857: Hoare quadruple {34865#true} {37694#(<= ~counter~0 34)} #61#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:03,740 INFO L290 TraceCheckUtils]: 856: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,740 INFO L290 TraceCheckUtils]: 855: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,740 INFO L290 TraceCheckUtils]: 854: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,740 INFO L272 TraceCheckUtils]: 853: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,740 INFO L284 TraceCheckUtils]: 852: Hoare quadruple {34865#true} {37694#(<= ~counter~0 34)} #59#return; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:03,740 INFO L290 TraceCheckUtils]: 851: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,740 INFO L290 TraceCheckUtils]: 850: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,740 INFO L290 TraceCheckUtils]: 849: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,740 INFO L272 TraceCheckUtils]: 848: Hoare triple {37694#(<= ~counter~0 34)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,741 INFO L290 TraceCheckUtils]: 847: Hoare triple {37694#(<= ~counter~0 34)} assume !!(#t~post5 < 50);havoc #t~post5; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:03,741 INFO L290 TraceCheckUtils]: 846: Hoare triple {37609#(<= ~counter~0 33)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37694#(<= ~counter~0 34)} is VALID [2022-04-27 12:16:03,741 INFO L290 TraceCheckUtils]: 845: Hoare triple {37609#(<= ~counter~0 33)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:03,742 INFO L284 TraceCheckUtils]: 844: Hoare quadruple {34865#true} {37609#(<= ~counter~0 33)} #67#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:03,742 INFO L290 TraceCheckUtils]: 843: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,742 INFO L290 TraceCheckUtils]: 842: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,742 INFO L290 TraceCheckUtils]: 841: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,742 INFO L272 TraceCheckUtils]: 840: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,742 INFO L284 TraceCheckUtils]: 839: Hoare quadruple {34865#true} {37609#(<= ~counter~0 33)} #65#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:03,743 INFO L290 TraceCheckUtils]: 838: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,743 INFO L290 TraceCheckUtils]: 837: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,743 INFO L290 TraceCheckUtils]: 836: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,743 INFO L272 TraceCheckUtils]: 835: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,743 INFO L284 TraceCheckUtils]: 834: Hoare quadruple {34865#true} {37609#(<= ~counter~0 33)} #63#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:03,743 INFO L290 TraceCheckUtils]: 833: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,743 INFO L290 TraceCheckUtils]: 832: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,743 INFO L290 TraceCheckUtils]: 831: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,743 INFO L272 TraceCheckUtils]: 830: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,744 INFO L284 TraceCheckUtils]: 829: Hoare quadruple {34865#true} {37609#(<= ~counter~0 33)} #61#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:03,744 INFO L290 TraceCheckUtils]: 828: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,744 INFO L290 TraceCheckUtils]: 827: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,744 INFO L290 TraceCheckUtils]: 826: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,744 INFO L272 TraceCheckUtils]: 825: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,744 INFO L284 TraceCheckUtils]: 824: Hoare quadruple {34865#true} {37609#(<= ~counter~0 33)} #59#return; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:03,744 INFO L290 TraceCheckUtils]: 823: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,744 INFO L290 TraceCheckUtils]: 822: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,744 INFO L290 TraceCheckUtils]: 821: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,744 INFO L272 TraceCheckUtils]: 820: Hoare triple {37609#(<= ~counter~0 33)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,745 INFO L290 TraceCheckUtils]: 819: Hoare triple {37609#(<= ~counter~0 33)} assume !!(#t~post5 < 50);havoc #t~post5; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:03,745 INFO L290 TraceCheckUtils]: 818: Hoare triple {37524#(<= ~counter~0 32)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37609#(<= ~counter~0 33)} is VALID [2022-04-27 12:16:03,746 INFO L290 TraceCheckUtils]: 817: Hoare triple {37524#(<= ~counter~0 32)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:03,746 INFO L284 TraceCheckUtils]: 816: Hoare quadruple {34865#true} {37524#(<= ~counter~0 32)} #67#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:03,746 INFO L290 TraceCheckUtils]: 815: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,746 INFO L290 TraceCheckUtils]: 814: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,746 INFO L290 TraceCheckUtils]: 813: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,746 INFO L272 TraceCheckUtils]: 812: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,747 INFO L284 TraceCheckUtils]: 811: Hoare quadruple {34865#true} {37524#(<= ~counter~0 32)} #65#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:03,747 INFO L290 TraceCheckUtils]: 810: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,747 INFO L290 TraceCheckUtils]: 809: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,747 INFO L290 TraceCheckUtils]: 808: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,747 INFO L272 TraceCheckUtils]: 807: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,747 INFO L284 TraceCheckUtils]: 806: Hoare quadruple {34865#true} {37524#(<= ~counter~0 32)} #63#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:03,747 INFO L290 TraceCheckUtils]: 805: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,747 INFO L290 TraceCheckUtils]: 804: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,747 INFO L290 TraceCheckUtils]: 803: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,747 INFO L272 TraceCheckUtils]: 802: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,748 INFO L284 TraceCheckUtils]: 801: Hoare quadruple {34865#true} {37524#(<= ~counter~0 32)} #61#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:03,748 INFO L290 TraceCheckUtils]: 800: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,748 INFO L290 TraceCheckUtils]: 799: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,748 INFO L290 TraceCheckUtils]: 798: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,748 INFO L272 TraceCheckUtils]: 797: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,748 INFO L284 TraceCheckUtils]: 796: Hoare quadruple {34865#true} {37524#(<= ~counter~0 32)} #59#return; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:03,748 INFO L290 TraceCheckUtils]: 795: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,749 INFO L290 TraceCheckUtils]: 794: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,749 INFO L290 TraceCheckUtils]: 793: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,749 INFO L272 TraceCheckUtils]: 792: Hoare triple {37524#(<= ~counter~0 32)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,749 INFO L290 TraceCheckUtils]: 791: Hoare triple {37524#(<= ~counter~0 32)} assume !!(#t~post5 < 50);havoc #t~post5; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:03,749 INFO L290 TraceCheckUtils]: 790: Hoare triple {37439#(<= ~counter~0 31)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37524#(<= ~counter~0 32)} is VALID [2022-04-27 12:16:03,750 INFO L290 TraceCheckUtils]: 789: Hoare triple {37439#(<= ~counter~0 31)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:03,750 INFO L284 TraceCheckUtils]: 788: Hoare quadruple {34865#true} {37439#(<= ~counter~0 31)} #67#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:03,750 INFO L290 TraceCheckUtils]: 787: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,750 INFO L290 TraceCheckUtils]: 786: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,750 INFO L290 TraceCheckUtils]: 785: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,750 INFO L272 TraceCheckUtils]: 784: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,751 INFO L284 TraceCheckUtils]: 783: Hoare quadruple {34865#true} {37439#(<= ~counter~0 31)} #65#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:03,751 INFO L290 TraceCheckUtils]: 782: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,751 INFO L290 TraceCheckUtils]: 781: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,751 INFO L290 TraceCheckUtils]: 780: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,751 INFO L272 TraceCheckUtils]: 779: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,751 INFO L284 TraceCheckUtils]: 778: Hoare quadruple {34865#true} {37439#(<= ~counter~0 31)} #63#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:03,751 INFO L290 TraceCheckUtils]: 777: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,751 INFO L290 TraceCheckUtils]: 776: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,751 INFO L290 TraceCheckUtils]: 775: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,751 INFO L272 TraceCheckUtils]: 774: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,752 INFO L284 TraceCheckUtils]: 773: Hoare quadruple {34865#true} {37439#(<= ~counter~0 31)} #61#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:03,752 INFO L290 TraceCheckUtils]: 772: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,752 INFO L290 TraceCheckUtils]: 771: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,752 INFO L290 TraceCheckUtils]: 770: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,752 INFO L272 TraceCheckUtils]: 769: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,752 INFO L284 TraceCheckUtils]: 768: Hoare quadruple {34865#true} {37439#(<= ~counter~0 31)} #59#return; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:03,752 INFO L290 TraceCheckUtils]: 767: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,752 INFO L290 TraceCheckUtils]: 766: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,752 INFO L290 TraceCheckUtils]: 765: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,753 INFO L272 TraceCheckUtils]: 764: Hoare triple {37439#(<= ~counter~0 31)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,753 INFO L290 TraceCheckUtils]: 763: Hoare triple {37439#(<= ~counter~0 31)} assume !!(#t~post5 < 50);havoc #t~post5; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:03,753 INFO L290 TraceCheckUtils]: 762: Hoare triple {37354#(<= ~counter~0 30)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37439#(<= ~counter~0 31)} is VALID [2022-04-27 12:16:03,753 INFO L290 TraceCheckUtils]: 761: Hoare triple {37354#(<= ~counter~0 30)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:03,754 INFO L284 TraceCheckUtils]: 760: Hoare quadruple {34865#true} {37354#(<= ~counter~0 30)} #67#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:03,754 INFO L290 TraceCheckUtils]: 759: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,754 INFO L290 TraceCheckUtils]: 758: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,754 INFO L290 TraceCheckUtils]: 757: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,754 INFO L272 TraceCheckUtils]: 756: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,754 INFO L284 TraceCheckUtils]: 755: Hoare quadruple {34865#true} {37354#(<= ~counter~0 30)} #65#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:03,755 INFO L290 TraceCheckUtils]: 754: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,755 INFO L290 TraceCheckUtils]: 753: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,755 INFO L290 TraceCheckUtils]: 752: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,755 INFO L272 TraceCheckUtils]: 751: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,755 INFO L284 TraceCheckUtils]: 750: Hoare quadruple {34865#true} {37354#(<= ~counter~0 30)} #63#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:03,755 INFO L290 TraceCheckUtils]: 749: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,755 INFO L290 TraceCheckUtils]: 748: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,755 INFO L290 TraceCheckUtils]: 747: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,755 INFO L272 TraceCheckUtils]: 746: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,756 INFO L284 TraceCheckUtils]: 745: Hoare quadruple {34865#true} {37354#(<= ~counter~0 30)} #61#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:03,756 INFO L290 TraceCheckUtils]: 744: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,756 INFO L290 TraceCheckUtils]: 743: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,756 INFO L290 TraceCheckUtils]: 742: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,756 INFO L272 TraceCheckUtils]: 741: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,756 INFO L284 TraceCheckUtils]: 740: Hoare quadruple {34865#true} {37354#(<= ~counter~0 30)} #59#return; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:03,756 INFO L290 TraceCheckUtils]: 739: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,756 INFO L290 TraceCheckUtils]: 738: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,756 INFO L290 TraceCheckUtils]: 737: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,756 INFO L272 TraceCheckUtils]: 736: Hoare triple {37354#(<= ~counter~0 30)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,757 INFO L290 TraceCheckUtils]: 735: Hoare triple {37354#(<= ~counter~0 30)} assume !!(#t~post5 < 50);havoc #t~post5; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:03,757 INFO L290 TraceCheckUtils]: 734: Hoare triple {37269#(<= ~counter~0 29)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37354#(<= ~counter~0 30)} is VALID [2022-04-27 12:16:03,757 INFO L290 TraceCheckUtils]: 733: Hoare triple {37269#(<= ~counter~0 29)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:03,758 INFO L284 TraceCheckUtils]: 732: Hoare quadruple {34865#true} {37269#(<= ~counter~0 29)} #67#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:03,758 INFO L290 TraceCheckUtils]: 731: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,758 INFO L290 TraceCheckUtils]: 730: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,758 INFO L290 TraceCheckUtils]: 729: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,758 INFO L272 TraceCheckUtils]: 728: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,758 INFO L284 TraceCheckUtils]: 727: Hoare quadruple {34865#true} {37269#(<= ~counter~0 29)} #65#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:03,759 INFO L290 TraceCheckUtils]: 726: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,759 INFO L290 TraceCheckUtils]: 725: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,759 INFO L290 TraceCheckUtils]: 724: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,759 INFO L272 TraceCheckUtils]: 723: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,759 INFO L284 TraceCheckUtils]: 722: Hoare quadruple {34865#true} {37269#(<= ~counter~0 29)} #63#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:03,759 INFO L290 TraceCheckUtils]: 721: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,759 INFO L290 TraceCheckUtils]: 720: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,759 INFO L290 TraceCheckUtils]: 719: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,759 INFO L272 TraceCheckUtils]: 718: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,760 INFO L284 TraceCheckUtils]: 717: Hoare quadruple {34865#true} {37269#(<= ~counter~0 29)} #61#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:03,760 INFO L290 TraceCheckUtils]: 716: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,760 INFO L290 TraceCheckUtils]: 715: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,760 INFO L290 TraceCheckUtils]: 714: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,760 INFO L272 TraceCheckUtils]: 713: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,760 INFO L284 TraceCheckUtils]: 712: Hoare quadruple {34865#true} {37269#(<= ~counter~0 29)} #59#return; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:03,760 INFO L290 TraceCheckUtils]: 711: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,760 INFO L290 TraceCheckUtils]: 710: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,760 INFO L290 TraceCheckUtils]: 709: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,760 INFO L272 TraceCheckUtils]: 708: Hoare triple {37269#(<= ~counter~0 29)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,761 INFO L290 TraceCheckUtils]: 707: Hoare triple {37269#(<= ~counter~0 29)} assume !!(#t~post5 < 50);havoc #t~post5; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:03,761 INFO L290 TraceCheckUtils]: 706: Hoare triple {37184#(<= ~counter~0 28)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37269#(<= ~counter~0 29)} is VALID [2022-04-27 12:16:03,761 INFO L290 TraceCheckUtils]: 705: Hoare triple {37184#(<= ~counter~0 28)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:03,762 INFO L284 TraceCheckUtils]: 704: Hoare quadruple {34865#true} {37184#(<= ~counter~0 28)} #67#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:03,762 INFO L290 TraceCheckUtils]: 703: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,762 INFO L290 TraceCheckUtils]: 702: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,762 INFO L290 TraceCheckUtils]: 701: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,762 INFO L272 TraceCheckUtils]: 700: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,762 INFO L284 TraceCheckUtils]: 699: Hoare quadruple {34865#true} {37184#(<= ~counter~0 28)} #65#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:03,762 INFO L290 TraceCheckUtils]: 698: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,763 INFO L290 TraceCheckUtils]: 697: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,763 INFO L290 TraceCheckUtils]: 696: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,763 INFO L272 TraceCheckUtils]: 695: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,763 INFO L284 TraceCheckUtils]: 694: Hoare quadruple {34865#true} {37184#(<= ~counter~0 28)} #63#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:03,763 INFO L290 TraceCheckUtils]: 693: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,763 INFO L290 TraceCheckUtils]: 692: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,763 INFO L290 TraceCheckUtils]: 691: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,763 INFO L272 TraceCheckUtils]: 690: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,764 INFO L284 TraceCheckUtils]: 689: Hoare quadruple {34865#true} {37184#(<= ~counter~0 28)} #61#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:03,764 INFO L290 TraceCheckUtils]: 688: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,764 INFO L290 TraceCheckUtils]: 687: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,764 INFO L290 TraceCheckUtils]: 686: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,764 INFO L272 TraceCheckUtils]: 685: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,764 INFO L284 TraceCheckUtils]: 684: Hoare quadruple {34865#true} {37184#(<= ~counter~0 28)} #59#return; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:03,764 INFO L290 TraceCheckUtils]: 683: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,764 INFO L290 TraceCheckUtils]: 682: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,764 INFO L290 TraceCheckUtils]: 681: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,764 INFO L272 TraceCheckUtils]: 680: Hoare triple {37184#(<= ~counter~0 28)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,765 INFO L290 TraceCheckUtils]: 679: Hoare triple {37184#(<= ~counter~0 28)} assume !!(#t~post5 < 50);havoc #t~post5; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:03,765 INFO L290 TraceCheckUtils]: 678: Hoare triple {37099#(<= ~counter~0 27)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37184#(<= ~counter~0 28)} is VALID [2022-04-27 12:16:03,765 INFO L290 TraceCheckUtils]: 677: Hoare triple {37099#(<= ~counter~0 27)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:03,766 INFO L284 TraceCheckUtils]: 676: Hoare quadruple {34865#true} {37099#(<= ~counter~0 27)} #67#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:03,766 INFO L290 TraceCheckUtils]: 675: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,766 INFO L290 TraceCheckUtils]: 674: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,766 INFO L290 TraceCheckUtils]: 673: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,766 INFO L272 TraceCheckUtils]: 672: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,766 INFO L284 TraceCheckUtils]: 671: Hoare quadruple {34865#true} {37099#(<= ~counter~0 27)} #65#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:03,766 INFO L290 TraceCheckUtils]: 670: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,767 INFO L290 TraceCheckUtils]: 669: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,767 INFO L290 TraceCheckUtils]: 668: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,767 INFO L272 TraceCheckUtils]: 667: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,767 INFO L284 TraceCheckUtils]: 666: Hoare quadruple {34865#true} {37099#(<= ~counter~0 27)} #63#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:03,767 INFO L290 TraceCheckUtils]: 665: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,767 INFO L290 TraceCheckUtils]: 664: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,767 INFO L290 TraceCheckUtils]: 663: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,767 INFO L272 TraceCheckUtils]: 662: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,768 INFO L284 TraceCheckUtils]: 661: Hoare quadruple {34865#true} {37099#(<= ~counter~0 27)} #61#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:03,768 INFO L290 TraceCheckUtils]: 660: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,768 INFO L290 TraceCheckUtils]: 659: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,768 INFO L290 TraceCheckUtils]: 658: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,768 INFO L272 TraceCheckUtils]: 657: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,768 INFO L284 TraceCheckUtils]: 656: Hoare quadruple {34865#true} {37099#(<= ~counter~0 27)} #59#return; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:03,768 INFO L290 TraceCheckUtils]: 655: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,768 INFO L290 TraceCheckUtils]: 654: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,768 INFO L290 TraceCheckUtils]: 653: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,768 INFO L272 TraceCheckUtils]: 652: Hoare triple {37099#(<= ~counter~0 27)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,769 INFO L290 TraceCheckUtils]: 651: Hoare triple {37099#(<= ~counter~0 27)} assume !!(#t~post5 < 50);havoc #t~post5; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:03,769 INFO L290 TraceCheckUtils]: 650: Hoare triple {37014#(<= ~counter~0 26)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37099#(<= ~counter~0 27)} is VALID [2022-04-27 12:16:03,769 INFO L290 TraceCheckUtils]: 649: Hoare triple {37014#(<= ~counter~0 26)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:03,770 INFO L284 TraceCheckUtils]: 648: Hoare quadruple {34865#true} {37014#(<= ~counter~0 26)} #67#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:03,770 INFO L290 TraceCheckUtils]: 647: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,770 INFO L290 TraceCheckUtils]: 646: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,770 INFO L290 TraceCheckUtils]: 645: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,770 INFO L272 TraceCheckUtils]: 644: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,770 INFO L284 TraceCheckUtils]: 643: Hoare quadruple {34865#true} {37014#(<= ~counter~0 26)} #65#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:03,770 INFO L290 TraceCheckUtils]: 642: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,771 INFO L290 TraceCheckUtils]: 641: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,771 INFO L290 TraceCheckUtils]: 640: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,771 INFO L272 TraceCheckUtils]: 639: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,771 INFO L284 TraceCheckUtils]: 638: Hoare quadruple {34865#true} {37014#(<= ~counter~0 26)} #63#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:03,771 INFO L290 TraceCheckUtils]: 637: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,771 INFO L290 TraceCheckUtils]: 636: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,771 INFO L290 TraceCheckUtils]: 635: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,771 INFO L272 TraceCheckUtils]: 634: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,772 INFO L284 TraceCheckUtils]: 633: Hoare quadruple {34865#true} {37014#(<= ~counter~0 26)} #61#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:03,772 INFO L290 TraceCheckUtils]: 632: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,772 INFO L290 TraceCheckUtils]: 631: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,772 INFO L290 TraceCheckUtils]: 630: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,772 INFO L272 TraceCheckUtils]: 629: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,772 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {34865#true} {37014#(<= ~counter~0 26)} #59#return; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:03,772 INFO L290 TraceCheckUtils]: 627: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,772 INFO L290 TraceCheckUtils]: 626: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,772 INFO L290 TraceCheckUtils]: 625: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,772 INFO L272 TraceCheckUtils]: 624: Hoare triple {37014#(<= ~counter~0 26)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,773 INFO L290 TraceCheckUtils]: 623: Hoare triple {37014#(<= ~counter~0 26)} assume !!(#t~post5 < 50);havoc #t~post5; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:03,773 INFO L290 TraceCheckUtils]: 622: Hoare triple {36929#(<= ~counter~0 25)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37014#(<= ~counter~0 26)} is VALID [2022-04-27 12:16:03,773 INFO L290 TraceCheckUtils]: 621: Hoare triple {36929#(<= ~counter~0 25)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:03,774 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {34865#true} {36929#(<= ~counter~0 25)} #67#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:03,774 INFO L290 TraceCheckUtils]: 619: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,774 INFO L290 TraceCheckUtils]: 618: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,774 INFO L290 TraceCheckUtils]: 617: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,774 INFO L272 TraceCheckUtils]: 616: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,774 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {34865#true} {36929#(<= ~counter~0 25)} #65#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:03,774 INFO L290 TraceCheckUtils]: 614: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,774 INFO L290 TraceCheckUtils]: 613: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,775 INFO L290 TraceCheckUtils]: 612: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,775 INFO L272 TraceCheckUtils]: 611: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,775 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {34865#true} {36929#(<= ~counter~0 25)} #63#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:03,775 INFO L290 TraceCheckUtils]: 609: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,775 INFO L290 TraceCheckUtils]: 608: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,775 INFO L290 TraceCheckUtils]: 607: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,775 INFO L272 TraceCheckUtils]: 606: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,776 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {34865#true} {36929#(<= ~counter~0 25)} #61#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:03,776 INFO L290 TraceCheckUtils]: 604: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,776 INFO L290 TraceCheckUtils]: 603: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,776 INFO L290 TraceCheckUtils]: 602: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,776 INFO L272 TraceCheckUtils]: 601: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,776 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {34865#true} {36929#(<= ~counter~0 25)} #59#return; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:03,776 INFO L290 TraceCheckUtils]: 599: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,776 INFO L290 TraceCheckUtils]: 598: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,776 INFO L290 TraceCheckUtils]: 597: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,776 INFO L272 TraceCheckUtils]: 596: Hoare triple {36929#(<= ~counter~0 25)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,777 INFO L290 TraceCheckUtils]: 595: Hoare triple {36929#(<= ~counter~0 25)} assume !!(#t~post5 < 50);havoc #t~post5; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:03,777 INFO L290 TraceCheckUtils]: 594: Hoare triple {36844#(<= ~counter~0 24)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36929#(<= ~counter~0 25)} is VALID [2022-04-27 12:16:03,778 INFO L290 TraceCheckUtils]: 593: Hoare triple {36844#(<= ~counter~0 24)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:03,778 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {34865#true} {36844#(<= ~counter~0 24)} #67#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:03,778 INFO L290 TraceCheckUtils]: 591: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,778 INFO L290 TraceCheckUtils]: 590: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,778 INFO L290 TraceCheckUtils]: 589: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,778 INFO L272 TraceCheckUtils]: 588: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,779 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {34865#true} {36844#(<= ~counter~0 24)} #65#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:03,779 INFO L290 TraceCheckUtils]: 586: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,779 INFO L290 TraceCheckUtils]: 585: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,779 INFO L290 TraceCheckUtils]: 584: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,779 INFO L272 TraceCheckUtils]: 583: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,779 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {34865#true} {36844#(<= ~counter~0 24)} #63#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:03,779 INFO L290 TraceCheckUtils]: 581: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,779 INFO L290 TraceCheckUtils]: 580: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,779 INFO L290 TraceCheckUtils]: 579: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,779 INFO L272 TraceCheckUtils]: 578: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,780 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {34865#true} {36844#(<= ~counter~0 24)} #61#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:03,780 INFO L290 TraceCheckUtils]: 576: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,780 INFO L290 TraceCheckUtils]: 575: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,780 INFO L290 TraceCheckUtils]: 574: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,780 INFO L272 TraceCheckUtils]: 573: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,780 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {34865#true} {36844#(<= ~counter~0 24)} #59#return; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:03,780 INFO L290 TraceCheckUtils]: 571: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,780 INFO L290 TraceCheckUtils]: 570: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,780 INFO L290 TraceCheckUtils]: 569: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,780 INFO L272 TraceCheckUtils]: 568: Hoare triple {36844#(<= ~counter~0 24)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,781 INFO L290 TraceCheckUtils]: 567: Hoare triple {36844#(<= ~counter~0 24)} assume !!(#t~post5 < 50);havoc #t~post5; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:03,781 INFO L290 TraceCheckUtils]: 566: Hoare triple {36759#(<= ~counter~0 23)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36844#(<= ~counter~0 24)} is VALID [2022-04-27 12:16:03,781 INFO L290 TraceCheckUtils]: 565: Hoare triple {36759#(<= ~counter~0 23)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:03,782 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {34865#true} {36759#(<= ~counter~0 23)} #67#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:03,782 INFO L290 TraceCheckUtils]: 563: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,782 INFO L290 TraceCheckUtils]: 562: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,782 INFO L290 TraceCheckUtils]: 561: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,782 INFO L272 TraceCheckUtils]: 560: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,782 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {34865#true} {36759#(<= ~counter~0 23)} #65#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:03,782 INFO L290 TraceCheckUtils]: 558: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,783 INFO L290 TraceCheckUtils]: 557: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,783 INFO L290 TraceCheckUtils]: 556: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,783 INFO L272 TraceCheckUtils]: 555: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,783 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {34865#true} {36759#(<= ~counter~0 23)} #63#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:03,783 INFO L290 TraceCheckUtils]: 553: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,783 INFO L290 TraceCheckUtils]: 552: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,783 INFO L290 TraceCheckUtils]: 551: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,783 INFO L272 TraceCheckUtils]: 550: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,784 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {34865#true} {36759#(<= ~counter~0 23)} #61#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:03,784 INFO L290 TraceCheckUtils]: 548: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,784 INFO L290 TraceCheckUtils]: 547: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,784 INFO L290 TraceCheckUtils]: 546: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,784 INFO L272 TraceCheckUtils]: 545: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,784 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {34865#true} {36759#(<= ~counter~0 23)} #59#return; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:03,784 INFO L290 TraceCheckUtils]: 543: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,784 INFO L290 TraceCheckUtils]: 542: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,784 INFO L290 TraceCheckUtils]: 541: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,784 INFO L272 TraceCheckUtils]: 540: Hoare triple {36759#(<= ~counter~0 23)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,785 INFO L290 TraceCheckUtils]: 539: Hoare triple {36759#(<= ~counter~0 23)} assume !!(#t~post5 < 50);havoc #t~post5; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:03,785 INFO L290 TraceCheckUtils]: 538: Hoare triple {36674#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36759#(<= ~counter~0 23)} is VALID [2022-04-27 12:16:03,785 INFO L290 TraceCheckUtils]: 537: Hoare triple {36674#(<= ~counter~0 22)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:03,786 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {34865#true} {36674#(<= ~counter~0 22)} #67#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:03,786 INFO L290 TraceCheckUtils]: 535: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,786 INFO L290 TraceCheckUtils]: 534: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,786 INFO L290 TraceCheckUtils]: 533: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,786 INFO L272 TraceCheckUtils]: 532: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,786 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {34865#true} {36674#(<= ~counter~0 22)} #65#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:03,786 INFO L290 TraceCheckUtils]: 530: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,786 INFO L290 TraceCheckUtils]: 529: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,786 INFO L290 TraceCheckUtils]: 528: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,786 INFO L272 TraceCheckUtils]: 527: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,787 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {34865#true} {36674#(<= ~counter~0 22)} #63#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:03,787 INFO L290 TraceCheckUtils]: 525: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,787 INFO L290 TraceCheckUtils]: 524: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,787 INFO L290 TraceCheckUtils]: 523: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,787 INFO L272 TraceCheckUtils]: 522: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,787 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {34865#true} {36674#(<= ~counter~0 22)} #61#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:03,788 INFO L290 TraceCheckUtils]: 520: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,788 INFO L290 TraceCheckUtils]: 519: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,788 INFO L290 TraceCheckUtils]: 518: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,788 INFO L272 TraceCheckUtils]: 517: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,788 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {34865#true} {36674#(<= ~counter~0 22)} #59#return; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:03,788 INFO L290 TraceCheckUtils]: 515: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,788 INFO L290 TraceCheckUtils]: 514: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,788 INFO L290 TraceCheckUtils]: 513: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,788 INFO L272 TraceCheckUtils]: 512: Hoare triple {36674#(<= ~counter~0 22)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,788 INFO L290 TraceCheckUtils]: 511: Hoare triple {36674#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:03,789 INFO L290 TraceCheckUtils]: 510: Hoare triple {36589#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36674#(<= ~counter~0 22)} is VALID [2022-04-27 12:16:03,789 INFO L290 TraceCheckUtils]: 509: Hoare triple {36589#(<= ~counter~0 21)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:03,790 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {34865#true} {36589#(<= ~counter~0 21)} #67#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:03,790 INFO L290 TraceCheckUtils]: 507: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,790 INFO L290 TraceCheckUtils]: 506: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,790 INFO L290 TraceCheckUtils]: 505: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,790 INFO L272 TraceCheckUtils]: 504: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,790 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {34865#true} {36589#(<= ~counter~0 21)} #65#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:03,790 INFO L290 TraceCheckUtils]: 502: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,790 INFO L290 TraceCheckUtils]: 501: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,790 INFO L290 TraceCheckUtils]: 500: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,790 INFO L272 TraceCheckUtils]: 499: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,791 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {34865#true} {36589#(<= ~counter~0 21)} #63#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:03,791 INFO L290 TraceCheckUtils]: 497: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,791 INFO L290 TraceCheckUtils]: 496: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,791 INFO L290 TraceCheckUtils]: 495: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,791 INFO L272 TraceCheckUtils]: 494: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,791 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {34865#true} {36589#(<= ~counter~0 21)} #61#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:03,791 INFO L290 TraceCheckUtils]: 492: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,792 INFO L290 TraceCheckUtils]: 491: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,792 INFO L290 TraceCheckUtils]: 490: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,792 INFO L272 TraceCheckUtils]: 489: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,792 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {34865#true} {36589#(<= ~counter~0 21)} #59#return; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:03,792 INFO L290 TraceCheckUtils]: 487: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,792 INFO L290 TraceCheckUtils]: 486: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,792 INFO L290 TraceCheckUtils]: 485: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,792 INFO L272 TraceCheckUtils]: 484: Hoare triple {36589#(<= ~counter~0 21)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,792 INFO L290 TraceCheckUtils]: 483: Hoare triple {36589#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:03,793 INFO L290 TraceCheckUtils]: 482: Hoare triple {36504#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36589#(<= ~counter~0 21)} is VALID [2022-04-27 12:16:03,793 INFO L290 TraceCheckUtils]: 481: Hoare triple {36504#(<= ~counter~0 20)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:03,794 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {34865#true} {36504#(<= ~counter~0 20)} #67#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:03,794 INFO L290 TraceCheckUtils]: 479: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,794 INFO L290 TraceCheckUtils]: 478: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,794 INFO L290 TraceCheckUtils]: 477: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,794 INFO L272 TraceCheckUtils]: 476: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,794 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {34865#true} {36504#(<= ~counter~0 20)} #65#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:03,794 INFO L290 TraceCheckUtils]: 474: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,794 INFO L290 TraceCheckUtils]: 473: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,794 INFO L290 TraceCheckUtils]: 472: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,794 INFO L272 TraceCheckUtils]: 471: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,795 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {34865#true} {36504#(<= ~counter~0 20)} #63#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:03,795 INFO L290 TraceCheckUtils]: 469: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,795 INFO L290 TraceCheckUtils]: 468: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,795 INFO L290 TraceCheckUtils]: 467: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,795 INFO L272 TraceCheckUtils]: 466: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,795 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {34865#true} {36504#(<= ~counter~0 20)} #61#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:03,795 INFO L290 TraceCheckUtils]: 464: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,795 INFO L290 TraceCheckUtils]: 463: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,795 INFO L290 TraceCheckUtils]: 462: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,796 INFO L272 TraceCheckUtils]: 461: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,796 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {34865#true} {36504#(<= ~counter~0 20)} #59#return; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:03,796 INFO L290 TraceCheckUtils]: 459: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,796 INFO L290 TraceCheckUtils]: 458: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,796 INFO L290 TraceCheckUtils]: 457: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,796 INFO L272 TraceCheckUtils]: 456: Hoare triple {36504#(<= ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,796 INFO L290 TraceCheckUtils]: 455: Hoare triple {36504#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:03,797 INFO L290 TraceCheckUtils]: 454: Hoare triple {36419#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36504#(<= ~counter~0 20)} is VALID [2022-04-27 12:16:03,797 INFO L290 TraceCheckUtils]: 453: Hoare triple {36419#(<= ~counter~0 19)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:03,797 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {34865#true} {36419#(<= ~counter~0 19)} #67#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:03,797 INFO L290 TraceCheckUtils]: 451: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,798 INFO L290 TraceCheckUtils]: 450: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,798 INFO L290 TraceCheckUtils]: 449: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,798 INFO L272 TraceCheckUtils]: 448: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,798 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {34865#true} {36419#(<= ~counter~0 19)} #65#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:03,798 INFO L290 TraceCheckUtils]: 446: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,798 INFO L290 TraceCheckUtils]: 445: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,798 INFO L290 TraceCheckUtils]: 444: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,798 INFO L272 TraceCheckUtils]: 443: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,799 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {34865#true} {36419#(<= ~counter~0 19)} #63#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:03,799 INFO L290 TraceCheckUtils]: 441: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,799 INFO L290 TraceCheckUtils]: 440: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,799 INFO L290 TraceCheckUtils]: 439: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,799 INFO L272 TraceCheckUtils]: 438: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,799 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {34865#true} {36419#(<= ~counter~0 19)} #61#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:03,799 INFO L290 TraceCheckUtils]: 436: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,799 INFO L290 TraceCheckUtils]: 435: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,799 INFO L290 TraceCheckUtils]: 434: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,799 INFO L272 TraceCheckUtils]: 433: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,800 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {34865#true} {36419#(<= ~counter~0 19)} #59#return; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:03,800 INFO L290 TraceCheckUtils]: 431: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,800 INFO L290 TraceCheckUtils]: 430: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,800 INFO L290 TraceCheckUtils]: 429: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,800 INFO L272 TraceCheckUtils]: 428: Hoare triple {36419#(<= ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,800 INFO L290 TraceCheckUtils]: 427: Hoare triple {36419#(<= ~counter~0 19)} assume !!(#t~post5 < 50);havoc #t~post5; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:03,801 INFO L290 TraceCheckUtils]: 426: Hoare triple {36334#(<= ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36419#(<= ~counter~0 19)} is VALID [2022-04-27 12:16:03,801 INFO L290 TraceCheckUtils]: 425: Hoare triple {36334#(<= ~counter~0 18)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:03,801 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {34865#true} {36334#(<= ~counter~0 18)} #67#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:03,801 INFO L290 TraceCheckUtils]: 423: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,801 INFO L290 TraceCheckUtils]: 422: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,801 INFO L290 TraceCheckUtils]: 421: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,801 INFO L272 TraceCheckUtils]: 420: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,802 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {34865#true} {36334#(<= ~counter~0 18)} #65#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:03,802 INFO L290 TraceCheckUtils]: 418: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,802 INFO L290 TraceCheckUtils]: 417: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,802 INFO L290 TraceCheckUtils]: 416: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,802 INFO L272 TraceCheckUtils]: 415: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,802 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {34865#true} {36334#(<= ~counter~0 18)} #63#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:03,802 INFO L290 TraceCheckUtils]: 413: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,803 INFO L290 TraceCheckUtils]: 412: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,803 INFO L290 TraceCheckUtils]: 411: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,803 INFO L272 TraceCheckUtils]: 410: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,803 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {34865#true} {36334#(<= ~counter~0 18)} #61#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:03,803 INFO L290 TraceCheckUtils]: 408: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,803 INFO L290 TraceCheckUtils]: 407: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,803 INFO L290 TraceCheckUtils]: 406: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,803 INFO L272 TraceCheckUtils]: 405: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,804 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {34865#true} {36334#(<= ~counter~0 18)} #59#return; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:03,804 INFO L290 TraceCheckUtils]: 403: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,804 INFO L290 TraceCheckUtils]: 402: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,804 INFO L290 TraceCheckUtils]: 401: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,804 INFO L272 TraceCheckUtils]: 400: Hoare triple {36334#(<= ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,804 INFO L290 TraceCheckUtils]: 399: Hoare triple {36334#(<= ~counter~0 18)} assume !!(#t~post5 < 50);havoc #t~post5; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:03,804 INFO L290 TraceCheckUtils]: 398: Hoare triple {36249#(<= ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36334#(<= ~counter~0 18)} is VALID [2022-04-27 12:16:03,805 INFO L290 TraceCheckUtils]: 397: Hoare triple {36249#(<= ~counter~0 17)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:03,805 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {34865#true} {36249#(<= ~counter~0 17)} #67#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:03,805 INFO L290 TraceCheckUtils]: 395: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,805 INFO L290 TraceCheckUtils]: 394: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,805 INFO L290 TraceCheckUtils]: 393: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,805 INFO L272 TraceCheckUtils]: 392: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,806 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {34865#true} {36249#(<= ~counter~0 17)} #65#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:03,806 INFO L290 TraceCheckUtils]: 390: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,806 INFO L290 TraceCheckUtils]: 389: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,806 INFO L290 TraceCheckUtils]: 388: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,806 INFO L272 TraceCheckUtils]: 387: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,806 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {34865#true} {36249#(<= ~counter~0 17)} #63#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:03,806 INFO L290 TraceCheckUtils]: 385: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,806 INFO L290 TraceCheckUtils]: 384: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,806 INFO L290 TraceCheckUtils]: 383: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,806 INFO L272 TraceCheckUtils]: 382: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,807 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {34865#true} {36249#(<= ~counter~0 17)} #61#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:03,807 INFO L290 TraceCheckUtils]: 380: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,807 INFO L290 TraceCheckUtils]: 379: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,807 INFO L290 TraceCheckUtils]: 378: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,807 INFO L272 TraceCheckUtils]: 377: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,807 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {34865#true} {36249#(<= ~counter~0 17)} #59#return; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:03,807 INFO L290 TraceCheckUtils]: 375: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,808 INFO L290 TraceCheckUtils]: 374: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,808 INFO L290 TraceCheckUtils]: 373: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,808 INFO L272 TraceCheckUtils]: 372: Hoare triple {36249#(<= ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,808 INFO L290 TraceCheckUtils]: 371: Hoare triple {36249#(<= ~counter~0 17)} assume !!(#t~post5 < 50);havoc #t~post5; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:03,808 INFO L290 TraceCheckUtils]: 370: Hoare triple {36164#(<= ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36249#(<= ~counter~0 17)} is VALID [2022-04-27 12:16:03,809 INFO L290 TraceCheckUtils]: 369: Hoare triple {36164#(<= ~counter~0 16)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:03,809 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {34865#true} {36164#(<= ~counter~0 16)} #67#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:03,809 INFO L290 TraceCheckUtils]: 367: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,809 INFO L290 TraceCheckUtils]: 366: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,809 INFO L290 TraceCheckUtils]: 365: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,809 INFO L272 TraceCheckUtils]: 364: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,810 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {34865#true} {36164#(<= ~counter~0 16)} #65#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:03,810 INFO L290 TraceCheckUtils]: 362: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,810 INFO L290 TraceCheckUtils]: 361: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,810 INFO L290 TraceCheckUtils]: 360: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,810 INFO L272 TraceCheckUtils]: 359: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,810 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {34865#true} {36164#(<= ~counter~0 16)} #63#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:03,810 INFO L290 TraceCheckUtils]: 357: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,810 INFO L290 TraceCheckUtils]: 356: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,810 INFO L290 TraceCheckUtils]: 355: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,810 INFO L272 TraceCheckUtils]: 354: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,811 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {34865#true} {36164#(<= ~counter~0 16)} #61#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:03,811 INFO L290 TraceCheckUtils]: 352: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,811 INFO L290 TraceCheckUtils]: 351: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,811 INFO L290 TraceCheckUtils]: 350: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,811 INFO L272 TraceCheckUtils]: 349: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,811 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {34865#true} {36164#(<= ~counter~0 16)} #59#return; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:03,811 INFO L290 TraceCheckUtils]: 347: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,811 INFO L290 TraceCheckUtils]: 346: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,811 INFO L290 TraceCheckUtils]: 345: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,811 INFO L272 TraceCheckUtils]: 344: Hoare triple {36164#(<= ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,812 INFO L290 TraceCheckUtils]: 343: Hoare triple {36164#(<= ~counter~0 16)} assume !!(#t~post5 < 50);havoc #t~post5; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:03,812 INFO L290 TraceCheckUtils]: 342: Hoare triple {36079#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36164#(<= ~counter~0 16)} is VALID [2022-04-27 12:16:03,812 INFO L290 TraceCheckUtils]: 341: Hoare triple {36079#(<= ~counter~0 15)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:03,813 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {34865#true} {36079#(<= ~counter~0 15)} #67#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:03,813 INFO L290 TraceCheckUtils]: 339: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,813 INFO L290 TraceCheckUtils]: 338: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,813 INFO L290 TraceCheckUtils]: 337: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,813 INFO L272 TraceCheckUtils]: 336: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,813 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {34865#true} {36079#(<= ~counter~0 15)} #65#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:03,813 INFO L290 TraceCheckUtils]: 334: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,813 INFO L290 TraceCheckUtils]: 333: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,814 INFO L290 TraceCheckUtils]: 332: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,814 INFO L272 TraceCheckUtils]: 331: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,814 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {34865#true} {36079#(<= ~counter~0 15)} #63#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:03,814 INFO L290 TraceCheckUtils]: 329: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,814 INFO L290 TraceCheckUtils]: 328: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,814 INFO L290 TraceCheckUtils]: 327: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,814 INFO L272 TraceCheckUtils]: 326: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,814 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {34865#true} {36079#(<= ~counter~0 15)} #61#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:03,815 INFO L290 TraceCheckUtils]: 324: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,815 INFO L290 TraceCheckUtils]: 323: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,815 INFO L290 TraceCheckUtils]: 322: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,815 INFO L272 TraceCheckUtils]: 321: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,815 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {34865#true} {36079#(<= ~counter~0 15)} #59#return; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:03,815 INFO L290 TraceCheckUtils]: 319: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,815 INFO L290 TraceCheckUtils]: 318: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,815 INFO L290 TraceCheckUtils]: 317: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,815 INFO L272 TraceCheckUtils]: 316: Hoare triple {36079#(<= ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,815 INFO L290 TraceCheckUtils]: 315: Hoare triple {36079#(<= ~counter~0 15)} assume !!(#t~post5 < 50);havoc #t~post5; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:03,816 INFO L290 TraceCheckUtils]: 314: Hoare triple {35994#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36079#(<= ~counter~0 15)} is VALID [2022-04-27 12:16:03,816 INFO L290 TraceCheckUtils]: 313: Hoare triple {35994#(<= ~counter~0 14)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:03,817 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {34865#true} {35994#(<= ~counter~0 14)} #67#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:03,817 INFO L290 TraceCheckUtils]: 311: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,817 INFO L290 TraceCheckUtils]: 310: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,817 INFO L290 TraceCheckUtils]: 309: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,817 INFO L272 TraceCheckUtils]: 308: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,817 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {34865#true} {35994#(<= ~counter~0 14)} #65#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:03,817 INFO L290 TraceCheckUtils]: 306: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,817 INFO L290 TraceCheckUtils]: 305: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,817 INFO L290 TraceCheckUtils]: 304: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,817 INFO L272 TraceCheckUtils]: 303: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,818 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {34865#true} {35994#(<= ~counter~0 14)} #63#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:03,818 INFO L290 TraceCheckUtils]: 301: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,818 INFO L290 TraceCheckUtils]: 300: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,818 INFO L290 TraceCheckUtils]: 299: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,818 INFO L272 TraceCheckUtils]: 298: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,818 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {34865#true} {35994#(<= ~counter~0 14)} #61#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:03,818 INFO L290 TraceCheckUtils]: 296: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,818 INFO L290 TraceCheckUtils]: 295: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,818 INFO L290 TraceCheckUtils]: 294: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,819 INFO L272 TraceCheckUtils]: 293: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,819 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {34865#true} {35994#(<= ~counter~0 14)} #59#return; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:03,819 INFO L290 TraceCheckUtils]: 291: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,819 INFO L290 TraceCheckUtils]: 290: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,819 INFO L290 TraceCheckUtils]: 289: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,819 INFO L272 TraceCheckUtils]: 288: Hoare triple {35994#(<= ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,819 INFO L290 TraceCheckUtils]: 287: Hoare triple {35994#(<= ~counter~0 14)} assume !!(#t~post5 < 50);havoc #t~post5; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:03,820 INFO L290 TraceCheckUtils]: 286: Hoare triple {35909#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35994#(<= ~counter~0 14)} is VALID [2022-04-27 12:16:03,820 INFO L290 TraceCheckUtils]: 285: Hoare triple {35909#(<= ~counter~0 13)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:03,820 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {34865#true} {35909#(<= ~counter~0 13)} #67#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:03,820 INFO L290 TraceCheckUtils]: 283: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,821 INFO L290 TraceCheckUtils]: 282: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,821 INFO L290 TraceCheckUtils]: 281: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,821 INFO L272 TraceCheckUtils]: 280: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,821 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {34865#true} {35909#(<= ~counter~0 13)} #65#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:03,821 INFO L290 TraceCheckUtils]: 278: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,821 INFO L290 TraceCheckUtils]: 277: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,821 INFO L290 TraceCheckUtils]: 276: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,821 INFO L272 TraceCheckUtils]: 275: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,822 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {34865#true} {35909#(<= ~counter~0 13)} #63#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:03,822 INFO L290 TraceCheckUtils]: 273: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,822 INFO L290 TraceCheckUtils]: 272: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,822 INFO L290 TraceCheckUtils]: 271: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,822 INFO L272 TraceCheckUtils]: 270: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,822 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {34865#true} {35909#(<= ~counter~0 13)} #61#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:03,822 INFO L290 TraceCheckUtils]: 268: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,822 INFO L290 TraceCheckUtils]: 267: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,822 INFO L290 TraceCheckUtils]: 266: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,822 INFO L272 TraceCheckUtils]: 265: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,823 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {34865#true} {35909#(<= ~counter~0 13)} #59#return; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:03,823 INFO L290 TraceCheckUtils]: 263: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,823 INFO L290 TraceCheckUtils]: 262: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,823 INFO L290 TraceCheckUtils]: 261: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,823 INFO L272 TraceCheckUtils]: 260: Hoare triple {35909#(<= ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,823 INFO L290 TraceCheckUtils]: 259: Hoare triple {35909#(<= ~counter~0 13)} assume !!(#t~post5 < 50);havoc #t~post5; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:03,824 INFO L290 TraceCheckUtils]: 258: Hoare triple {35824#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35909#(<= ~counter~0 13)} is VALID [2022-04-27 12:16:03,824 INFO L290 TraceCheckUtils]: 257: Hoare triple {35824#(<= ~counter~0 12)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:03,824 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {34865#true} {35824#(<= ~counter~0 12)} #67#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:03,824 INFO L290 TraceCheckUtils]: 255: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,824 INFO L290 TraceCheckUtils]: 254: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,824 INFO L290 TraceCheckUtils]: 253: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,824 INFO L272 TraceCheckUtils]: 252: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,825 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {34865#true} {35824#(<= ~counter~0 12)} #65#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:03,825 INFO L290 TraceCheckUtils]: 250: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,825 INFO L290 TraceCheckUtils]: 249: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,825 INFO L290 TraceCheckUtils]: 248: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,825 INFO L272 TraceCheckUtils]: 247: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,825 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {34865#true} {35824#(<= ~counter~0 12)} #63#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:03,825 INFO L290 TraceCheckUtils]: 245: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,826 INFO L290 TraceCheckUtils]: 244: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,826 INFO L290 TraceCheckUtils]: 243: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,826 INFO L272 TraceCheckUtils]: 242: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,826 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {34865#true} {35824#(<= ~counter~0 12)} #61#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:03,826 INFO L290 TraceCheckUtils]: 240: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,826 INFO L290 TraceCheckUtils]: 239: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,826 INFO L290 TraceCheckUtils]: 238: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,826 INFO L272 TraceCheckUtils]: 237: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,827 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {34865#true} {35824#(<= ~counter~0 12)} #59#return; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:03,827 INFO L290 TraceCheckUtils]: 235: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,827 INFO L290 TraceCheckUtils]: 234: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,827 INFO L290 TraceCheckUtils]: 233: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,827 INFO L272 TraceCheckUtils]: 232: Hoare triple {35824#(<= ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,827 INFO L290 TraceCheckUtils]: 231: Hoare triple {35824#(<= ~counter~0 12)} assume !!(#t~post5 < 50);havoc #t~post5; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:03,827 INFO L290 TraceCheckUtils]: 230: Hoare triple {35739#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35824#(<= ~counter~0 12)} is VALID [2022-04-27 12:16:03,828 INFO L290 TraceCheckUtils]: 229: Hoare triple {35739#(<= ~counter~0 11)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:03,828 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {34865#true} {35739#(<= ~counter~0 11)} #67#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:03,828 INFO L290 TraceCheckUtils]: 227: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,828 INFO L290 TraceCheckUtils]: 226: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,828 INFO L290 TraceCheckUtils]: 225: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,828 INFO L272 TraceCheckUtils]: 224: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,829 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {34865#true} {35739#(<= ~counter~0 11)} #65#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:03,829 INFO L290 TraceCheckUtils]: 222: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,829 INFO L290 TraceCheckUtils]: 221: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,829 INFO L290 TraceCheckUtils]: 220: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,829 INFO L272 TraceCheckUtils]: 219: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,829 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {34865#true} {35739#(<= ~counter~0 11)} #63#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:03,829 INFO L290 TraceCheckUtils]: 217: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,829 INFO L290 TraceCheckUtils]: 216: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,829 INFO L290 TraceCheckUtils]: 215: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,829 INFO L272 TraceCheckUtils]: 214: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,830 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {34865#true} {35739#(<= ~counter~0 11)} #61#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:03,830 INFO L290 TraceCheckUtils]: 212: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,830 INFO L290 TraceCheckUtils]: 211: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,830 INFO L290 TraceCheckUtils]: 210: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,830 INFO L272 TraceCheckUtils]: 209: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,830 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {34865#true} {35739#(<= ~counter~0 11)} #59#return; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:03,830 INFO L290 TraceCheckUtils]: 207: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,831 INFO L290 TraceCheckUtils]: 206: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,831 INFO L290 TraceCheckUtils]: 205: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,831 INFO L272 TraceCheckUtils]: 204: Hoare triple {35739#(<= ~counter~0 11)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,831 INFO L290 TraceCheckUtils]: 203: Hoare triple {35739#(<= ~counter~0 11)} assume !!(#t~post5 < 50);havoc #t~post5; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:03,831 INFO L290 TraceCheckUtils]: 202: Hoare triple {35654#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35739#(<= ~counter~0 11)} is VALID [2022-04-27 12:16:03,832 INFO L290 TraceCheckUtils]: 201: Hoare triple {35654#(<= ~counter~0 10)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:03,832 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {34865#true} {35654#(<= ~counter~0 10)} #67#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:03,832 INFO L290 TraceCheckUtils]: 199: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,832 INFO L290 TraceCheckUtils]: 198: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,832 INFO L290 TraceCheckUtils]: 197: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,832 INFO L272 TraceCheckUtils]: 196: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,833 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {34865#true} {35654#(<= ~counter~0 10)} #65#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:03,833 INFO L290 TraceCheckUtils]: 194: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,833 INFO L290 TraceCheckUtils]: 193: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,833 INFO L290 TraceCheckUtils]: 192: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,833 INFO L272 TraceCheckUtils]: 191: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,833 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {34865#true} {35654#(<= ~counter~0 10)} #63#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:03,833 INFO L290 TraceCheckUtils]: 189: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,833 INFO L290 TraceCheckUtils]: 188: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,833 INFO L290 TraceCheckUtils]: 187: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,833 INFO L272 TraceCheckUtils]: 186: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,834 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {34865#true} {35654#(<= ~counter~0 10)} #61#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:03,834 INFO L290 TraceCheckUtils]: 184: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,834 INFO L290 TraceCheckUtils]: 183: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,834 INFO L290 TraceCheckUtils]: 182: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,834 INFO L272 TraceCheckUtils]: 181: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,834 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {34865#true} {35654#(<= ~counter~0 10)} #59#return; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:03,834 INFO L290 TraceCheckUtils]: 179: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,834 INFO L290 TraceCheckUtils]: 178: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,834 INFO L290 TraceCheckUtils]: 177: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,835 INFO L272 TraceCheckUtils]: 176: Hoare triple {35654#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,835 INFO L290 TraceCheckUtils]: 175: Hoare triple {35654#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:03,835 INFO L290 TraceCheckUtils]: 174: Hoare triple {35569#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35654#(<= ~counter~0 10)} is VALID [2022-04-27 12:16:03,836 INFO L290 TraceCheckUtils]: 173: Hoare triple {35569#(<= ~counter~0 9)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:03,836 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {34865#true} {35569#(<= ~counter~0 9)} #67#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:03,836 INFO L290 TraceCheckUtils]: 171: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,836 INFO L290 TraceCheckUtils]: 170: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,836 INFO L290 TraceCheckUtils]: 169: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,836 INFO L272 TraceCheckUtils]: 168: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,837 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {34865#true} {35569#(<= ~counter~0 9)} #65#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:03,837 INFO L290 TraceCheckUtils]: 166: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,837 INFO L290 TraceCheckUtils]: 165: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,837 INFO L290 TraceCheckUtils]: 164: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,837 INFO L272 TraceCheckUtils]: 163: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,837 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {34865#true} {35569#(<= ~counter~0 9)} #63#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:03,837 INFO L290 TraceCheckUtils]: 161: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,837 INFO L290 TraceCheckUtils]: 160: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,837 INFO L290 TraceCheckUtils]: 159: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,837 INFO L272 TraceCheckUtils]: 158: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,838 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {34865#true} {35569#(<= ~counter~0 9)} #61#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:03,838 INFO L290 TraceCheckUtils]: 156: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,838 INFO L290 TraceCheckUtils]: 155: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,838 INFO L290 TraceCheckUtils]: 154: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,838 INFO L272 TraceCheckUtils]: 153: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,838 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {34865#true} {35569#(<= ~counter~0 9)} #59#return; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:03,838 INFO L290 TraceCheckUtils]: 151: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,838 INFO L290 TraceCheckUtils]: 150: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,838 INFO L290 TraceCheckUtils]: 149: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,838 INFO L272 TraceCheckUtils]: 148: Hoare triple {35569#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,839 INFO L290 TraceCheckUtils]: 147: Hoare triple {35569#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:03,839 INFO L290 TraceCheckUtils]: 146: Hoare triple {35484#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35569#(<= ~counter~0 9)} is VALID [2022-04-27 12:16:03,839 INFO L290 TraceCheckUtils]: 145: Hoare triple {35484#(<= ~counter~0 8)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:03,840 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {34865#true} {35484#(<= ~counter~0 8)} #67#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:03,840 INFO L290 TraceCheckUtils]: 143: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,840 INFO L290 TraceCheckUtils]: 142: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,840 INFO L290 TraceCheckUtils]: 141: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,840 INFO L272 TraceCheckUtils]: 140: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,840 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {34865#true} {35484#(<= ~counter~0 8)} #65#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:03,840 INFO L290 TraceCheckUtils]: 138: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,841 INFO L290 TraceCheckUtils]: 137: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,841 INFO L290 TraceCheckUtils]: 136: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,841 INFO L272 TraceCheckUtils]: 135: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,841 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {34865#true} {35484#(<= ~counter~0 8)} #63#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:03,841 INFO L290 TraceCheckUtils]: 133: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,841 INFO L290 TraceCheckUtils]: 132: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,841 INFO L290 TraceCheckUtils]: 131: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,841 INFO L272 TraceCheckUtils]: 130: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,842 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {34865#true} {35484#(<= ~counter~0 8)} #61#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:03,842 INFO L290 TraceCheckUtils]: 128: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,842 INFO L290 TraceCheckUtils]: 127: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,842 INFO L290 TraceCheckUtils]: 126: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,842 INFO L272 TraceCheckUtils]: 125: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,842 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {34865#true} {35484#(<= ~counter~0 8)} #59#return; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:03,842 INFO L290 TraceCheckUtils]: 123: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,842 INFO L290 TraceCheckUtils]: 122: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,842 INFO L290 TraceCheckUtils]: 121: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,842 INFO L272 TraceCheckUtils]: 120: Hoare triple {35484#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,843 INFO L290 TraceCheckUtils]: 119: Hoare triple {35484#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:03,843 INFO L290 TraceCheckUtils]: 118: Hoare triple {35399#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35484#(<= ~counter~0 8)} is VALID [2022-04-27 12:16:03,843 INFO L290 TraceCheckUtils]: 117: Hoare triple {35399#(<= ~counter~0 7)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:03,844 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {34865#true} {35399#(<= ~counter~0 7)} #67#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:03,844 INFO L290 TraceCheckUtils]: 115: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,844 INFO L290 TraceCheckUtils]: 114: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,844 INFO L290 TraceCheckUtils]: 113: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,844 INFO L272 TraceCheckUtils]: 112: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,844 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {34865#true} {35399#(<= ~counter~0 7)} #65#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:03,844 INFO L290 TraceCheckUtils]: 110: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,844 INFO L290 TraceCheckUtils]: 109: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,844 INFO L290 TraceCheckUtils]: 108: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,844 INFO L272 TraceCheckUtils]: 107: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,845 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {34865#true} {35399#(<= ~counter~0 7)} #63#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:03,845 INFO L290 TraceCheckUtils]: 105: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,845 INFO L290 TraceCheckUtils]: 104: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,845 INFO L290 TraceCheckUtils]: 103: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,845 INFO L272 TraceCheckUtils]: 102: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,845 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {34865#true} {35399#(<= ~counter~0 7)} #61#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:03,845 INFO L290 TraceCheckUtils]: 100: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,845 INFO L290 TraceCheckUtils]: 99: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,846 INFO L290 TraceCheckUtils]: 98: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,846 INFO L272 TraceCheckUtils]: 97: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,846 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {34865#true} {35399#(<= ~counter~0 7)} #59#return; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:03,846 INFO L290 TraceCheckUtils]: 95: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,846 INFO L290 TraceCheckUtils]: 94: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,846 INFO L290 TraceCheckUtils]: 93: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,846 INFO L272 TraceCheckUtils]: 92: Hoare triple {35399#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,846 INFO L290 TraceCheckUtils]: 91: Hoare triple {35399#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:03,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {35314#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35399#(<= ~counter~0 7)} is VALID [2022-04-27 12:16:03,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {35314#(<= ~counter~0 6)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:03,848 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {34865#true} {35314#(<= ~counter~0 6)} #67#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:03,848 INFO L290 TraceCheckUtils]: 87: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,848 INFO L290 TraceCheckUtils]: 86: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,848 INFO L290 TraceCheckUtils]: 85: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,848 INFO L272 TraceCheckUtils]: 84: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,848 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {34865#true} {35314#(<= ~counter~0 6)} #65#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:03,848 INFO L290 TraceCheckUtils]: 82: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,848 INFO L290 TraceCheckUtils]: 81: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,848 INFO L290 TraceCheckUtils]: 80: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,848 INFO L272 TraceCheckUtils]: 79: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,849 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {34865#true} {35314#(<= ~counter~0 6)} #63#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:03,849 INFO L290 TraceCheckUtils]: 77: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,849 INFO L290 TraceCheckUtils]: 76: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,849 INFO L290 TraceCheckUtils]: 75: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,849 INFO L272 TraceCheckUtils]: 74: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,849 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {34865#true} {35314#(<= ~counter~0 6)} #61#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:03,849 INFO L290 TraceCheckUtils]: 72: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,849 INFO L290 TraceCheckUtils]: 71: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,849 INFO L290 TraceCheckUtils]: 70: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,850 INFO L272 TraceCheckUtils]: 69: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,850 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {34865#true} {35314#(<= ~counter~0 6)} #59#return; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:03,850 INFO L290 TraceCheckUtils]: 67: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,850 INFO L290 TraceCheckUtils]: 66: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,850 INFO L290 TraceCheckUtils]: 65: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,850 INFO L272 TraceCheckUtils]: 64: Hoare triple {35314#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {35314#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:03,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {35229#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35314#(<= ~counter~0 6)} is VALID [2022-04-27 12:16:03,851 INFO L290 TraceCheckUtils]: 61: Hoare triple {35229#(<= ~counter~0 5)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:03,851 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {34865#true} {35229#(<= ~counter~0 5)} #67#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:03,851 INFO L290 TraceCheckUtils]: 59: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,852 INFO L290 TraceCheckUtils]: 58: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,852 INFO L290 TraceCheckUtils]: 57: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,852 INFO L272 TraceCheckUtils]: 56: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,852 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {34865#true} {35229#(<= ~counter~0 5)} #65#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:03,852 INFO L290 TraceCheckUtils]: 54: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,852 INFO L272 TraceCheckUtils]: 51: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,853 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {34865#true} {35229#(<= ~counter~0 5)} #63#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:03,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,853 INFO L272 TraceCheckUtils]: 46: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,853 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34865#true} {35229#(<= ~counter~0 5)} #61#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:03,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,853 INFO L272 TraceCheckUtils]: 41: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,854 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {34865#true} {35229#(<= ~counter~0 5)} #59#return; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:03,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,854 INFO L272 TraceCheckUtils]: 36: Hoare triple {35229#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {35229#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:03,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {35144#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35229#(<= ~counter~0 5)} is VALID [2022-04-27 12:16:03,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {35144#(<= ~counter~0 4)} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:03,855 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {34865#true} {35144#(<= ~counter~0 4)} #67#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:03,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,856 INFO L272 TraceCheckUtils]: 28: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,856 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {34865#true} {35144#(<= ~counter~0 4)} #65#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:03,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,856 INFO L272 TraceCheckUtils]: 23: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,856 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {34865#true} {35144#(<= ~counter~0 4)} #63#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:03,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,857 INFO L272 TraceCheckUtils]: 18: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,857 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {34865#true} {35144#(<= ~counter~0 4)} #61#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:03,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,857 INFO L272 TraceCheckUtils]: 13: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,858 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {34865#true} {35144#(<= ~counter~0 4)} #59#return; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:03,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {34865#true} assume true; {34865#true} is VALID [2022-04-27 12:16:03,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {34865#true} assume !(0 == ~cond); {34865#true} is VALID [2022-04-27 12:16:03,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {34865#true} ~cond := #in~cond; {34865#true} is VALID [2022-04-27 12:16:03,858 INFO L272 TraceCheckUtils]: 8: Hoare triple {35144#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {34865#true} is VALID [2022-04-27 12:16:03,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {35144#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:03,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {35059#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35144#(<= ~counter~0 4)} is VALID [2022-04-27 12:16:03,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {35059#(<= ~counter~0 3)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:03,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {35059#(<= ~counter~0 3)} call #t~ret6 := main(); {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:03,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35059#(<= ~counter~0 3)} {34865#true} #81#return; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:03,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {35059#(<= ~counter~0 3)} assume true; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:03,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {34865#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35059#(<= ~counter~0 3)} is VALID [2022-04-27 12:16:03,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {34865#true} call ULTIMATE.init(); {34865#true} is VALID [2022-04-27 12:16:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 115094 backedges. 462 proven. 8372 refuted. 0 times theorem prover too weak. 106260 trivial. 0 not checked. [2022-04-27 12:16:03,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:16:03,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486049501] [2022-04-27 12:16:03,892 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:16:03,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446095122] [2022-04-27 12:16:03,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446095122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:16:03,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:16:03,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-04-27 12:16:03,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799657594] [2022-04-27 12:16:03,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:16:03,895 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.611111111111111) internal successors, (303), 54 states have internal predecessors, (303), 52 states have call successors, (466), 49 states have call predecessors, (466), 49 states have return successors, (464), 51 states have call predecessors, (464), 51 states have call successors, (464) Word has length 1305