/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-34549b5 [2022-04-07 12:57:15,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:57:15,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:57:15,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:57:15,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:57:15,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:57:15,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:57:15,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:57:15,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:57:15,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:57:15,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:57:15,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:57:15,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:57:15,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:57:15,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:57:15,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:57:15,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:57:15,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:57:15,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:57:15,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:57:15,582 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:57:15,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:57:15,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:57:15,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:57:15,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:57:15,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:57:15,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:57:15,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:57:15,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:57:15,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:57:15,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:57:15,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:57:15,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:57:15,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:57:15,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:57:15,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:57:15,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:57:15,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:57:15,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:57:15,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:57:15,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:57:15,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:57:15,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:57:15,632 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:57:15,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:57:15,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:57:15,633 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:57:15,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:57:15,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:57:15,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:57:15,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:57:15,634 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:57:15,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:57:15,635 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:57:15,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:57:15,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:57:15,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:57:15,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:57:15,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:57:15,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:57:15,637 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:57:15,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:57:15,637 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:57:15,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:57:15,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:57:15,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:57:15,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:57:15,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:57:15,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:57:15,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:57:15,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:57:15,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:57:15,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:57:15,638 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:57:15,639 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:57:15,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:57:15,639 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 12:57:15,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:57:15,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:57:15,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:57:15,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:57:15,879 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:57:15,880 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-07 12:57:15,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb612ce08/c282e620be5e49829bc6c1c8b3de9320/FLAG966a156f0 [2022-04-07 12:57:16,322 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:57:16,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound50.c [2022-04-07 12:57:16,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb612ce08/c282e620be5e49829bc6c1c8b3de9320/FLAG966a156f0 [2022-04-07 12:57:16,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb612ce08/c282e620be5e49829bc6c1c8b3de9320 [2022-04-07 12:57:16,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:57:16,758 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:57:16,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:57:16,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:57:16,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:57:16,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:16,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@80c8301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16, skipping insertion in model container [2022-04-07 12:57:16,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:16,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:57:16,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:57:16,909 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-07 12:57:16,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:57:16,937 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:57:16,951 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-07 12:57:16,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:57:16,974 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:57:16,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16 WrapperNode [2022-04-07 12:57:16,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:57:16,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:57:16,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:57:16,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:57:16,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:16,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:16,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:16,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:16,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:16,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:16,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:17,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:57:17,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:57:17,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:57:17,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:57:17,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16" (1/1) ... [2022-04-07 12:57:17,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:57:17,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:17,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 12:57:17,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 12:57:17,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:57:17,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:57:17,067 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:57:17,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:57:17,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:57:17,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:57:17,069 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:57:17,069 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:57:17,070 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:57:17,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:57:17,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-07 12:57:17,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:57:17,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:57:17,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:57:17,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:57:17,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:57:17,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:57:17,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:57:17,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:57:17,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:57:17,117 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:57:17,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:57:17,263 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:57:17,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:57:17,269 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:57:17,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:57:17 BoogieIcfgContainer [2022-04-07 12:57:17,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:57:17,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:57:17,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:57:17,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:57:17,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:57:16" (1/3) ... [2022-04-07 12:57:17,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c02399b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:57:17, skipping insertion in model container [2022-04-07 12:57:17,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:57:16" (2/3) ... [2022-04-07 12:57:17,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c02399b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:57:17, skipping insertion in model container [2022-04-07 12:57:17,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:57:17" (3/3) ... [2022-04-07 12:57:17,278 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound50.c [2022-04-07 12:57:17,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:57:17,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:57:17,316 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:57:17,322 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 12:57:17,322 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:57:17,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-07 12:57:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 12:57:17,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:17,344 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:17,344 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:17,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-07 12:57:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:17,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468364734] [2022-04-07 12:57:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:17,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:57:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:17,521 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-07 12:57:17,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:57:17,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-07 12:57:17,524 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-07 12:57:17,524 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-07 12:57:17,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:57:17,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-07 12:57:17,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-07 12:57:17,525 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-07 12:57:17,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-07 12:57:17,526 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-07 12:57:17,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-07 12:57:17,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-07 12:57:17,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-07 12:57:17,527 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-07 12:57:17,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:17,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468364734] [2022-04-07 12:57:17,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468364734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:17,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:17,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:57:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645127182] [2022-04-07 12:57:17,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:17,535 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-07 12:57:17,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:17,542 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-07 12:57:17,573 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-07 12:57:17,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:57:17,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:17,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:57:17,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:57:17,603 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-07 12:57:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:17,877 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-07 12:57:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:57:17,877 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-07 12:57:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:17,878 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-07 12:57:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 12:57:17,895 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-07 12:57:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 12:57:17,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-07 12:57:18,046 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-07 12:57:18,057 INFO L225 Difference]: With dead ends: 57 [2022-04-07 12:57:18,057 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 12:57:18,060 INFO L912 BasicCegarLoop]: 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-07 12:57:18,063 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-07 12:57:18,064 INFO L914 BasicCegarLoop]: 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-07 12:57:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 12:57:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-07 12:57:18,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:18,095 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-07 12:57:18,096 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-07 12:57:18,096 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-07 12:57:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:18,100 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 12:57:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 12:57:18,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:18,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:18,102 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-07 12:57:18,102 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-07 12:57:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:18,105 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 12:57:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 12:57:18,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:18,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:18,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:18,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:18,107 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-07 12:57:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-07 12:57:18,111 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-07 12:57:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:18,111 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-07 12:57:18,112 INFO L479 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-07 12:57:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-07 12:57:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:57:18,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:18,113 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:18,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:57:18,113 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:18,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-07 12:57:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:18,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198430634] [2022-04-07 12:57:18,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:18,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:18,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:57:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:18,225 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-07 12:57:18,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:57:18,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:57:18,231 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-07 12:57:18,232 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-07 12:57:18,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:57:18,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:57:18,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-07 12:57:18,237 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-07 12:57:18,239 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-07 12:57:18,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {228#false} is VALID [2022-04-07 12:57:18,239 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-07 12:57:18,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-07 12:57:18,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-07 12:57:18,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-07 12:57:18,241 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-07 12:57:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:18,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198430634] [2022-04-07 12:57:18,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198430634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:18,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:18,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 12:57:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236470912] [2022-04-07 12:57:18,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:18,245 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-07 12:57:18,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:18,246 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-07 12:57:18,256 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-07 12:57:18,257 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:57:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:57:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:57:18,259 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-07 12:57:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:18,531 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 12:57:18,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:57:18,531 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-07 12:57:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:18,531 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-07 12:57:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 12:57:18,534 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-07 12:57:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 12:57:18,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-07 12:57:18,590 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-07 12:57:18,592 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:57:18,592 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 12:57:18,592 INFO L912 BasicCegarLoop]: 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-07 12:57:18,593 INFO L913 BasicCegarLoop]: 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-07 12:57:18,594 INFO L914 BasicCegarLoop]: 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-07 12:57:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 12:57:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-07 12:57:18,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:18,600 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-07 12:57:18,600 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-07 12:57:18,600 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-07 12:57:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:18,603 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 12:57:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:57:18,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:18,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:18,604 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-07 12:57:18,605 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-07 12:57:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:18,607 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 12:57:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:57:18,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:18,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:18,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:18,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:18,608 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-07 12:57:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-07 12:57:18,610 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-07 12:57:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:18,610 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-07 12:57:18,610 INFO L479 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-07 12:57:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:57:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:57:18,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:18,611 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:18,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 12:57:18,611 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:18,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:18,612 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-07 12:57:18,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:18,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865019064] [2022-04-07 12:57:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:18,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:57:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:18,729 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-07 12:57:18,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-07 12:57:18,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-07 12:57:18,730 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-07 12:57:18,731 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-07 12:57:18,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-07 12:57:18,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-07 12:57:18,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-07 12:57:18,732 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-07 12:57:18,732 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-07 12:57:18,733 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-07 12:57:18,734 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-07 12:57:18,734 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-07 12:57:18,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-07 12:57:18,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-07 12:57:18,735 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-07 12:57:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865019064] [2022-04-07 12:57:18,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865019064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:18,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:18,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:57:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940901287] [2022-04-07 12:57:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:18,737 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-07 12:57:18,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:18,737 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-07 12:57:18,747 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-07 12:57:18,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:57:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:18,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:57:18,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:57:18,748 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-07 12:57:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:19,117 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-07 12:57:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:57:19,117 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-07 12:57:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:19,118 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-07 12:57:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 12:57:19,119 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-07 12:57:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 12:57:19,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-07 12:57:19,169 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-07 12:57:19,173 INFO L225 Difference]: With dead ends: 34 [2022-04-07 12:57:19,173 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 12:57:19,174 INFO L912 BasicCegarLoop]: 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-07 12:57:19,179 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:19,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:57:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 12:57:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 12:57:19,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:19,191 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-07 12:57:19,193 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-07 12:57:19,194 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-07 12:57:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:19,199 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:57:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:57:19,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:19,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:19,202 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-07 12:57:19,202 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-07 12:57:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:19,209 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:57:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:57:19,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:19,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:19,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:19,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:19,212 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-07 12:57:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 12:57:19,214 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-07 12:57:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:19,214 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 12:57:19,214 INFO L479 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-07 12:57:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:57:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:57:19,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:19,215 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:19,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 12:57:19,215 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-07 12:57:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:19,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033615127] [2022-04-07 12:57:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:19,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:19,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603349242] [2022-04-07 12:57:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:19,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:19,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 12:57:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:19,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:57:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:19,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:19,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-07 12:57:19,433 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-07 12:57:19,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-07 12:57:19,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-07 12:57:19,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-07 12:57:19,435 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-07 12:57:19,435 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-07 12:57:19,436 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-07 12:57:19,436 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-07 12:57:19,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-07 12:57:19,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-07 12:57:19,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-07 12:57:19,437 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-07 12:57:19,438 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-07 12:57:19,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:19,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-07 12:57:19,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-07 12:57:19,439 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-07 12:57:19,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:57:19,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:19,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033615127] [2022-04-07 12:57:19,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:19,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603349242] [2022-04-07 12:57:19,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603349242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:19,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:19,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:57:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958649208] [2022-04-07 12:57:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:19,441 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-07 12:57:19,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:19,441 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-07 12:57:19,469 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-07 12:57:19,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:57:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:19,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:57:19,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:57:19,471 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-07 12:57:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:19,717 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-07 12:57:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:57:19,718 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-07 12:57:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:19,718 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-07 12:57:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:57:19,720 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-07 12:57:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:57:19,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:57:19,787 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-07 12:57:19,789 INFO L225 Difference]: With dead ends: 50 [2022-04-07 12:57:19,789 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 12:57:19,789 INFO L912 BasicCegarLoop]: 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-07 12:57:19,790 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:19,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:57:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 12:57:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-07 12:57:19,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:19,801 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-07 12:57:19,801 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-07 12:57:19,801 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-07 12:57:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:19,804 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 12:57:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 12:57:19,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:19,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:19,805 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-07 12:57:19,806 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-07 12:57:19,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:19,809 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 12:57:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 12:57:19,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:19,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:19,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:19,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:19,810 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-07 12:57:19,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-07 12:57:19,816 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-07 12:57:19,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:19,816 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-07 12:57:19,816 INFO L479 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-07 12:57:19,817 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-07 12:57:19,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 12:57:19,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:19,817 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:19,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:20,040 WARN L460 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-07 12:57:20,040 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-07 12:57:20,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:20,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114162120] [2022-04-07 12:57:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:20,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:20,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:20,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625080] [2022-04-07 12:57:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:20,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:20,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:20,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:20,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 12:57:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:20,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:57:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:20,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:20,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-07 12:57:20,220 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-07 12:57:20,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:57:20,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-07 12:57:20,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-07 12:57:20,222 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-07 12:57:20,222 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-07 12:57:20,223 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-07 12:57:20,223 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-07 12:57:20,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-07 12:57:20,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-07 12:57:20,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:57:20,227 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-07 12:57:20,227 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-07 12:57:20,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-07 12:57:20,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-07 12:57:20,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:57:20,228 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-07 12:57:20,229 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-07 12:57:20,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {947#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {951#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:20,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-07 12:57:20,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-07 12:57:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:57:20,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:57:20,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:20,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114162120] [2022-04-07 12:57:20,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:20,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625080] [2022-04-07 12:57:20,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:20,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:20,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:57:20,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247191582] [2022-04-07 12:57:20,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:20,236 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-07 12:57:20,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:20,236 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-07 12:57:20,250 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-07 12:57:20,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:57:20,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:20,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:57:20,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:57:20,251 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-07 12:57:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:20,561 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-07 12:57:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:57:20,561 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-07 12:57:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:20,561 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-07 12:57:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:57:20,563 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-07 12:57:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:57:20,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:57:20,632 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-07 12:57:20,633 INFO L225 Difference]: With dead ends: 54 [2022-04-07 12:57:20,633 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 12:57:20,634 INFO L912 BasicCegarLoop]: 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-07 12:57:20,634 INFO L913 BasicCegarLoop]: 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-07 12:57:20,635 INFO L914 BasicCegarLoop]: 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-07 12:57:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 12:57:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-07 12:57:20,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:20,644 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-07 12:57:20,644 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-07 12:57:20,644 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-07 12:57:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:20,647 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:57:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:57:20,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:20,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:20,648 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-07 12:57:20,648 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-07 12:57:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:20,651 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:57:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:57:20,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:20,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:20,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:20,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:20,652 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-07 12:57:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-07 12:57:20,654 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-07 12:57:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:20,654 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-07 12:57:20,654 INFO L479 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-07 12:57:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-07 12:57:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 12:57:20,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:20,655 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:57:20,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:20,877 WARN L460 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-07 12:57:20,878 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-07 12:57:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:20,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002383814] [2022-04-07 12:57:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:20,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:20,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:20,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449638157] [2022-04-07 12:57:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:20,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:20,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:20,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:20,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 12:57:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:20,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 12:57:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:20,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:21,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-07 12:57:21,112 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-07 12:57:21,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:57:21,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-07 12:57:21,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-07 12:57:21,113 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-07 12:57:21,114 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-07 12:57:21,114 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-07 12:57:21,114 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-07 12:57:21,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:57:21,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:57:21,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:57:21,115 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-07 12:57:21,116 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-07 12:57:21,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:57:21,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:57:21,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:57:21,117 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-07 12:57:21,119 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-07 12:57:21,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:57:21,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:57:21,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:57:21,120 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-07 12:57:21,121 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-07 12:57:21,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:21,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-07 12:57:21,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-07 12:57:21,122 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-07 12:57:21,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:57:21,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:21,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002383814] [2022-04-07 12:57:21,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:21,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449638157] [2022-04-07 12:57:21,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449638157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:57:21,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:57:21,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:57:21,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875760166] [2022-04-07 12:57:21,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:57:21,126 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-07 12:57:21,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:21,126 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-07 12:57:21,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:21,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:57:21,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:21,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:57:21,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:57:21,144 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-07 12:57:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:21,494 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-07 12:57:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:57:21,495 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-07 12:57:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:21,495 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-07 12:57:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:57:21,497 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-07 12:57:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:57:21,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:57:21,566 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-07 12:57:21,567 INFO L225 Difference]: With dead ends: 62 [2022-04-07 12:57:21,567 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 12:57:21,568 INFO L912 BasicCegarLoop]: 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-07 12:57:21,569 INFO L913 BasicCegarLoop]: 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-07 12:57:21,569 INFO L914 BasicCegarLoop]: 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-07 12:57:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 12:57:21,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-07 12:57:21,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:21,578 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-07 12:57:21,579 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-07 12:57:21,579 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-07 12:57:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:21,581 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 12:57:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:57:21,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:21,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:21,582 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-07 12:57:21,582 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-07 12:57:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:21,584 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 12:57:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:57:21,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:21,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:21,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:21,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:21,585 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-07 12:57:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-07 12:57:21,587 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-07 12:57:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:21,587 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-07 12:57:21,587 INFO L479 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-07 12:57:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:57:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 12:57:21,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:21,588 INFO L499 BasicCegarLoop]: 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-07 12:57:21,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:21,803 WARN L460 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-07 12:57:21,804 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-07 12:57:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:21,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123831237] [2022-04-07 12:57:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:21,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:21,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354371168] [2022-04-07 12:57:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:21,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:21,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:21,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:21,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 12:57:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:21,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:57:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:21,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:22,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-07 12:57:22,078 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-07 12:57:22,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:22,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:22,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:22,081 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-07 12:57:22,093 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-07 12:57:22,094 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-07 12:57:22,098 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-07 12:57:22,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,099 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #59#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,100 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-07 12:57:22,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,101 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #61#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,102 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-07 12:57:22,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,104 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,104 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #63#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,105 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-07 12:57:22,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,108 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #65#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,108 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-07 12:57:22,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,110 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1609#(<= ~counter~0 1)} {1609#(<= ~counter~0 1)} #67#return; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:22,110 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-07 12:57:22,111 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-07 12:57:22,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {1586#false} is VALID [2022-04-07 12:57:22,111 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-07 12:57:22,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:57:22,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-07 12:57:22,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-07 12:57:22,112 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-07 12:57:22,112 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-07 12:57:22,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:57:22,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-07 12:57:22,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-07 12:57:22,112 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-07 12:57:22,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:22,333 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-07 12:57:22,333 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-07 12:57:22,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:57:22,333 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-07 12:57:22,333 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-07 12:57:22,333 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:57:22,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:57:22,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:57:22,334 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-07 12:57:22,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {1586#false} is VALID [2022-04-07 12:57:22,334 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-07 12:57:22,335 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-07 12:57:22,335 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #67#return; {1756#(< ~counter~0 50)} is VALID [2022-04-07 12:57:22,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:57:22,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:57:22,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:57:22,336 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-07 12:57:22,336 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #65#return; {1756#(< ~counter~0 50)} is VALID [2022-04-07 12:57:22,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:57:22,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:57:22,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:57:22,337 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-07 12:57:22,338 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #63#return; {1756#(< ~counter~0 50)} is VALID [2022-04-07 12:57:22,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:57:22,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:57:22,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:57:22,338 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-07 12:57:22,339 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #61#return; {1756#(< ~counter~0 50)} is VALID [2022-04-07 12:57:22,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:57:22,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:57:22,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:57:22,339 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-07 12:57:22,340 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1756#(< ~counter~0 50)} #59#return; {1756#(< ~counter~0 50)} is VALID [2022-04-07 12:57:22,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:57:22,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:57:22,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:57:22,340 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-07 12:57:22,341 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-07 12:57:22,341 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-07 12:57:22,342 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-07 12:57:22,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#(< ~counter~0 49)} call #t~ret6 := main(); {1841#(< ~counter~0 49)} is VALID [2022-04-07 12:57:22,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#(< ~counter~0 49)} {1585#true} #81#return; {1841#(< ~counter~0 49)} is VALID [2022-04-07 12:57:22,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#(< ~counter~0 49)} assume true; {1841#(< ~counter~0 49)} is VALID [2022-04-07 12:57:22,352 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-07 12:57:22,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-07 12:57:22,353 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-07 12:57:22,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:22,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123831237] [2022-04-07 12:57:22,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:22,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354371168] [2022-04-07 12:57:22,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354371168] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:22,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:22,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 12:57:22,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961383456] [2022-04-07 12:57:22,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:22,357 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-07 12:57:22,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:22,359 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-07 12:57:22,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:22,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:22,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:22,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:57:22,404 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-07 12:57:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:23,239 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-07 12:57:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:57:23,240 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-07 12:57:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:23,240 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-07 12:57:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-07 12:57:23,243 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-07 12:57:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-07 12:57:23,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-04-07 12:57:23,368 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-07 12:57:23,371 INFO L225 Difference]: With dead ends: 120 [2022-04-07 12:57:23,371 INFO L226 Difference]: Without dead ends: 104 [2022-04-07 12:57:23,372 INFO L912 BasicCegarLoop]: 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-07 12:57:23,372 INFO L913 BasicCegarLoop]: 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-07 12:57:23,372 INFO L914 BasicCegarLoop]: 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-07 12:57:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-07 12:57:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-07 12:57:23,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:23,411 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-07 12:57:23,411 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-07 12:57:23,412 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-07 12:57:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:23,416 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-07 12:57:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-07 12:57:23,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:23,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:23,417 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-07 12:57:23,417 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-07 12:57:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:23,422 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-07 12:57:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-07 12:57:23,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:23,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:23,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:23,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:23,423 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-07 12:57:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-07 12:57:23,427 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-07 12:57:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:23,427 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-07 12:57:23,427 INFO L479 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-07 12:57:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-07 12:57:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 12:57:23,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:23,428 INFO L499 BasicCegarLoop]: 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-07 12:57:23,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:23,643 WARN L460 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-07 12:57:23,643 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:23,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-07 12:57:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:23,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123608521] [2022-04-07 12:57:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:23,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:23,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628129708] [2022-04-07 12:57:23,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:23,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:23,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:23,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:23,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 12:57:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:23,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:57:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:23,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:23,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-07 12:57:23,969 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-07 12:57:23,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:23,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-07 12:57:23,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-07 12:57:23,970 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-07 12:57:23,971 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-07 12:57:23,971 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-07 12:57:23,971 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-07 12:57:23,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:23,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:23,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:23,972 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-07 12:57:23,972 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-07 12:57:23,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:23,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:23,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:23,973 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-07 12:57:23,973 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-07 12:57:23,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:23,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:23,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:23,974 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-07 12:57:23,974 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-07 12:57:23,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:23,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:23,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:23,975 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-07 12:57:23,975 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-07 12:57:23,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:23,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:23,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:23,976 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-07 12:57:23,977 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-07 12:57:23,977 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-07 12:57:23,978 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-07 12:57:23,978 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-07 12:57:23,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:23,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:23,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:23,984 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-07 12:57:23,986 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-07 12:57:23,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:23,990 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-07 12:57:23,991 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-07 12:57:23,991 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-07 12:57:23,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:24,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-07 12:57:24,206 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-07 12:57:24,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {2548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:24,207 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-07 12:57:24,208 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-07 12:57:24,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:24,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:24,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:24,208 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-07 12:57:24,209 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-07 12:57:24,212 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-07 12:57:24,218 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-07 12:57:24,218 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-07 12:57:24,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:24,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:24,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:24,219 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-07 12:57:24,219 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-07 12:57:24,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:24,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:24,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:24,220 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-07 12:57:24,220 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-07 12:57:24,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:24,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:24,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:24,221 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-07 12:57:24,221 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-07 12:57:24,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:24,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:24,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:24,222 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-07 12:57:24,222 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-07 12:57:24,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:24,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:57:24,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:57:24,223 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-07 12:57:24,224 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-07 12:57:24,224 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-07 12:57:24,225 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-07 12:57:24,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-07 12:57:24,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-07 12:57:24,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:57:24,225 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-07 12:57:24,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-07 12:57:24,226 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-07 12:57:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:24,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123608521] [2022-04-07 12:57:24,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:24,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628129708] [2022-04-07 12:57:24,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628129708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:24,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:24,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:57:24,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65702967] [2022-04-07 12:57:24,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:24,227 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-07 12:57:24,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:24,228 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-07 12:57:24,273 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-07 12:57:24,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:24,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:24,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:24,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:57:24,274 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-07 12:57:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:25,074 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-07 12:57:25,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:25,074 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-07 12:57:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:25,074 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-07 12:57:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:57:25,076 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-07 12:57:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:57:25,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-07 12:57:25,181 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-07 12:57:25,184 INFO L225 Difference]: With dead ends: 118 [2022-04-07 12:57:25,184 INFO L226 Difference]: Without dead ends: 116 [2022-04-07 12:57:25,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:57:25,185 INFO L913 BasicCegarLoop]: 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-07 12:57:25,186 INFO L914 BasicCegarLoop]: 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-07 12:57:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-07 12:57:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-07 12:57:25,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:25,248 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-07 12:57:25,249 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-07 12:57:25,250 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-07 12:57:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:25,255 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-07 12:57:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:57:25,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:25,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:25,256 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-07 12:57:25,256 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-07 12:57:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:25,261 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-07 12:57:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:57:25,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:25,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:25,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:25,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:25,262 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-07 12:57:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-07 12:57:25,267 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-07 12:57:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:25,267 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-07 12:57:25,267 INFO L479 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-07 12:57:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:57:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 12:57:25,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:25,268 INFO L499 BasicCegarLoop]: 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-07 12:57:25,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:25,497 WARN L460 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-07 12:57:25,498 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:25,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-07 12:57:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:25,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384211911] [2022-04-07 12:57:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:25,511 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:25,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591787298] [2022-04-07 12:57:25,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:25,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:25,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:25,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:25,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 12:57:25,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:25,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:25,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:57:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:25,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:25,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-07 12:57:25,803 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-07 12:57:25,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:25,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-07 12:57:25,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-07 12:57:25,803 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-07 12:57:25,804 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-07 12:57:25,804 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-07 12:57:25,805 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-07 12:57:25,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:25,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:25,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:25,806 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-07 12:57:25,806 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-07 12:57:25,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:25,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:25,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:25,807 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-07 12:57:25,807 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-07 12:57:25,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:25,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:25,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:25,808 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-07 12:57:25,808 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-07 12:57:25,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:25,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:25,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:25,809 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-07 12:57:25,809 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-07 12:57:25,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:25,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:25,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:25,810 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-07 12:57:25,811 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-07 12:57:25,811 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-07 12:57:25,812 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-07 12:57:25,812 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-07 12:57:25,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:25,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:25,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:25,815 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-07 12:57:25,815 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-07 12:57:25,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:25,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:25,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:25,816 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-07 12:57:25,817 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-07 12:57:25,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:25,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-07 12:57:25,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-07 12:57:25,818 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-07 12:57:25,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:26,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-07 12:57:26,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-07 12:57:26,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {3434#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3438#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:26,022 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-07 12:57:26,022 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-07 12:57:26,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:26,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:26,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:26,023 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-07 12:57:26,023 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-07 12:57:26,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:26,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:26,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:26,024 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-07 12:57:26,024 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-07 12:57:26,024 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-07 12:57:26,027 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-07 12:57:26,028 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-07 12:57:26,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:26,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:26,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:26,028 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-07 12:57:26,029 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-07 12:57:26,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:26,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:26,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:26,029 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-07 12:57:26,030 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-07 12:57:26,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:26,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:26,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:26,031 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-07 12:57:26,034 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-07 12:57:26,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:26,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:26,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:26,035 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-07 12:57:26,036 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-07 12:57:26,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:26,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:57:26,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:57:26,036 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-07 12:57:26,037 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-07 12:57:26,037 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-07 12:57:26,038 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-07 12:57:26,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-07 12:57:26,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-07 12:57:26,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:57:26,038 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-07 12:57:26,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-07 12:57:26,038 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-07 12:57:26,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:26,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384211911] [2022-04-07 12:57:26,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:26,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591787298] [2022-04-07 12:57:26,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591787298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:26,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:26,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:57:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304358425] [2022-04-07 12:57:26,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:26,040 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-07 12:57:26,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:26,041 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-07 12:57:26,092 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-07 12:57:26,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:26,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:26,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:26,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:57:26,093 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-07 12:57:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:26,613 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-07 12:57:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:57:26,614 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-07 12:57:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:26,614 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-07 12:57:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-07 12:57:26,616 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-07 12:57:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-07 12:57:26,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-07 12:57:26,701 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-07 12:57:26,704 INFO L225 Difference]: With dead ends: 122 [2022-04-07 12:57:26,704 INFO L226 Difference]: Without dead ends: 120 [2022-04-07 12:57:26,704 INFO L912 BasicCegarLoop]: 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-07 12:57:26,705 INFO L913 BasicCegarLoop]: 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-07 12:57:26,705 INFO L914 BasicCegarLoop]: 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-07 12:57:26,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-07 12:57:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-07 12:57:26,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:26,752 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-07 12:57:26,753 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-07 12:57:26,753 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-07 12:57:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:26,758 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-07 12:57:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:57:26,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:26,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:26,759 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-07 12:57:26,759 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-07 12:57:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:26,763 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-07 12:57:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:57:26,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:26,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:26,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:26,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:26,764 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-07 12:57:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-07 12:57:26,768 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-07 12:57:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:26,768 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-07 12:57:26,768 INFO L479 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-07 12:57:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:57:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 12:57:26,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:26,769 INFO L499 BasicCegarLoop]: 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-07 12:57:26,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:26,987 WARN L460 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-07 12:57:26,988 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:26,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:26,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-07 12:57:26,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:26,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356328414] [2022-04-07 12:57:26,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:26,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:26,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352619912] [2022-04-07 12:57:26,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:57:26,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:26,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:27,000 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:27,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 12:57:27,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 12:57:27,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:27,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 12:57:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:27,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:27,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-07 12:57:27,369 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-07 12:57:27,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-07 12:57:27,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-07 12:57:27,370 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-07 12:57:27,371 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-07 12:57:27,371 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-07 12:57:27,371 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-07 12:57:27,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,373 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-07 12:57:27,373 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-07 12:57:27,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,374 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-07 12:57:27,374 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-07 12:57:27,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,375 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-07 12:57:27,375 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-07 12:57:27,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,376 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-07 12:57:27,376 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-07 12:57:27,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,377 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-07 12:57:27,377 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-07 12:57:27,378 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-07 12:57:27,378 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-07 12:57:27,378 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-07 12:57:27,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,379 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-07 12:57:27,379 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-07 12:57:27,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,379 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,380 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-07 12:57:27,380 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-07 12:57:27,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,380 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,381 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-07 12:57:27,382 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-07 12:57:27,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:27,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-07 12:57:27,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-07 12:57:27,383 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-07 12:57:27,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:27,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-07 12:57:27,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-07 12:57:27,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {4364#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4368#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:27,662 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-07 12:57:27,663 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-07 12:57:27,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,663 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-07 12:57:27,664 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-07 12:57:27,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,664 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,664 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-07 12:57:27,665 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-07 12:57:27,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,665 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-07 12:57:27,665 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-07 12:57:27,666 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-07 12:57:27,670 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-07 12:57:27,670 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-07 12:57:27,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,671 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-07 12:57:27,671 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-07 12:57:27,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,672 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-07 12:57:27,672 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-07 12:57:27,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,673 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-07 12:57:27,673 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-07 12:57:27,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,674 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-07 12:57:27,674 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-07 12:57:27,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:57:27,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:57:27,675 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-07 12:57:27,675 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-07 12:57:27,676 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-07 12:57:27,676 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-07 12:57:27,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-07 12:57:27,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-07 12:57:27,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:57:27,677 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-07 12:57:27,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-07 12:57:27,677 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-07 12:57:27,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:27,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356328414] [2022-04-07 12:57:27,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:27,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352619912] [2022-04-07 12:57:27,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352619912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:27,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:27,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:57:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274012048] [2022-04-07 12:57:27,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:27,678 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-07 12:57:27,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:27,679 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-07 12:57:27,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:27,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:27,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:57:27,741 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-07 12:57:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:28,788 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-07 12:57:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:28,789 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-07 12:57:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:28,789 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-07 12:57:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:57:28,791 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-07 12:57:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:57:28,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-07 12:57:28,888 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-07 12:57:28,890 INFO L225 Difference]: With dead ends: 146 [2022-04-07 12:57:28,890 INFO L226 Difference]: Without dead ends: 135 [2022-04-07 12:57:28,891 INFO L912 BasicCegarLoop]: 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-07 12:57:28,891 INFO L913 BasicCegarLoop]: 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-07 12:57:28,892 INFO L914 BasicCegarLoop]: 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-07 12:57:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-07 12:57:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-07 12:57:28,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:28,941 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-07 12:57:28,941 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-07 12:57:28,942 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-07 12:57:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:28,948 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-07 12:57:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:57:28,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:28,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:28,949 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-07 12:57:28,949 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-07 12:57:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:28,962 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-07 12:57:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:57:28,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:28,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:28,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:28,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:28,963 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-07 12:57:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-07 12:57:28,967 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-07 12:57:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:28,969 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-07 12:57:28,969 INFO L479 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-07 12:57:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:57:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-07 12:57:28,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:28,970 INFO L499 BasicCegarLoop]: 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-07 12:57:28,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:29,183 WARN L460 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-07 12:57:29,184 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-07 12:57:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:29,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740114919] [2022-04-07 12:57:29,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:29,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:29,194 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:29,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190966538] [2022-04-07 12:57:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:29,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:29,196 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:29,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 12:57:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:29,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 12:57:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:29,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:35,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-07 12:57:35,877 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-07 12:57:35,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-07 12:57:35,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-07 12:57:35,880 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-07 12:57:35,881 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-07 12:57:35,881 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-07 12:57:35,882 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-07 12:57:35,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,882 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-07 12:57:35,882 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-07 12:57:35,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,883 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-07 12:57:35,883 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-07 12:57:35,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,884 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-07 12:57:35,884 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-07 12:57:35,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,885 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-07 12:57:35,885 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-07 12:57:35,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,885 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-07 12:57:35,886 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-07 12:57:35,886 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-07 12:57:35,887 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-07 12:57:35,887 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-07 12:57:35,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,888 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-07 12:57:35,888 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-07 12:57:35,888 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,888 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,888 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,888 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-07 12:57:35,888 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-07 12:57:35,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,889 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-07 12:57:35,889 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-07 12:57:35,889 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,889 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,889 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,890 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-07 12:57:35,890 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-07 12:57:35,890 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,890 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,890 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,891 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-07 12:57:35,891 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-07 12:57:35,891 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-07 12:57:35,891 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:35,892 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:35,892 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:35,892 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-07 12:57:35,893 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-07 12:57:35,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:35,893 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-07 12:57:35,893 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-07 12:57:35,894 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-07 12:57:35,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:36,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-07 12:57:36,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-07 12:57:36,525 INFO L290 TraceCheckUtils]: 68: Hoare triple {5432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:36,526 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-07 12:57:36,526 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-07 12:57:36,526 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,526 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,526 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-07 12:57:36,527 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-07 12:57:36,527 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-07 12:57:36,527 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,528 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-07 12:57:36,528 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-07 12:57:36,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,529 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-07 12:57:36,529 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-07 12:57:36,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,529 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-07 12:57:36,530 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-07 12:57:36,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,530 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-07 12:57:36,531 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-07 12:57:36,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,531 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-07 12:57:36,531 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-07 12:57:36,532 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-07 12:57:36,535 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-07 12:57:36,536 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-07 12:57:36,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,536 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-07 12:57:36,537 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-07 12:57:36,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,537 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-07 12:57:36,537 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-07 12:57:36,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,538 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-07 12:57:36,538 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-07 12:57:36,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,539 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-07 12:57:36,539 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-07 12:57:36,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:57:36,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:57:36,540 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-07 12:57:36,540 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-07 12:57:36,541 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-07 12:57:36,542 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-07 12:57:36,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-07 12:57:36,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-07 12:57:36,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:57:36,542 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-07 12:57:36,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-07 12:57:36,543 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-07 12:57:36,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:36,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740114919] [2022-04-07 12:57:36,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:36,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190966538] [2022-04-07 12:57:36,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190966538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:36,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:36,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 12:57:36,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655006878] [2022-04-07 12:57:36,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:36,545 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-07 12:57:36,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:36,547 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-07 12:57:36,623 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-07 12:57:36,623 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 12:57:36,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:36,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 12:57:36,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:57:36,627 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-07 12:57:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:37,806 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-07 12:57:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:57:37,806 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-07 12:57:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:37,806 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-07 12:57:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 12:57:37,809 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-07 12:57:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 12:57:37,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-07 12:57:37,922 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-07 12:57:37,925 INFO L225 Difference]: With dead ends: 148 [2022-04-07 12:57:37,925 INFO L226 Difference]: Without dead ends: 144 [2022-04-07 12:57:37,925 INFO L912 BasicCegarLoop]: 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-07 12:57:37,926 INFO L913 BasicCegarLoop]: 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-07 12:57:37,926 INFO L914 BasicCegarLoop]: 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-07 12:57:37,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-07 12:57:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-07 12:57:38,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:38,027 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-07 12:57:38,027 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-07 12:57:38,027 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-07 12:57:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:38,031 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-07 12:57:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-07 12:57:38,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:38,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:38,032 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-07 12:57:38,032 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-07 12:57:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:38,035 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-07 12:57:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-07 12:57:38,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:38,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:38,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:38,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:38,036 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-07 12:57:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-07 12:57:38,039 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-07 12:57:38,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:38,040 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-07 12:57:38,040 INFO L479 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-07 12:57:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-07 12:57:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-07 12:57:38,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:38,041 INFO L499 BasicCegarLoop]: 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-07 12:57:38,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:38,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-07 12:57:38,264 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-07 12:57:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:38,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269372760] [2022-04-07 12:57:38,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:38,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:38,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150176339] [2022-04-07 12:57:38,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:38,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:38,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:38,281 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:38,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 12:57:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:38,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 12:57:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:38,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:39,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6368#true} is VALID [2022-04-07 12:57:39,039 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-07 12:57:39,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #81#return; {6368#true} is VALID [2022-04-07 12:57:39,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret6 := main(); {6368#true} is VALID [2022-04-07 12:57:39,039 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-07 12:57:39,040 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-07 12:57:39,040 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-07 12:57:39,040 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-07 12:57:39,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,041 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-07 12:57:39,041 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-07 12:57:39,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,043 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-07 12:57:39,044 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-07 12:57:39,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,044 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-07 12:57:39,044 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-07 12:57:39,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,045 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-07 12:57:39,045 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-07 12:57:39,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,045 INFO L290 TraceCheckUtils]: 31: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,046 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-07 12:57:39,046 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-07 12:57:39,047 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-07 12:57:39,047 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-07 12:57:39,047 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-07 12:57:39,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,047 INFO L290 TraceCheckUtils]: 38: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,048 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-07 12:57:39,048 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-07 12:57:39,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,048 INFO L290 TraceCheckUtils]: 43: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,048 INFO L290 TraceCheckUtils]: 44: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,049 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-07 12:57:39,049 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-07 12:57:39,049 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,049 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-07 12:57:39,050 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-07 12:57:39,050 INFO L290 TraceCheckUtils]: 52: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,050 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,050 INFO L290 TraceCheckUtils]: 54: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,050 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-07 12:57:39,050 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-07 12:57:39,050 INFO L290 TraceCheckUtils]: 57: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,050 INFO L290 TraceCheckUtils]: 58: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,050 INFO L290 TraceCheckUtils]: 59: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,051 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-07 12:57:39,052 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-07 12:57:39,052 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-07 12:57:39,052 INFO L290 TraceCheckUtils]: 63: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,052 INFO L290 TraceCheckUtils]: 65: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,052 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-07 12:57:39,052 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-07 12:57:39,052 INFO L290 TraceCheckUtils]: 68: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:39,052 INFO L290 TraceCheckUtils]: 69: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:39,053 INFO L290 TraceCheckUtils]: 70: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:39,053 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-07 12:57:39,054 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-07 12:57:39,055 INFO L290 TraceCheckUtils]: 73: Hoare triple {6592#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6596#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:39,055 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6369#false} is VALID [2022-04-07 12:57:39,055 INFO L290 TraceCheckUtils]: 75: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-07 12:57:39,055 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-07 12:57:39,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:46,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269372760] [2022-04-07 12:57:46,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:46,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150176339] [2022-04-07 12:57:46,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150176339] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:46,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:46,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-07 12:57:46,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013541176] [2022-04-07 12:57:46,803 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:46,804 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-07 12:57:46,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:46,804 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-07 12:57:46,844 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-07 12:57:46,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 12:57:46,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:46,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 12:57:46,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:57:46,845 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-07 12:57:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:47,407 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-07 12:57:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:47,407 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-07 12:57:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:47,408 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-07 12:57:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-07 12:57:47,410 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-07 12:57:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-07 12:57:47,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-07 12:57:47,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:47,484 INFO L225 Difference]: With dead ends: 143 [2022-04-07 12:57:47,485 INFO L226 Difference]: Without dead ends: 132 [2022-04-07 12:57:47,485 INFO L912 BasicCegarLoop]: 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-07 12:57:47,485 INFO L913 BasicCegarLoop]: 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-07 12:57:47,486 INFO L914 BasicCegarLoop]: 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-07 12:57:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-07 12:57:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-07 12:57:47,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:47,567 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-07 12:57:47,567 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-07 12:57:47,568 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-07 12:57:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:47,570 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-07 12:57:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:57:47,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:47,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:47,571 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-07 12:57:47,572 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-07 12:57:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:47,574 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-07 12:57:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:57:47,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:47,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:47,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:47,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:47,576 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-07 12:57:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-07 12:57:47,578 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-07 12:57:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:47,579 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-07 12:57:47,579 INFO L479 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-07 12:57:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:57:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 12:57:47,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:47,580 INFO L499 BasicCegarLoop]: 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-07 12:57:47,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:47,795 WARN L460 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-07 12:57:47,795 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:47,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-04-07 12:57:47,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:47,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836101380] [2022-04-07 12:57:47,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:47,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:47,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:47,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [195321360] [2022-04-07 12:57:47,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:57:47,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:47,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:47,807 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:47,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-07 12:57:50,008 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:57:50,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:50,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-07 12:57:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:50,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:50,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-07 12:57:50,641 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-07 12:57:50,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:50,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-07 12:57:50,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-07 12:57: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-07 12:57: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-07 12:57:50,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 50);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:57: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-07 12:57:50,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:50,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:50,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:50,642 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:57:50,642 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-07 12:57:50,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,642 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-07 12:57:50,643 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-07 12:57:50,643 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-07 12:57:50,643 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-07 12:57:50,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,644 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-07 12:57:50,644 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-07 12:57:50,645 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-07 12:57:50,645 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-07 12:57:50,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:50,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:50,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:50,645 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-07 12:57:50,645 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-07 12:57:50,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:50,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:50,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:50,646 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-07 12:57:50,652 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-07 12:57:50,653 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-07 12:57:50,653 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-07 12:57:50,654 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-07 12:57:50,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:50,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:50,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:50,654 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-07 12:57:50,654 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-07 12:57:50,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,655 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-07 12:57:50,655 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-07 12:57:50,656 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-07 12:57:50,656 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-07 12:57:50,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,657 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-07 12:57:50,657 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-07 12:57:50,657 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-07 12:57:50,657 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-07 12:57:50,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,658 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-07 12:57:50,658 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-07 12:57:50,659 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-07 12:57:50,659 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-07 12:57:50,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:50,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:50,659 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:50,660 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-07 12:57:50,668 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-07 12:57:50,669 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-07 12:57:50,670 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-07 12:57:50,670 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-07 12:57:50,670 INFO L290 TraceCheckUtils]: 65: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,670 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-07 12:57:50,671 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-07 12:57:50,672 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-07 12:57:50,672 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-07 12:57:50,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {7397#true} ~cond := #in~cond; {7444#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,672 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-07 12:57:50,673 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-07 12:57:50,673 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-07 12:57:50,674 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-07 12:57:50,674 INFO L290 TraceCheckUtils]: 75: Hoare triple {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:50,674 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-07 12:57:50,675 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-07 12:57:50,675 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-07 12:57:50,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:51,665 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-07 12:57:51,666 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-07 12:57:51,666 INFO L290 TraceCheckUtils]: 75: Hoare triple {7631#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7635#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:51,667 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-07 12:57:51,667 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-07 12:57:51,667 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-07 12:57:51,668 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-07 12:57:51,668 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-07 12:57:51,668 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-07 12:57:51,669 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-07 12:57:51,669 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-07 12:57:51,669 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-07 12:57:51,670 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-07 12:57:51,670 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-07 12:57:51,670 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-07 12:57:51,671 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-07 12:57:51,676 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-07 12:57:51,677 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-07 12:57:51,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:51,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:51,677 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-07 12:57:51,680 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-07 12:57:51,680 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-07 12:57:51,681 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-07 12:57:51,681 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-07 12:57:51,681 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-07 12:57:51,681 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-07 12:57:51,681 INFO L290 TraceCheckUtils]: 49: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:51,681 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:51,681 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-07 12:57:51,681 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-07 12:57:51,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:51,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:51,682 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-07 12:57:51,682 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:57:51,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:51,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:51,682 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-07 12:57:51,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {7397#true} assume !!(#t~post5 < 50);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:57:51,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-07 12:57:51,683 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-07 12:57:51,683 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7397#true} #67#return; {7397#true} is VALID [2022-04-07 12:57:51,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:51,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:51,683 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-07 12:57:51,683 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7397#true} #65#return; {7397#true} is VALID [2022-04-07 12:57:51,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:51,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:51,684 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-07 12:57:51,684 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-07 12:57:51,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:51,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:51,684 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-07 12:57:51,684 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-07 12:57:51,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:51,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:51,685 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-07 12:57:51,685 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:57:51,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:51,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:51,685 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-07 12:57:51,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 50);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:57:51,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#true} is VALID [2022-04-07 12:57:51,685 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-07 12:57:51,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-07 12:57:51,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-07 12:57:51,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:51,686 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-07 12:57:51,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-07 12:57:51,686 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-07 12:57:51,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836101380] [2022-04-07 12:57:51,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:51,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195321360] [2022-04-07 12:57:51,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195321360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:51,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:51,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-04-07 12:57:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726058204] [2022-04-07 12:57:51,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:51,688 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-07 12:57:51,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:51,691 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-07 12:57:51,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:51,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 12:57:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:51,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 12:57:51,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:57:51,796 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-07 12:57:52,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:52,706 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-07 12:57:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:52,706 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-07 12:57:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:52,707 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-07 12:57:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 12:57:52,712 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-07 12:57:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 12:57:52,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-07 12:57:54,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:54,763 INFO L225 Difference]: With dead ends: 142 [2022-04-07 12:57:54,764 INFO L226 Difference]: Without dead ends: 138 [2022-04-07 12:57:54,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-07 12:57:54,764 INFO L913 BasicCegarLoop]: 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-07 12:57:54,765 INFO L914 BasicCegarLoop]: 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-07 12:57:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-07 12:57:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-07 12:57:54,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:54,847 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-07 12:57:54,848 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-07 12:57:54,848 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-07 12:57:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:54,851 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-07 12:57:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:57:54,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:54,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:54,852 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-07 12:57:54,852 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-07 12:57:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:54,855 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-07 12:57:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:57:54,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:54,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:54,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:54,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:54,856 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-07 12:57:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-07 12:57:54,859 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-07 12:57:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:54,859 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-07 12:57:54,859 INFO L479 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-07 12:57:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:57:54,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-07 12:57:54,860 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:54,861 INFO L499 BasicCegarLoop]: 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-07 12:57:54,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:55,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 12:57:55,067 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-04-07 12:57:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:55,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411619362] [2022-04-07 12:57:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:55,093 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:55,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [605147109] [2022-04-07 12:57:55,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:55,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:55,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:55,095 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:55,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-07 12:57:55,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:55,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:55,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 12:57:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:55,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:55,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {8554#true} call ULTIMATE.init(); {8554#true} is VALID [2022-04-07 12:57:55,794 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-07 12:57:55,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8554#true} {8554#true} #81#return; {8554#true} is VALID [2022-04-07 12:57:55,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {8554#true} call #t~ret6 := main(); {8554#true} is VALID [2022-04-07 12:57:55,795 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-07 12:57:55,795 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-07 12:57:55,796 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-07 12:57:55,796 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-07 12:57:55,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,797 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-07 12:57:55,797 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-07 12:57:55,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,797 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-07 12:57:55,797 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-07 12:57:55,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,798 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-07 12:57:55,798 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-07 12:57:55,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,799 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-07 12:57:55,799 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-07 12:57:55,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,800 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-07 12:57:55,800 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-07 12:57:55,800 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-07 12:57:55,801 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-07 12:57:55,801 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-07 12:57:55,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,801 INFO L290 TraceCheckUtils]: 38: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,802 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-07 12:57:55,802 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-07 12:57:55,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,802 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-07 12:57:55,802 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-07 12:57:55,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,803 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-07 12:57:55,803 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-07 12:57:55,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,804 INFO L290 TraceCheckUtils]: 53: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,804 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-07 12:57:55,804 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-07 12:57:55,805 INFO L290 TraceCheckUtils]: 57: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,805 INFO L290 TraceCheckUtils]: 58: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,805 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-07 12:57:55,806 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-07 12:57:55,806 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-07 12:57:55,806 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-07 12:57:55,806 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-07 12:57:55,807 INFO L290 TraceCheckUtils]: 65: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,807 INFO L290 TraceCheckUtils]: 66: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,807 INFO L290 TraceCheckUtils]: 67: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,807 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-07 12:57:55,807 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-07 12:57:55,807 INFO L290 TraceCheckUtils]: 70: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,807 INFO L290 TraceCheckUtils]: 71: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,807 INFO L290 TraceCheckUtils]: 72: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,808 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-07 12:57:55,808 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-07 12:57:55,808 INFO L290 TraceCheckUtils]: 75: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,808 INFO L290 TraceCheckUtils]: 76: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,808 INFO L290 TraceCheckUtils]: 77: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,809 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-07 12:57:55,809 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-07 12:57:55,809 INFO L290 TraceCheckUtils]: 80: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,809 INFO L290 TraceCheckUtils]: 81: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,809 INFO L290 TraceCheckUtils]: 82: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,809 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-07 12:57:55,809 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-07 12:57:55,810 INFO L290 TraceCheckUtils]: 85: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,810 INFO L290 TraceCheckUtils]: 86: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,810 INFO L290 TraceCheckUtils]: 87: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,810 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-07 12:57:55,810 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-07 12:57:55,811 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-07 12:57:55,811 INFO L290 TraceCheckUtils]: 91: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,811 INFO L290 TraceCheckUtils]: 92: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,811 INFO L290 TraceCheckUtils]: 93: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,811 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-07 12:57:55,812 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-07 12:57:55,812 INFO L290 TraceCheckUtils]: 96: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:55,812 INFO L290 TraceCheckUtils]: 97: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:55,812 INFO L290 TraceCheckUtils]: 98: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:55,812 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-07 12:57:55,813 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-07 12:57:55,813 INFO L290 TraceCheckUtils]: 101: Hoare triple {8863#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8867#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:57:55,814 INFO L290 TraceCheckUtils]: 102: Hoare triple {8867#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8555#false} is VALID [2022-04-07 12:57:55,814 INFO L290 TraceCheckUtils]: 103: Hoare triple {8555#false} assume !false; {8555#false} is VALID [2022-04-07 12:57:55,814 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-07 12:57:55,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:58,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:58,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411619362] [2022-04-07 12:57:58,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:58,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605147109] [2022-04-07 12:57:58,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605147109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:58,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:58,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-07 12:57:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772607707] [2022-04-07 12:57:58,347 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:58,348 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-07 12:57:58,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:58,348 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-07 12:57:58,398 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-07 12:57:58,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:58,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:58,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:58,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:57:58,399 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-07 12:57:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:59,236 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-07 12:57:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:57:59,236 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-07 12:57:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:59,236 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-07 12:57:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-07 12:57:59,238 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-07 12:57:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-07 12:57:59,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-07 12:57:59,323 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-07 12:57:59,325 INFO L225 Difference]: With dead ends: 140 [2022-04-07 12:57:59,325 INFO L226 Difference]: Without dead ends: 129 [2022-04-07 12:57:59,325 INFO L912 BasicCegarLoop]: 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-07 12:57:59,326 INFO L913 BasicCegarLoop]: 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-07 12:57:59,326 INFO L914 BasicCegarLoop]: 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-07 12:57:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-07 12:57:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-07 12:57:59,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:59,415 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-07 12:57:59,419 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-07 12:57:59,420 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-07 12:57:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:59,423 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-07 12:57:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:57:59,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:59,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:59,423 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-07 12:57:59,424 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-07 12:57:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:59,426 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-07 12:57:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:57:59,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:59,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:59,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:59,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:59,427 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-07 12:57:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-07 12:57:59,430 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [2022-04-07 12:57:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:59,430 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-07 12:57:59,430 INFO L479 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-07 12:57:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:57:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-07 12:57:59,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:59,433 INFO L499 BasicCegarLoop]: 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-07 12:57:59,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:59,656 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-07 12:57:59,656 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:59,657 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-04-07 12:57:59,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:59,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120752499] [2022-04-07 12:57:59,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:59,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:59,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:59,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747042249] [2022-04-07 12:57:59,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:59,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:59,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:59,674 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:57:59,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-07 12:57:59,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:59,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:59,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 12:57:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:59,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:00,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {9650#true} call ULTIMATE.init(); {9650#true} is VALID [2022-04-07 12:58:00,538 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-07 12:58:00,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9650#true} {9650#true} #81#return; {9650#true} is VALID [2022-04-07 12:58:00,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {9650#true} call #t~ret6 := main(); {9650#true} is VALID [2022-04-07 12:58:00,539 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-07 12:58:00,539 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-07 12:58:00,540 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-07 12:58:00,540 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-07 12:58:00,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,540 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-07 12:58:00,540 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-07 12:58:00,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,541 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-07 12:58:00,541 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-07 12:58:00,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,542 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-07 12:58:00,542 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-07 12:58:00,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,542 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-07 12:58:00,543 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-07 12:58:00,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,543 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-07 12:58:00,544 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-07 12:58:00,544 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-07 12:58:00,544 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-07 12:58:00,545 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-07 12:58:00,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,545 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-07 12:58:00,545 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-07 12:58:00,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,546 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-07 12:58:00,546 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-07 12:58:00,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,547 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-07 12:58:00,547 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-07 12:58:00,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,547 INFO L290 TraceCheckUtils]: 54: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,547 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-07 12:58:00,547 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-07 12:58:00,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,548 INFO L290 TraceCheckUtils]: 58: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,548 INFO L290 TraceCheckUtils]: 59: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,548 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-07 12:58:00,549 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-07 12:58:00,549 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-07 12:58:00,549 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-07 12:58:00,549 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-07 12:58:00,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,550 INFO L290 TraceCheckUtils]: 67: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,550 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-07 12:58:00,550 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-07 12:58:00,550 INFO L290 TraceCheckUtils]: 70: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,550 INFO L290 TraceCheckUtils]: 71: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,550 INFO L290 TraceCheckUtils]: 72: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,551 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-07 12:58:00,551 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-07 12:58:00,551 INFO L290 TraceCheckUtils]: 75: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,551 INFO L290 TraceCheckUtils]: 76: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,551 INFO L290 TraceCheckUtils]: 77: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,552 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-07 12:58:00,552 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-07 12:58:00,552 INFO L290 TraceCheckUtils]: 80: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,552 INFO L290 TraceCheckUtils]: 81: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,552 INFO L290 TraceCheckUtils]: 82: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,552 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-07 12:58:00,552 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-07 12:58:00,552 INFO L290 TraceCheckUtils]: 85: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,552 INFO L290 TraceCheckUtils]: 86: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,553 INFO L290 TraceCheckUtils]: 87: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,553 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-07 12:58:00,553 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-07 12:58:00,554 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-07 12:58:00,554 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-07 12:58:00,554 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-07 12:58:00,554 INFO L290 TraceCheckUtils]: 93: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,554 INFO L290 TraceCheckUtils]: 94: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,554 INFO L290 TraceCheckUtils]: 95: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,555 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-07 12:58:00,555 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-07 12:58:00,555 INFO L290 TraceCheckUtils]: 98: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,555 INFO L290 TraceCheckUtils]: 99: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,555 INFO L290 TraceCheckUtils]: 100: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,556 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-07 12:58:00,556 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-07 12:58:00,556 INFO L290 TraceCheckUtils]: 103: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,556 INFO L290 TraceCheckUtils]: 104: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,556 INFO L290 TraceCheckUtils]: 105: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,557 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-07 12:58:00,557 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-07 12:58:00,557 INFO L290 TraceCheckUtils]: 108: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,557 INFO L290 TraceCheckUtils]: 109: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,557 INFO L290 TraceCheckUtils]: 110: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,558 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-07 12:58:00,558 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-07 12:58:00,558 INFO L290 TraceCheckUtils]: 113: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,558 INFO L290 TraceCheckUtils]: 114: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,558 INFO L290 TraceCheckUtils]: 115: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,558 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-07 12:58:00,559 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-07 12:58:00,559 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-07 12:58:00,559 INFO L290 TraceCheckUtils]: 119: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:58:00,559 INFO L290 TraceCheckUtils]: 120: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:58:00,559 INFO L290 TraceCheckUtils]: 121: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:58:00,560 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-07 12:58:00,560 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-07 12:58:00,561 INFO L290 TraceCheckUtils]: 124: Hoare triple {10029#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10033#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:00,561 INFO L290 TraceCheckUtils]: 125: Hoare triple {10033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9651#false} is VALID [2022-04-07 12:58:00,561 INFO L290 TraceCheckUtils]: 126: Hoare triple {9651#false} assume !false; {9651#false} is VALID [2022-04-07 12:58:00,561 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-07 12:58:00,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:00,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120752499] [2022-04-07 12:58:00,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:00,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747042249] [2022-04-07 12:58:00,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747042249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:58:00,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:58:00,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 12:58:00,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144154242] [2022-04-07 12:58:00,920 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:00,920 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-07 12:58:00,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:00,921 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-07 12:58:00,984 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-07 12:58:00,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:58:00,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:00,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:58:00,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:58:00,985 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-07 12:58:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:02,203 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-07 12:58:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:58:02,203 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-07 12:58:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:02,204 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-07 12:58:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:58:02,206 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-07 12:58:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:58:02,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-07 12:58:02,325 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-07 12:58:02,328 INFO L225 Difference]: With dead ends: 152 [2022-04-07 12:58:02,328 INFO L226 Difference]: Without dead ends: 150 [2022-04-07 12:58:02,328 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:58:02,329 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:02,329 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-07 12:58:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-07 12:58:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-07 12:58:02,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:02,448 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-07 12:58:02,449 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-07 12:58:02,449 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-07 12:58:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:02,452 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-07 12:58:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-07 12:58:02,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:02,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:02,453 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-07 12:58:02,453 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-07 12:58:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:02,457 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-07 12:58:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-07 12:58:02,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:02,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:02,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:02,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:02,458 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-07 12:58:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-07 12:58:02,461 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-07 12:58:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:02,462 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-07 12:58:02,462 INFO L479 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-07 12:58:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-07 12:58:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-07 12:58:02,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:02,464 INFO L499 BasicCegarLoop]: 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-07 12:58:02,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-07 12:58:02,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-07 12:58:02,687 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-04-07 12:58:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:02,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510646368] [2022-04-07 12:58:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:02,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:02,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:02,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909594587] [2022-04-07 12:58:02,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:58:02,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:02,700 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:02,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-07 12:58:02,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:58:02,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:02,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:58:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:02,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:03,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-07 12:58:03,238 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-07 12:58:03,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {10899#(<= ~counter~0 0)} assume true; {10899#(<= ~counter~0 0)} is VALID [2022-04-07 12:58:03,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10899#(<= ~counter~0 0)} {10891#true} #81#return; {10899#(<= ~counter~0 0)} is VALID [2022-04-07 12:58:03,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {10899#(<= ~counter~0 0)} call #t~ret6 := main(); {10899#(<= ~counter~0 0)} is VALID [2022-04-07 12:58:03,240 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-07 12:58:03,240 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-07 12:58:03,241 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-07 12:58:03,242 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-07 12:58:03,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,243 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #59#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,244 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-07 12:58:03,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,245 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #61#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,246 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-07 12:58:03,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,247 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #63#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,247 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-07 12:58:03,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,249 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #65#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,249 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-07 12:58:03,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,250 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10915#(<= ~counter~0 1)} {10915#(<= ~counter~0 1)} #67#return; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:58:03,251 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-07 12:58:03,251 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-07 12:58:03,251 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-07 12:58:03,252 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-07 12:58:03,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,253 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #59#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,253 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-07 12:58:03,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,255 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #61#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,255 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-07 12:58:03,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,256 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #63#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,257 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-07 12:58:03,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,258 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #65#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,258 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-07 12:58:03,259 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,259 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,260 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11000#(<= ~counter~0 2)} {11000#(<= ~counter~0 2)} #67#return; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:58:03,260 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-07 12:58:03,260 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-07 12:58:03,261 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-07 12:58:03,261 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-07 12:58:03,261 INFO L290 TraceCheckUtils]: 65: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,261 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,262 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #59#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,263 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-07 12:58:03,263 INFO L290 TraceCheckUtils]: 70: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,263 INFO L290 TraceCheckUtils]: 71: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,263 INFO L290 TraceCheckUtils]: 72: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,264 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #61#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,264 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-07 12:58:03,264 INFO L290 TraceCheckUtils]: 75: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,265 INFO L290 TraceCheckUtils]: 77: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,265 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #63#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,266 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-07 12:58:03,266 INFO L290 TraceCheckUtils]: 80: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,266 INFO L290 TraceCheckUtils]: 81: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,267 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #65#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,268 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-07 12:58:03,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,268 INFO L290 TraceCheckUtils]: 87: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,269 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {11085#(<= ~counter~0 3)} {11085#(<= ~counter~0 3)} #67#return; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:58:03,269 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-07 12:58:03,270 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-07 12:58:03,270 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-07 12:58:03,270 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-07 12:58:03,270 INFO L290 TraceCheckUtils]: 93: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,271 INFO L290 TraceCheckUtils]: 94: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,271 INFO L290 TraceCheckUtils]: 95: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,271 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #59#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,272 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-07 12:58:03,272 INFO L290 TraceCheckUtils]: 98: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,272 INFO L290 TraceCheckUtils]: 99: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,273 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #61#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,273 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-07 12:58:03,274 INFO L290 TraceCheckUtils]: 103: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,274 INFO L290 TraceCheckUtils]: 104: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,274 INFO L290 TraceCheckUtils]: 105: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,275 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #63#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,275 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-07 12:58:03,275 INFO L290 TraceCheckUtils]: 108: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,276 INFO L290 TraceCheckUtils]: 109: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,276 INFO L290 TraceCheckUtils]: 110: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,276 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #65#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,277 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-07 12:58:03,277 INFO L290 TraceCheckUtils]: 113: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,277 INFO L290 TraceCheckUtils]: 114: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,278 INFO L290 TraceCheckUtils]: 115: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,278 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {11170#(<= ~counter~0 4)} {11170#(<= ~counter~0 4)} #67#return; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:58:03,278 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-07 12:58:03,279 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-07 12:58:03,279 INFO L290 TraceCheckUtils]: 119: Hoare triple {11255#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {10892#false} is VALID [2022-04-07 12:58:03,279 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-07 12:58:03,279 INFO L290 TraceCheckUtils]: 121: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-07 12:58:03,279 INFO L290 TraceCheckUtils]: 122: Hoare triple {10892#false} assume !(0 == ~cond); {10892#false} is VALID [2022-04-07 12:58:03,279 INFO L290 TraceCheckUtils]: 123: Hoare triple {10892#false} assume true; {10892#false} is VALID [2022-04-07 12:58:03,279 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10892#false} {10892#false} #69#return; {10892#false} is VALID [2022-04-07 12:58:03,279 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-07 12:58:03,279 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-07 12:58:03,279 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-07 12:58:03,279 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-07 12:58:03,280 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-07 12:58:03,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:03,789 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-07 12:58:03,789 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-07 12:58:03,789 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-07 12:58:03,789 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-07 12:58:03,789 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10891#true} {10892#false} #69#return; {10892#false} is VALID [2022-04-07 12:58:03,790 INFO L290 TraceCheckUtils]: 123: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,790 INFO L290 TraceCheckUtils]: 122: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,790 INFO L290 TraceCheckUtils]: 121: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,790 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-07 12:58:03,791 INFO L290 TraceCheckUtils]: 119: Hoare triple {11313#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {10892#false} is VALID [2022-04-07 12:58:03,792 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-07 12:58:03,792 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-07 12:58:03,792 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #67#return; {11317#(< ~counter~0 50)} is VALID [2022-04-07 12:58:03,792 INFO L290 TraceCheckUtils]: 115: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,792 INFO L290 TraceCheckUtils]: 114: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,793 INFO L290 TraceCheckUtils]: 113: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,793 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-07 12:58:03,793 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #65#return; {11317#(< ~counter~0 50)} is VALID [2022-04-07 12:58:03,793 INFO L290 TraceCheckUtils]: 110: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,793 INFO L290 TraceCheckUtils]: 109: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,793 INFO L290 TraceCheckUtils]: 108: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,793 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-07 12:58:03,794 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #63#return; {11317#(< ~counter~0 50)} is VALID [2022-04-07 12:58:03,794 INFO L290 TraceCheckUtils]: 105: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,794 INFO L290 TraceCheckUtils]: 104: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,794 INFO L290 TraceCheckUtils]: 103: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,794 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-07 12:58:03,794 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #61#return; {11317#(< ~counter~0 50)} is VALID [2022-04-07 12:58:03,794 INFO L290 TraceCheckUtils]: 100: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,795 INFO L290 TraceCheckUtils]: 99: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,795 INFO L290 TraceCheckUtils]: 98: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,795 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-07 12:58:03,795 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10891#true} {11317#(< ~counter~0 50)} #59#return; {11317#(< ~counter~0 50)} is VALID [2022-04-07 12:58:03,795 INFO L290 TraceCheckUtils]: 95: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,795 INFO L290 TraceCheckUtils]: 94: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,795 INFO L290 TraceCheckUtils]: 93: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,795 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-07 12:58:03,801 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-07 12:58:03,802 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-07 12:58:03,802 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-07 12:58:03,803 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #67#return; {11402#(< ~counter~0 49)} is VALID [2022-04-07 12:58:03,803 INFO L290 TraceCheckUtils]: 87: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,803 INFO L290 TraceCheckUtils]: 86: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,803 INFO L290 TraceCheckUtils]: 85: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,803 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-07 12:58:03,803 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #65#return; {11402#(< ~counter~0 49)} is VALID [2022-04-07 12:58:03,803 INFO L290 TraceCheckUtils]: 82: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,804 INFO L290 TraceCheckUtils]: 81: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,804 INFO L290 TraceCheckUtils]: 80: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,804 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-07 12:58:03,804 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #63#return; {11402#(< ~counter~0 49)} is VALID [2022-04-07 12:58:03,804 INFO L290 TraceCheckUtils]: 77: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,804 INFO L290 TraceCheckUtils]: 76: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,804 INFO L290 TraceCheckUtils]: 75: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,804 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-07 12:58:03,805 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #61#return; {11402#(< ~counter~0 49)} is VALID [2022-04-07 12:58:03,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,805 INFO L290 TraceCheckUtils]: 71: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,805 INFO L290 TraceCheckUtils]: 70: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,805 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-07 12:58:03,805 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10891#true} {11402#(< ~counter~0 49)} #59#return; {11402#(< ~counter~0 49)} is VALID [2022-04-07 12:58:03,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,806 INFO L290 TraceCheckUtils]: 66: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,806 INFO L290 TraceCheckUtils]: 65: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,806 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-07 12:58:03,806 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-07 12:58:03,806 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-07 12:58:03,807 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-07 12:58:03,807 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #67#return; {11487#(< ~counter~0 48)} is VALID [2022-04-07 12:58:03,807 INFO L290 TraceCheckUtils]: 59: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,807 INFO L290 TraceCheckUtils]: 58: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,807 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-07 12:58:03,809 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #65#return; {11487#(< ~counter~0 48)} is VALID [2022-04-07 12:58:03,809 INFO L290 TraceCheckUtils]: 54: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,809 INFO L290 TraceCheckUtils]: 53: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,809 INFO L290 TraceCheckUtils]: 52: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,809 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-07 12:58:03,811 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #63#return; {11487#(< ~counter~0 48)} is VALID [2022-04-07 12:58:03,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,812 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-07 12:58:03,812 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #61#return; {11487#(< ~counter~0 48)} is VALID [2022-04-07 12:58:03,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,813 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-07 12:58:03,813 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10891#true} {11487#(< ~counter~0 48)} #59#return; {11487#(< ~counter~0 48)} is VALID [2022-04-07 12:58:03,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,814 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-07 12:58:03,814 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-07 12:58:03,815 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-07 12:58:03,815 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-07 12:58:03,816 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #67#return; {11572#(< ~counter~0 47)} is VALID [2022-04-07 12:58:03,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,816 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-07 12:58:03,817 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #65#return; {11572#(< ~counter~0 47)} is VALID [2022-04-07 12:58:03,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,817 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-07 12:58:03,818 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #63#return; {11572#(< ~counter~0 47)} is VALID [2022-04-07 12:58:03,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,818 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-07 12:58:03,819 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #61#return; {11572#(< ~counter~0 47)} is VALID [2022-04-07 12:58:03,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,819 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-07 12:58:03,820 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10891#true} {11572#(< ~counter~0 47)} #59#return; {11572#(< ~counter~0 47)} is VALID [2022-04-07 12:58:03,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:58:03,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:58:03,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:58:03,820 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-07 12:58:03,820 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-07 12:58:03,821 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-07 12:58:03,821 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-07 12:58:03,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {11657#(< ~counter~0 46)} call #t~ret6 := main(); {11657#(< ~counter~0 46)} is VALID [2022-04-07 12:58:03,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11657#(< ~counter~0 46)} {10891#true} #81#return; {11657#(< ~counter~0 46)} is VALID [2022-04-07 12:58:03,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {11657#(< ~counter~0 46)} assume true; {11657#(< ~counter~0 46)} is VALID [2022-04-07 12:58:03,823 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-07 12:58:03,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-07 12:58:03,824 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-07 12:58:03,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:03,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510646368] [2022-04-07 12:58:03,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:03,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909594587] [2022-04-07 12:58:03,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909594587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:58:03,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:58:03,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 12:58:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186634908] [2022-04-07 12:58:03,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:03,825 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-07 12:58:03,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:03,826 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-07 12:58:03,945 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-07 12:58:03,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 12:58:03,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:03,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 12:58:03,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:58:03,946 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-07 12:58:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:06,025 INFO L93 Difference]: Finished difference Result 368 states and 388 transitions. [2022-04-07 12:58:06,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 12:58:06,025 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-07 12:58:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:06,026 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-07 12:58:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-07 12:58:06,030 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-07 12:58:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-07 12:58:06,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 241 transitions. [2022-04-07 12:58:06,245 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-07 12:58:06,253 INFO L225 Difference]: With dead ends: 368 [2022-04-07 12:58:06,253 INFO L226 Difference]: Without dead ends: 353 [2022-04-07 12:58:06,254 INFO L912 BasicCegarLoop]: 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-07 12:58:06,254 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 149 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:06,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 267 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 12:58:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-07 12:58:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-04-07 12:58:06,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:06,433 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-07 12:58:06,434 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-07 12:58:06,435 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-07 12:58:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:06,443 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-07 12:58:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-07 12:58:06,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:06,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:06,444 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-07 12:58:06,445 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-07 12:58:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:06,453 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-07 12:58:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-07 12:58:06,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:06,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:06,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:06,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:06,456 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-07 12:58:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-04-07 12:58:06,464 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-04-07 12:58:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:06,465 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-04-07 12:58:06,465 INFO L479 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-07 12:58:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-04-07 12:58:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 12:58:06,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:06,466 INFO L499 BasicCegarLoop]: 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-07 12:58:06,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-07 12:58:06,689 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-07 12:58:06,689 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:06,690 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-07 12:58:06,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:06,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804601780] [2022-04-07 12:58:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:06,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:06,706 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:06,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857928763] [2022-04-07 12:58:06,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:58:06,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:06,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:06,707 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:06,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-07 12:58:07,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 12:58:07,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:07,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:58:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:07,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:07,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {13359#true} call ULTIMATE.init(); {13359#true} is VALID [2022-04-07 12:58:07,852 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-07 12:58:07,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13359#true} {13359#true} #81#return; {13359#true} is VALID [2022-04-07 12:58:07,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {13359#true} call #t~ret6 := main(); {13359#true} is VALID [2022-04-07 12:58:07,853 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-07 12:58:07,853 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-07 12:58:07,854 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-07 12:58:07,854 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-07 12:58:07,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,854 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-07 12:58:07,854 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-07 12:58:07,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,855 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-07 12:58:07,855 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-07 12:58:07,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,856 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-07 12:58:07,856 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-07 12:58:07,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,856 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-07 12:58:07,856 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-07 12:58:07,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,859 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-07 12:58:07,860 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-07 12:58:07,860 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-07 12:58:07,861 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-07 12:58:07,861 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-07 12:58:07,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,862 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-07 12:58:07,862 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-07 12:58:07,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,863 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-07 12:58:07,863 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-07 12:58:07,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,864 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-07 12:58:07,864 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-07 12:58:07,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,864 INFO L290 TraceCheckUtils]: 54: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,865 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-07 12:58:07,865 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-07 12:58:07,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,865 INFO L290 TraceCheckUtils]: 59: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,865 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-07 12:58:07,866 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-07 12:58:07,867 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-07 12:58:07,867 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-07 12:58:07,867 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-07 12:58:07,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,868 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-07 12:58:07,868 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-07 12:58:07,868 INFO L290 TraceCheckUtils]: 70: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,868 INFO L290 TraceCheckUtils]: 71: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,868 INFO L290 TraceCheckUtils]: 72: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,869 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-07 12:58:07,869 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-07 12:58:07,869 INFO L290 TraceCheckUtils]: 75: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,869 INFO L290 TraceCheckUtils]: 76: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,869 INFO L290 TraceCheckUtils]: 77: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,870 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-07 12:58:07,870 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-07 12:58:07,870 INFO L290 TraceCheckUtils]: 80: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,870 INFO L290 TraceCheckUtils]: 81: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,870 INFO L290 TraceCheckUtils]: 82: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,871 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-07 12:58:07,871 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-07 12:58:07,871 INFO L290 TraceCheckUtils]: 85: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,871 INFO L290 TraceCheckUtils]: 86: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,871 INFO L290 TraceCheckUtils]: 87: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,871 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-07 12:58:07,872 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-07 12:58:07,872 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-07 12:58:07,873 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-07 12:58:07,873 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-07 12:58:07,873 INFO L290 TraceCheckUtils]: 93: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,873 INFO L290 TraceCheckUtils]: 94: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,873 INFO L290 TraceCheckUtils]: 95: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,874 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-07 12:58:07,874 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-07 12:58:07,874 INFO L290 TraceCheckUtils]: 98: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,874 INFO L290 TraceCheckUtils]: 99: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,874 INFO L290 TraceCheckUtils]: 100: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,875 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-07 12:58:07,875 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-07 12:58:07,875 INFO L290 TraceCheckUtils]: 103: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,875 INFO L290 TraceCheckUtils]: 104: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,875 INFO L290 TraceCheckUtils]: 105: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,876 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-07 12:58:07,876 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-07 12:58:07,876 INFO L290 TraceCheckUtils]: 108: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,876 INFO L290 TraceCheckUtils]: 109: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,876 INFO L290 TraceCheckUtils]: 110: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,877 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-07 12:58:07,877 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-07 12:58:07,877 INFO L290 TraceCheckUtils]: 113: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,877 INFO L290 TraceCheckUtils]: 114: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,877 INFO L290 TraceCheckUtils]: 115: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,878 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-07 12:58:07,878 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-07 12:58:07,878 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-07 12:58:07,878 INFO L290 TraceCheckUtils]: 119: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,878 INFO L290 TraceCheckUtils]: 120: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,878 INFO L290 TraceCheckUtils]: 121: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,879 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-07 12:58:07,879 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-07 12:58:07,879 INFO L290 TraceCheckUtils]: 124: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:58:07,879 INFO L290 TraceCheckUtils]: 125: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:58:07,879 INFO L290 TraceCheckUtils]: 126: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:58:07,880 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-07 12:58:07,881 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-07 12:58:07,881 INFO L290 TraceCheckUtils]: 129: Hoare triple {13753#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13757#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:07,881 INFO L290 TraceCheckUtils]: 130: Hoare triple {13757#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13360#false} is VALID [2022-04-07 12:58:07,881 INFO L290 TraceCheckUtils]: 131: Hoare triple {13360#false} assume !false; {13360#false} is VALID [2022-04-07 12:58:07,882 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-07 12:58:07,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:11,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:11,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804601780] [2022-04-07 12:58:11,779 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:11,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857928763] [2022-04-07 12:58:11,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857928763] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:58:11,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:58:11,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 12:58:11,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962171038] [2022-04-07 12:58:11,780 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:11,780 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-07 12:58:11,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:11,781 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-07 12:58:11,853 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-07 12:58:11,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:58:11,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:11,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:58:11,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:58:11,854 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-07 12:58:13,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:13,019 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2022-04-07 12:58:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:58:13,019 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-07 12:58:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:13,020 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-07 12:58:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:58:13,021 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-07 12:58:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:58:13,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-07 12:58:13,137 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-07 12:58:13,144 INFO L225 Difference]: With dead ends: 313 [2022-04-07 12:58:13,144 INFO L226 Difference]: Without dead ends: 302 [2022-04-07 12:58:13,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:58:13,145 INFO L913 BasicCegarLoop]: 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-07 12:58:13,145 INFO L914 BasicCegarLoop]: 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-07 12:58:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-07 12:58:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-04-07 12:58:13,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:13,339 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-07 12:58:13,340 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-07 12:58:13,340 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-07 12:58:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:13,347 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-07 12:58:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-07 12:58:13,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:13,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:13,348 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-07 12:58:13,349 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-07 12:58:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:13,358 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-07 12:58:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-07 12:58:13,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:13,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:13,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:13,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:13,359 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-07 12:58:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-04-07 12:58:13,368 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-04-07 12:58:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:13,368 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-04-07 12:58:13,368 INFO L479 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-07 12:58:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-07 12:58:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-07 12:58:13,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:13,370 INFO L499 BasicCegarLoop]: 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-07 12:58:13,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-07 12:58:13,574 WARN L460 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-07 12:58:13,575 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-04-07 12:58:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:13,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336349153] [2022-04-07 12:58:13,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:13,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:13,597 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:13,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830834761] [2022-04-07 12:58:13,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:58:13,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:13,598 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:13,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-07 12:58:14,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-07 12:58:14,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:14,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:58:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:14,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:58:14,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-07 12:58:14,936 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-07 12:58:14,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #81#return; {15374#true} is VALID [2022-04-07 12:58:14,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret6 := main(); {15374#true} is VALID [2022-04-07 12:58:14,937 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-07 12:58:14,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-07 12:58:14,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:58:14,937 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-07 12:58:14,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,937 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:58:14,937 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-07 12:58:14,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,937 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:58:14,937 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-07 12:58:14,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,938 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:58:14,938 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-07 12:58:14,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,938 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:58:14,938 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-07 12:58:14,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,938 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:58:14,938 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-07 12:58:14,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-07 12:58:14,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:58:14,938 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-07 12:58:14,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,939 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:58:14,939 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-07 12:58:14,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,939 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:58:14,939 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-07 12:58:14,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,939 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:58:14,939 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-07 12:58:14,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,940 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:58:14,940 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-07 12:58:14,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,940 INFO L290 TraceCheckUtils]: 59: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,940 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:58:14,940 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-07 12:58:14,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-07 12:58:14,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:58:14,940 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-07 12:58:14,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L290 TraceCheckUtils]: 66: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L290 TraceCheckUtils]: 67: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:58:14,941 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-07 12:58:14,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:58:14,941 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-07 12:58:14,941 INFO L290 TraceCheckUtils]: 75: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L290 TraceCheckUtils]: 76: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L290 TraceCheckUtils]: 77: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:58:14,941 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-07 12:58:14,941 INFO L290 TraceCheckUtils]: 80: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,941 INFO L290 TraceCheckUtils]: 81: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,942 INFO L290 TraceCheckUtils]: 82: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,942 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:58:14,942 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-07 12:58:14,942 INFO L290 TraceCheckUtils]: 85: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,942 INFO L290 TraceCheckUtils]: 86: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,942 INFO L290 TraceCheckUtils]: 87: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,942 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:58:14,942 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-07 12:58:14,942 INFO L290 TraceCheckUtils]: 90: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-07 12:58:14,942 INFO L290 TraceCheckUtils]: 91: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:58:14,942 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-07 12:58:14,942 INFO L290 TraceCheckUtils]: 93: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,942 INFO L290 TraceCheckUtils]: 94: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,942 INFO L290 TraceCheckUtils]: 95: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,942 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:58:14,942 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-07 12:58:14,942 INFO L290 TraceCheckUtils]: 98: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L290 TraceCheckUtils]: 99: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L290 TraceCheckUtils]: 100: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:58:14,943 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-07 12:58:14,943 INFO L290 TraceCheckUtils]: 103: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L290 TraceCheckUtils]: 104: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L290 TraceCheckUtils]: 105: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:58:14,943 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-07 12:58:14,943 INFO L290 TraceCheckUtils]: 108: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L290 TraceCheckUtils]: 109: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L290 TraceCheckUtils]: 110: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:58:14,943 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-07 12:58:14,943 INFO L290 TraceCheckUtils]: 113: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,943 INFO L290 TraceCheckUtils]: 114: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,944 INFO L290 TraceCheckUtils]: 115: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,944 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:58:14,945 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-07 12:58:14,945 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-07 12:58:14,945 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-07 12:58:14,945 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-07 12:58:14,945 INFO L290 TraceCheckUtils]: 121: Hoare triple {15374#true} ~cond := #in~cond; {15743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:14,946 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-07 12:58:14,946 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-07 12:58:14,947 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-07 12:58:14,947 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-07 12:58:14,947 INFO L290 TraceCheckUtils]: 126: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,947 INFO L290 TraceCheckUtils]: 127: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,947 INFO L290 TraceCheckUtils]: 128: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,947 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-07 12:58:14,947 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-07 12:58:14,948 INFO L290 TraceCheckUtils]: 131: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,948 INFO L290 TraceCheckUtils]: 132: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,948 INFO L290 TraceCheckUtils]: 133: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,948 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-07 12:58:14,948 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-07 12:58:14,948 INFO L290 TraceCheckUtils]: 136: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,948 INFO L290 TraceCheckUtils]: 137: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,948 INFO L290 TraceCheckUtils]: 138: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,949 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-07 12:58:14,949 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-07 12:58:14,949 INFO L290 TraceCheckUtils]: 141: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,949 INFO L290 TraceCheckUtils]: 142: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,949 INFO L290 TraceCheckUtils]: 143: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,950 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-07 12:58:14,950 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-07 12:58:14,951 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-07 12:58:14,951 INFO L290 TraceCheckUtils]: 147: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:14,951 INFO L290 TraceCheckUtils]: 148: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:14,951 INFO L290 TraceCheckUtils]: 149: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:14,951 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-07 12:58:15,365 INFO 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 VALID [2022-04-07 12:58:15,366 INFO L290 TraceCheckUtils]: 152: Hoare triple {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15841#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:15,366 INFO L290 TraceCheckUtils]: 153: Hoare triple {15841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15375#false} is VALID [2022-04-07 12:58:15,366 INFO L290 TraceCheckUtils]: 154: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-07 12:58:15,367 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-07 12:58:15,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:58:16,648 INFO L290 TraceCheckUtils]: 154: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-07 12:58:16,648 INFO L290 TraceCheckUtils]: 153: Hoare triple {15841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15375#false} is VALID [2022-04-07 12:58:16,648 INFO L290 TraceCheckUtils]: 152: Hoare triple {15837#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15841#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:58:18,651 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-07 12:58:18,667 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-07 12:58:18,667 INFO L290 TraceCheckUtils]: 149: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,667 INFO L290 TraceCheckUtils]: 148: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,668 INFO L290 TraceCheckUtils]: 147: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,668 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-07 12:58:18,669 INFO L290 TraceCheckUtils]: 145: Hoare triple {15875#(or (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)) (<= main_~n~0 main_~a~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-07 12:58:18,670 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {15374#true} {15875#(or (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)) (<= main_~n~0 main_~a~0))} #67#return; {15875#(or (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)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:18,670 INFO L290 TraceCheckUtils]: 143: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,670 INFO L290 TraceCheckUtils]: 142: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,670 INFO L290 TraceCheckUtils]: 141: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,670 INFO L272 TraceCheckUtils]: 140: Hoare triple {15875#(or (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)) (<= 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)); {15374#true} is VALID [2022-04-07 12:58:18,671 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {15374#true} {15875#(or (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)) (<= main_~n~0 main_~a~0))} #65#return; {15875#(or (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)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:18,671 INFO L290 TraceCheckUtils]: 138: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,671 INFO L290 TraceCheckUtils]: 137: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,671 INFO L290 TraceCheckUtils]: 136: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,671 INFO L272 TraceCheckUtils]: 135: Hoare triple {15875#(or (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)) (<= 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)); {15374#true} is VALID [2022-04-07 12:58:18,671 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {15374#true} {15875#(or (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)) (<= main_~n~0 main_~a~0))} #63#return; {15875#(or (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)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:18,672 INFO L290 TraceCheckUtils]: 133: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,672 INFO L290 TraceCheckUtils]: 132: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,672 INFO L290 TraceCheckUtils]: 131: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,672 INFO L272 TraceCheckUtils]: 130: Hoare triple {15875#(or (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)) (<= main_~n~0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-07 12:58:18,672 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {15374#true} {15875#(or (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)) (<= main_~n~0 main_~a~0))} #61#return; {15875#(or (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)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:18,673 INFO L290 TraceCheckUtils]: 128: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,673 INFO L290 TraceCheckUtils]: 127: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,673 INFO L290 TraceCheckUtils]: 126: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,673 INFO L272 TraceCheckUtils]: 125: Hoare triple {15875#(or (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)) (<= 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)); {15374#true} is VALID [2022-04-07 12:58:18,682 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #59#return; {15875#(or (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)) (<= main_~n~0 main_~a~0))} is VALID [2022-04-07 12:58:18,683 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-07 12:58:18,683 INFO L290 TraceCheckUtils]: 122: Hoare triple {15949#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:58:18,683 INFO L290 TraceCheckUtils]: 121: Hoare triple {15374#true} ~cond := #in~cond; {15949#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:58:18,690 INFO L272 TraceCheckUtils]: 120: Hoare triple {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {15374#true} is VALID [2022-04-07 12:58:18,696 INFO L290 TraceCheckUtils]: 119: Hoare triple {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} assume !!(#t~post5 < 50);havoc #t~post5; {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-07 12:58:18,697 INFO L290 TraceCheckUtils]: 118: Hoare triple {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-07 12:58:18,698 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; {15939#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)))} is VALID [2022-04-07 12:58:18,698 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:58:18,698 INFO L290 TraceCheckUtils]: 115: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,698 INFO L290 TraceCheckUtils]: 114: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,698 INFO L290 TraceCheckUtils]: 113: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,699 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-07 12:58:18,699 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:58:18,699 INFO L290 TraceCheckUtils]: 110: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,699 INFO L290 TraceCheckUtils]: 109: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,699 INFO L290 TraceCheckUtils]: 108: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,699 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-07 12:58:18,699 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:58:18,699 INFO L290 TraceCheckUtils]: 105: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,699 INFO L290 TraceCheckUtils]: 104: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,699 INFO L290 TraceCheckUtils]: 103: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,699 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-07 12:58:18,699 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:58:18,700 INFO L290 TraceCheckUtils]: 100: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,700 INFO L290 TraceCheckUtils]: 99: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,700 INFO L290 TraceCheckUtils]: 98: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,700 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-07 12:58:18,700 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:58:18,700 INFO L290 TraceCheckUtils]: 95: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,700 INFO L290 TraceCheckUtils]: 94: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,700 INFO L290 TraceCheckUtils]: 93: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,700 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-07 12:58:18,700 INFO L290 TraceCheckUtils]: 91: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:58:18,700 INFO L290 TraceCheckUtils]: 90: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-07 12:58:18,700 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-07 12:58:18,700 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:58:18,701 INFO L290 TraceCheckUtils]: 87: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,701 INFO L290 TraceCheckUtils]: 86: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,701 INFO L290 TraceCheckUtils]: 85: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,701 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-07 12:58:18,701 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:58:18,701 INFO L290 TraceCheckUtils]: 82: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,701 INFO L290 TraceCheckUtils]: 80: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,701 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-07 12:58:18,701 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:58:18,701 INFO L290 TraceCheckUtils]: 77: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,701 INFO L290 TraceCheckUtils]: 76: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,701 INFO L290 TraceCheckUtils]: 75: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,702 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-07 12:58:18,702 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:58:18,702 INFO L290 TraceCheckUtils]: 72: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,702 INFO L290 TraceCheckUtils]: 71: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,702 INFO L290 TraceCheckUtils]: 70: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,702 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-07 12:58:18,702 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:58:18,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,702 INFO L290 TraceCheckUtils]: 66: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,702 INFO L290 TraceCheckUtils]: 65: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,702 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-07 12:58:18,702 INFO L290 TraceCheckUtils]: 63: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:58:18,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-07 12:58:18,703 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-07 12:58:18,703 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:58:18,703 INFO L290 TraceCheckUtils]: 59: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,703 INFO L290 TraceCheckUtils]: 58: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,703 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-07 12:58:18,703 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:58:18,703 INFO L290 TraceCheckUtils]: 54: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,703 INFO L290 TraceCheckUtils]: 53: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,703 INFO L290 TraceCheckUtils]: 52: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,703 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-07 12:58:18,703 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:58:18,703 INFO L290 TraceCheckUtils]: 49: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,704 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-07 12:58:18,704 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:58:18,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,704 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-07 12:58:18,704 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:58:18,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,704 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-07 12:58:18,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:58:18,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-07 12:58:18,705 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-07 12:58:18,705 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:58:18,705 INFO L290 TraceCheckUtils]: 31: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,705 INFO L290 TraceCheckUtils]: 30: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,705 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-07 12:58:18,705 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:58:18,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,705 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-07 12:58:18,706 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:58:18,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,706 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-07 12:58:18,706 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:58:18,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,706 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-07 12:58:18,706 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:58:18,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:58:18,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:58:18,707 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-07 12:58:18,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {15374#true} assume !!(#t~post5 < 50);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:58:18,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {15374#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15374#true} is VALID [2022-04-07 12:58:18,707 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-07 12:58:18,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret6 := main(); {15374#true} is VALID [2022-04-07 12:58:18,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #81#return; {15374#true} is VALID [2022-04-07 12:58:18,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:58:18,721 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-07 12:58:18,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-07 12:58:18,721 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-07 12:58:18,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:58:18,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336349153] [2022-04-07 12:58:18,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:58:18,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830834761] [2022-04-07 12:58:18,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830834761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:58:18,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:58:18,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-04-07 12:58:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049199376] [2022-04-07 12:58:18,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:58:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-07 12:58:18,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:58:18,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:20,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:20,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 12:58:20,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:58:20,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 12:58:20,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:58:20,793 INFO L87 Difference]: Start difference. First operand 302 states and 315 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:26,034 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-07 12:58:28,039 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-07 12:58:33,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:58:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:33,460 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-07 12:58:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:58:33,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) Word has length 155 [2022-04-07 12:58:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:58:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-07 12:58:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-07 12:58:33,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-07 12:58:33,988 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-07 12:58:33,995 INFO L225 Difference]: With dead ends: 311 [2022-04-07 12:58:33,996 INFO L226 Difference]: Without dead ends: 309 [2022-04-07 12:58:33,996 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:58:33,996 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:33,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 113 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-04-07 12:58:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-07 12:58:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-04-07 12:58:34,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:34,230 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-07 12:58:34,231 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-07 12:58:34,231 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-07 12:58:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:34,238 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-07 12:58:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-07 12:58:34,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:34,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:34,239 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-07 12:58:34,240 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-07 12:58:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:34,246 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-07 12:58:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-07 12:58:34,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:34,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:34,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:34,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:34,247 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-07 12:58:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-04-07 12:58:34,255 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-04-07 12:58:34,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:34,255 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-04-07 12:58:34,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-07 12:58:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-04-07 12:58:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-07 12:58:34,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:34,257 INFO L499 BasicCegarLoop]: 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-07 12:58:34,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-07 12:58:34,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-07 12:58:34,462 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2056924759, now seen corresponding path program 4 times [2022-04-07 12:58:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357363268] [2022-04-07 12:58:34,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:34,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:34,477 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:34,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827469715] [2022-04-07 12:58:34,477 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:58:34,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:34,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:34,479 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:58:34,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-07 12:58:36,343 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:58:36,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:36,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-07 12:58:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:36,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:00:39,183 WARN L232 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-07 13:03:39,137 WARN L833 $PredicateComparison]: unable to prove that (or (and (exists ((v_main_~a~0_BEFORE_CALL_102 Int) (aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 Int) (aux_div_v_main_~z~0_BEFORE_CALL_205_45 Int) (aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95 Int)) (let ((.cse2 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141))) (let ((.cse0 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 .cse2)) (.cse1 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 .cse2 (* (- 6) aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117)))) (and (< v_main_~a~0_BEFORE_CALL_102 aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117) (<= (* 6 aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117) .cse0) (< .cse0 (+ (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95 6) 6)) (<= aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95 (+ v_main_~a~0_BEFORE_CALL_102 1)) (= (+ (* 18 aux_div_v_main_~z~0_BEFORE_CALL_205_45) (* (* aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117 aux_div_v_main_~z~0_BEFORE_CALL_205_45) 18) (* 3 (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 .cse1)) (* 18 (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45))) (+ (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* 18 (* aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117 aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45)) (* 18 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* 18 (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45)) (* (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45 .cse1) 3))) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 6) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (not (= (+ (* v_main_~a~0_BEFORE_CALL_102 .cse1) .cse2 (* (* v_main_~a~0_BEFORE_CALL_102 aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117) 6)) (* (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) 6))))))) (<= 0 |c___VERIFIER_assert_#in~cond|)) (<= 1 |c___VERIFIER_assert_#in~cond|)) is different from false [2022-04-07 13:04:39,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {17813#true} call ULTIMATE.init(); {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {17813#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; {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17813#true} {17813#true} #81#return; {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {17813#true} call #t~ret6 := main(); {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {17813#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; {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L272 TraceCheckUtils]: 8: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:04:39,531 INFO L272 TraceCheckUtils]: 13: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:04:39,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:39,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:39,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:39,533 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17813#true} #61#return; {17871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-07 13:04:39,533 INFO L272 TraceCheckUtils]: 18: Hoare triple {17871#(= (+ (* 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)); {17813#true} is VALID [2022-04-07 13:04:39,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:39,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:39,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:39,534 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17871#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #63#return; {17887#(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-07 13:04:39,534 INFO L272 TraceCheckUtils]: 23: Hoare triple {17887#(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)); {17813#true} is VALID [2022-04-07 13:04:39,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:39,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:39,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:39,536 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17887#(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; {17903#(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-07 13:04:39,536 INFO L272 TraceCheckUtils]: 28: Hoare triple {17903#(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)); {17813#true} is VALID [2022-04-07 13:04:39,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:39,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:39,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:39,537 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17813#true} {17903#(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; {17903#(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-07 13:04:41,539 WARN L290 TraceCheckUtils]: 33: Hoare triple {17903#(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; {17903#(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-07 13:04:41,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {17903#(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; {17903#(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-07 13:04:41,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {17903#(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; {17903#(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-07 13:04:41,541 INFO L272 TraceCheckUtils]: 36: Hoare triple {17903#(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)); {17813#true} is VALID [2022-04-07 13:04:41,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:41,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:41,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:41,541 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17813#true} {17903#(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; {17903#(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-07 13:04:41,541 INFO L272 TraceCheckUtils]: 41: Hoare triple {17903#(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)); {17813#true} is VALID [2022-04-07 13:04:41,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:41,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:41,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:41,543 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17903#(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; {17903#(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-07 13:04:41,543 INFO L272 TraceCheckUtils]: 46: Hoare triple {17903#(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)); {17813#true} is VALID [2022-04-07 13:04:41,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:41,543 INFO L290 TraceCheckUtils]: 48: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:41,543 INFO L290 TraceCheckUtils]: 49: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:41,545 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17903#(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; {17973#(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-07 13:04:41,545 INFO L272 TraceCheckUtils]: 51: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:41,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:41,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:41,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:41,545 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:41,546 INFO L272 TraceCheckUtils]: 56: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:41,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:41,546 INFO L290 TraceCheckUtils]: 58: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:41,546 INFO L290 TraceCheckUtils]: 59: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:41,546 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:43,550 WARN L290 TraceCheckUtils]: 61: Hoare triple {17973#(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; {17973#(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-07 13:04:43,551 INFO L290 TraceCheckUtils]: 62: Hoare triple {17973#(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; {17973#(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-07 13:04:43,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {17973#(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; {17973#(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-07 13:04:43,552 INFO L272 TraceCheckUtils]: 64: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:43,552 INFO L290 TraceCheckUtils]: 65: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:43,552 INFO L290 TraceCheckUtils]: 66: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:43,552 INFO L290 TraceCheckUtils]: 67: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:43,552 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:43,552 INFO L272 TraceCheckUtils]: 69: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:43,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:43,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:43,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:43,554 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17973#(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; {17973#(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-07 13:04:43,554 INFO L272 TraceCheckUtils]: 74: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:43,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:43,554 INFO L290 TraceCheckUtils]: 76: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:43,554 INFO L290 TraceCheckUtils]: 77: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:43,554 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:43,555 INFO L272 TraceCheckUtils]: 79: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:43,555 INFO L290 TraceCheckUtils]: 80: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:43,555 INFO L290 TraceCheckUtils]: 81: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:43,555 INFO L290 TraceCheckUtils]: 82: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:43,555 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:43,555 INFO L272 TraceCheckUtils]: 84: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:43,555 INFO L290 TraceCheckUtils]: 85: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:43,555 INFO L290 TraceCheckUtils]: 86: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:43,555 INFO L290 TraceCheckUtils]: 87: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:43,556 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:45,558 WARN L290 TraceCheckUtils]: 89: Hoare triple {17973#(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; {17973#(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-07 13:04:45,559 INFO L290 TraceCheckUtils]: 90: Hoare triple {17973#(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; {17973#(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-07 13:04:45,559 INFO L290 TraceCheckUtils]: 91: Hoare triple {17973#(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; {17973#(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-07 13:04:45,559 INFO L272 TraceCheckUtils]: 92: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:45,559 INFO L290 TraceCheckUtils]: 93: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:45,559 INFO L290 TraceCheckUtils]: 94: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:45,559 INFO L290 TraceCheckUtils]: 95: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:45,560 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:45,560 INFO L272 TraceCheckUtils]: 97: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:45,560 INFO L290 TraceCheckUtils]: 98: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:45,560 INFO L290 TraceCheckUtils]: 99: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:45,561 INFO L290 TraceCheckUtils]: 100: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:45,561 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {17973#(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; {17973#(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-07 13:04:45,561 INFO L272 TraceCheckUtils]: 102: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:45,561 INFO L290 TraceCheckUtils]: 103: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:45,561 INFO L290 TraceCheckUtils]: 104: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:45,561 INFO L290 TraceCheckUtils]: 105: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:45,562 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:45,562 INFO L272 TraceCheckUtils]: 107: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:45,562 INFO L290 TraceCheckUtils]: 108: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:45,562 INFO L290 TraceCheckUtils]: 109: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:45,562 INFO L290 TraceCheckUtils]: 110: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:45,563 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:45,563 INFO L272 TraceCheckUtils]: 112: Hoare triple {17973#(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)); {17813#true} is VALID [2022-04-07 13:04:45,563 INFO L290 TraceCheckUtils]: 113: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:45,563 INFO L290 TraceCheckUtils]: 114: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:45,563 INFO L290 TraceCheckUtils]: 115: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:45,563 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17813#true} {17973#(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; {17973#(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-07 13:04:47,565 WARN L290 TraceCheckUtils]: 117: Hoare triple {17973#(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; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is UNKNOWN [2022-04-07 13:04:47,567 INFO L290 TraceCheckUtils]: 118: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-07 13:04:47,567 INFO L290 TraceCheckUtils]: 119: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} assume !!(#t~post5 < 50);havoc #t~post5; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-07 13:04:47,568 INFO L272 TraceCheckUtils]: 120: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:04:47,568 INFO L290 TraceCheckUtils]: 121: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:47,568 INFO L290 TraceCheckUtils]: 122: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:47,568 INFO L290 TraceCheckUtils]: 123: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:47,568 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17813#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #59#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-07 13:04:47,568 INFO L272 TraceCheckUtils]: 125: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:04:47,569 INFO L290 TraceCheckUtils]: 126: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:47,569 INFO L290 TraceCheckUtils]: 127: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:47,569 INFO L290 TraceCheckUtils]: 128: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:47,570 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #61#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-07 13:04:47,570 INFO L272 TraceCheckUtils]: 130: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:04:47,570 INFO L290 TraceCheckUtils]: 131: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:47,570 INFO L290 TraceCheckUtils]: 132: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:47,570 INFO L290 TraceCheckUtils]: 133: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:47,570 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17813#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #63#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-07 13:04:47,570 INFO L272 TraceCheckUtils]: 135: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) 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)); {17813#true} is VALID [2022-04-07 13:04:47,571 INFO L290 TraceCheckUtils]: 136: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:47,571 INFO L290 TraceCheckUtils]: 137: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:47,571 INFO L290 TraceCheckUtils]: 138: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:47,571 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17813#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #65#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-07 13:04:47,571 INFO L272 TraceCheckUtils]: 140: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:04:47,571 INFO L290 TraceCheckUtils]: 141: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:47,571 INFO L290 TraceCheckUtils]: 142: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:47,571 INFO L290 TraceCheckUtils]: 143: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:47,572 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17813#true} {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #67#return; {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-07 13:04:47,573 INFO L290 TraceCheckUtils]: 145: Hoare triple {18175#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} assume !(~n~0 <= ~a~0); {18260#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} is VALID [2022-04-07 13:04:47,573 INFO L272 TraceCheckUtils]: 146: Hoare triple {18260#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:04:47,573 INFO L290 TraceCheckUtils]: 147: Hoare triple {17813#true} ~cond := #in~cond; {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:47,573 INFO L290 TraceCheckUtils]: 148: Hoare triple {17860#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:47,574 INFO L290 TraceCheckUtils]: 149: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:48,269 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18260#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* 2 (* main_~n~0 main_~n~0 (- 3))) (- 2) (* main_~n~0 6) (* main_~y~0 2) (* (+ (- 1) main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) (+ (- 2) (* 3 (* (+ (- 1) main_~n~0) (+ (- 1) main_~n~0))) (* main_~n~0 3)))) (+ (* 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))) (not (<= main_~n~0 main_~a~0)) (= (+ 5 main_~y~0 (* main_~n~0 main_~n~0 (- 3)) (* main_~n~0 3)) main_~z~0))} #69#return; {18276#(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)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-07 13:04:48,269 INFO L272 TraceCheckUtils]: 151: Hoare triple {18276#(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)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:04:48,269 INFO L290 TraceCheckUtils]: 152: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:04:48,269 INFO L290 TraceCheckUtils]: 153: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:04:48,269 INFO L290 TraceCheckUtils]: 154: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:04:48,270 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17813#true} {18276#(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)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} #71#return; {18276#(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)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} is VALID [2022-04-07 13:04:50,286 WARN L272 TraceCheckUtils]: 156: Hoare triple {18276#(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)) (= (+ (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) 3 (* (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6)) 9) (* (div (+ main_~z~0 (- 6)) 6) 6) (* (* (div (+ main_~z~0 (- 6)) 6) main_~y~0) 3)) (+ (* main_~y~0 3) (* 3 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) main_~y~0)))) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (< main_~a~0 (div (+ main_~z~0 (- 6)) 6)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18295#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~a~0_BEFORE_CALL_102 Int) (aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 Int) (aux_div_v_main_~z~0_BEFORE_CALL_205_45 Int) (aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95 Int)) (and (< v_main_~a~0_BEFORE_CALL_102 aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117) (<= (* 6 aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117) (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141))) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141)) (+ (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95 6) 6)) (<= aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95 (+ v_main_~a~0_BEFORE_CALL_102 1)) (= (+ (* 18 aux_div_v_main_~z~0_BEFORE_CALL_205_45) (* (* aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117 aux_div_v_main_~z~0_BEFORE_CALL_205_45) 18) (* 3 (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* (- 6) aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117)))) (* 18 (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45))) (+ (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* 18 (* aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117 aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45)) (* 18 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* 18 (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45)) (* (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* (- 6) aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117))) 3))) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 6) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (not (= (+ (* v_main_~a~0_BEFORE_CALL_102 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* (- 6) aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117))) (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* (* v_main_~a~0_BEFORE_CALL_102 aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117) 6)) (* (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) 6)))))) (<= 1 |__VERIFIER_assert_#in~cond|))} is UNKNOWN [2022-04-07 13:04:52,289 WARN L290 TraceCheckUtils]: 157: Hoare triple {18295#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~a~0_BEFORE_CALL_102 Int) (aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 Int) (aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 Int) (aux_div_v_main_~z~0_BEFORE_CALL_205_45 Int) (aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95 Int)) (and (< v_main_~a~0_BEFORE_CALL_102 aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117) (<= (* 6 aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117) (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141))) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141)) (+ (* aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95 6) 6)) (<= aux_div_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95 (+ v_main_~a~0_BEFORE_CALL_102 1)) (= (+ (* 18 aux_div_v_main_~z~0_BEFORE_CALL_205_45) (* (* aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117 aux_div_v_main_~z~0_BEFORE_CALL_205_45) 18) (* 3 (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* (- 6) aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117)))) (* 18 (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45))) (+ (* 3 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* 18 (* aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117 aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45)) (* 18 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* 18 (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45)) (* (* aux_div_v_main_~z~0_BEFORE_CALL_205_45 aux_div_v_main_~z~0_BEFORE_CALL_205_45 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* (- 6) aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117))) 3))) (< aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 6) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (not (= (+ (* v_main_~a~0_BEFORE_CALL_102 (+ aux_mod_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* (- 6) aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117))) (* 6 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) (* (* v_main_~a~0_BEFORE_CALL_102 aux_div_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117) 6)) (* (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141 aux_div_aux_mod_aux_mod_aux_mod_v_main_~z~0_BEFORE_CALL_205_45_95_117_141) 6)))))) (<= 1 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is UNKNOWN [2022-04-07 13:04:52,290 INFO L290 TraceCheckUtils]: 158: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17814#false} is VALID [2022-04-07 13:04:52,290 INFO L290 TraceCheckUtils]: 159: Hoare triple {17814#false} assume !false; {17814#false} is VALID [2022-04-07 13:04:52,291 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-07 13:04:52,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:05:03,872 INFO L290 TraceCheckUtils]: 159: Hoare triple {17814#false} assume !false; {17814#false} is VALID [2022-04-07 13:05:03,873 INFO L290 TraceCheckUtils]: 158: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17814#false} is VALID [2022-04-07 13:05:03,873 INFO L290 TraceCheckUtils]: 157: Hoare triple {18312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:05:03,874 INFO L272 TraceCheckUtils]: 156: Hoare triple {18316#(= (+ (* 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)); {18312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:05:03,875 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17813#true} {18316#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #71#return; {18316#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-07 13:05:03,875 INFO L290 TraceCheckUtils]: 154: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,875 INFO L290 TraceCheckUtils]: 153: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,875 INFO L290 TraceCheckUtils]: 152: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,875 INFO L272 TraceCheckUtils]: 151: Hoare triple {18316#(= (+ (* 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)); {17813#true} is VALID [2022-04-07 13:05:03,876 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18335#(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; {18316#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-07 13:05:03,876 INFO L290 TraceCheckUtils]: 149: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:05:03,877 INFO L290 TraceCheckUtils]: 148: Hoare triple {18345#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:05:03,877 INFO L290 TraceCheckUtils]: 147: Hoare triple {17813#true} ~cond := #in~cond; {18345#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:05:03,877 INFO L272 TraceCheckUtils]: 146: Hoare triple {18335#(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)); {17813#true} is VALID [2022-04-07 13:05:03,878 INFO L290 TraceCheckUtils]: 145: Hoare triple {18352#(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); {18335#(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-07 13:05:03,878 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17813#true} {18352#(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; {18352#(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-07 13:05:03,879 INFO L290 TraceCheckUtils]: 143: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,879 INFO L290 TraceCheckUtils]: 142: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,879 INFO L290 TraceCheckUtils]: 141: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,879 INFO L272 TraceCheckUtils]: 140: Hoare triple {18352#(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)); {17813#true} is VALID [2022-04-07 13:05:03,879 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17813#true} {18352#(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; {18352#(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-07 13:05:03,880 INFO L290 TraceCheckUtils]: 138: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,880 INFO L290 TraceCheckUtils]: 137: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,880 INFO L290 TraceCheckUtils]: 136: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,880 INFO L272 TraceCheckUtils]: 135: Hoare triple {18352#(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)); {17813#true} is VALID [2022-04-07 13:05:03,880 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17813#true} {18352#(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; {18352#(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-07 13:05:03,881 INFO L290 TraceCheckUtils]: 133: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,881 INFO L290 TraceCheckUtils]: 132: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,881 INFO L290 TraceCheckUtils]: 131: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,881 INFO L272 TraceCheckUtils]: 130: Hoare triple {18352#(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)); {17813#true} is VALID [2022-04-07 13:05:03,882 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18401#(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; {18352#(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-07 13:05:03,882 INFO L290 TraceCheckUtils]: 128: Hoare triple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:05:03,882 INFO L290 TraceCheckUtils]: 127: Hoare triple {18345#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:05:03,883 INFO L290 TraceCheckUtils]: 126: Hoare triple {17813#true} ~cond := #in~cond; {18345#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:05:03,883 INFO L272 TraceCheckUtils]: 125: Hoare triple {18401#(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)); {17813#true} is VALID [2022-04-07 13:05:03,883 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17813#true} {18401#(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; {18401#(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-07 13:05:03,883 INFO L290 TraceCheckUtils]: 123: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,883 INFO L290 TraceCheckUtils]: 122: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,884 INFO L290 TraceCheckUtils]: 121: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,884 INFO L272 TraceCheckUtils]: 120: Hoare triple {18401#(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)); {17813#true} is VALID [2022-04-07 13:05:03,884 INFO L290 TraceCheckUtils]: 119: Hoare triple {18401#(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; {18401#(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-07 13:05:03,885 INFO L290 TraceCheckUtils]: 118: Hoare triple {18401#(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; {18401#(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-07 13:05:03,890 INFO L290 TraceCheckUtils]: 117: Hoare triple {17813#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; {18401#(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-07 13:05:03,890 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-07 13:05:03,890 INFO L290 TraceCheckUtils]: 115: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,890 INFO L290 TraceCheckUtils]: 114: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,890 INFO L290 TraceCheckUtils]: 113: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,890 INFO L272 TraceCheckUtils]: 112: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L290 TraceCheckUtils]: 110: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L290 TraceCheckUtils]: 109: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L290 TraceCheckUtils]: 108: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L272 TraceCheckUtils]: 107: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L290 TraceCheckUtils]: 105: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L290 TraceCheckUtils]: 104: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L290 TraceCheckUtils]: 103: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L272 TraceCheckUtils]: 102: Hoare triple {17813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-07 13:05:03,891 INFO L290 TraceCheckUtils]: 100: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L290 TraceCheckUtils]: 99: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L290 TraceCheckUtils]: 98: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L272 TraceCheckUtils]: 97: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L290 TraceCheckUtils]: 95: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L290 TraceCheckUtils]: 94: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L290 TraceCheckUtils]: 93: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L272 TraceCheckUtils]: 92: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L290 TraceCheckUtils]: 91: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L290 TraceCheckUtils]: 90: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L290 TraceCheckUtils]: 89: Hoare triple {17813#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; {17813#true} is VALID [2022-04-07 13:05:03,892 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L290 TraceCheckUtils]: 87: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L290 TraceCheckUtils]: 86: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L290 TraceCheckUtils]: 85: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L272 TraceCheckUtils]: 84: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L290 TraceCheckUtils]: 82: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L290 TraceCheckUtils]: 81: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L290 TraceCheckUtils]: 80: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L272 TraceCheckUtils]: 79: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L290 TraceCheckUtils]: 77: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,893 INFO L290 TraceCheckUtils]: 76: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L272 TraceCheckUtils]: 74: Hoare triple {17813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L290 TraceCheckUtils]: 71: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L290 TraceCheckUtils]: 70: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L272 TraceCheckUtils]: 69: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L290 TraceCheckUtils]: 67: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L290 TraceCheckUtils]: 66: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L290 TraceCheckUtils]: 65: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,894 INFO L272 TraceCheckUtils]: 64: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L290 TraceCheckUtils]: 63: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L290 TraceCheckUtils]: 62: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L290 TraceCheckUtils]: 61: Hoare triple {17813#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; {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L290 TraceCheckUtils]: 59: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L290 TraceCheckUtils]: 58: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L272 TraceCheckUtils]: 56: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L290 TraceCheckUtils]: 54: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L290 TraceCheckUtils]: 53: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L290 TraceCheckUtils]: 52: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,895 INFO L272 TraceCheckUtils]: 51: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L272 TraceCheckUtils]: 46: Hoare triple {17813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L272 TraceCheckUtils]: 41: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:05:03,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L272 TraceCheckUtils]: 36: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L290 TraceCheckUtils]: 35: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {17813#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; {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L272 TraceCheckUtils]: 28: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-07 13:05:03,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L272 TraceCheckUtils]: 23: Hoare triple {17813#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L272 TraceCheckUtils]: 18: Hoare triple {17813#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L272 TraceCheckUtils]: 13: Hoare triple {17813#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L272 TraceCheckUtils]: 8: Hoare triple {17813#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {17813#true} assume !!(#t~post5 < 50);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {17813#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {17813#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; {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {17813#true} call #t~ret6 := main(); {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17813#true} {17813#true} #81#return; {17813#true} is VALID [2022-04-07 13:05:03,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:05:03,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {17813#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; {17813#true} is VALID [2022-04-07 13:05:03,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {17813#true} call ULTIMATE.init(); {17813#true} is VALID [2022-04-07 13:05:03,900 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-07 13:05:03,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:05:03,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357363268] [2022-04-07 13:05:03,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:05:03,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827469715] [2022-04-07 13:05:03,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827469715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:05:03,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:05:03,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2022-04-07 13:05:03,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229437443] [2022-04-07 13:05:03,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:05:03,902 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 12 states have call successors, (34), 3 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-07 13:05:03,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:05:03,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 12 states have call successors, (34), 3 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-07 13:05:14,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 93 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-07 13:05:14,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-07 13:05:14,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:05:14,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-07 13:05:14,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=242, Unknown=2, NotChecked=32, Total=342 [2022-04-07 13:05:14,556 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 19 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 12 states have call successors, (34), 3 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-07 13:05:21,155 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-07 13:05:23,984 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-07 13:05:27,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:34,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:38,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:40,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:42,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:44,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:46,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:48,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:50,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:54,592 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-07 13:05:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:54,789 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2022-04-07 13:05:54,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 13:05:54,789 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 12 states have call successors, (34), 3 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-07 13:05:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:05:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 12 states have call successors, (34), 3 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-07 13:05:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-07 13:05:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 12 states have call successors, (34), 3 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-07 13:05:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-07 13:05:54,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-07 13:05:56,032 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-07 13:05:56,038 INFO L225 Difference]: With dead ends: 315 [2022-04-07 13:05:56,038 INFO L226 Difference]: Without dead ends: 294 [2022-04-07 13:05:56,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 299 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=127, Invalid=427, Unknown=2, NotChecked=44, Total=600 [2022-04-07 13:05:56,040 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 67 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2022-04-07 13:05:56,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 112 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 205 Invalid, 11 Unknown, 44 Unchecked, 27.3s Time] [2022-04-07 13:05:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-07 13:05:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-04-07 13:05:56,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:05:56,221 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-07 13:05:56,222 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-07 13:05:56,222 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-07 13:05:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:56,228 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-07 13:05:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-07 13:05:56,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:56,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:56,229 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-07 13:05:56,229 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-07 13:05:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:05:56,235 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-07 13:05:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-07 13:05:56,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:05:56,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:05:56,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:05:56,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:05:56,236 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-07 13:05:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-04-07 13:05:56,243 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-04-07 13:05:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:05:56,243 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-04-07 13:05:56,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 12 states have call successors, (34), 3 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-07 13:05:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-07 13:05:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-07 13:05:56,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:05:56,247 INFO L499 BasicCegarLoop]: 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-07 13:05:56,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-07 13:05:56,455 WARN L460 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-07 13:05:56,455 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:05:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:05:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 3 times [2022-04-07 13:05:56,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:05:56,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131216872] [2022-04-07 13:05:56,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:05:56,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:05:56,472 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:05:56,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335439871] [2022-04-07 13:05:56,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 13:05:56,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:05:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:05:56,474 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:05:56,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-07 13:05:56,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-04-07 13:05:56,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 13:05:56,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 13:05:56,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:05:56,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:05:58,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {20251#true} call ULTIMATE.init(); {20251#true} is VALID [2022-04-07 13:05:58,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#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; {20259#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:58,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {20259#(<= ~counter~0 0)} assume true; {20259#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:58,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20259#(<= ~counter~0 0)} {20251#true} #81#return; {20259#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:58,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {20259#(<= ~counter~0 0)} call #t~ret6 := main(); {20259#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:58,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {20259#(<= ~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; {20259#(<= ~counter~0 0)} is VALID [2022-04-07 13:05:58,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {20259#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {20275#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,275 INFO L272 TraceCheckUtils]: 8: Hoare triple {20275#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {20275#(<= ~counter~0 1)} ~cond := #in~cond; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {20275#(<= ~counter~0 1)} assume !(0 == ~cond); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {20275#(<= ~counter~0 1)} assume true; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,276 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20275#(<= ~counter~0 1)} {20275#(<= ~counter~0 1)} #59#return; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,277 INFO L272 TraceCheckUtils]: 13: Hoare triple {20275#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {20275#(<= ~counter~0 1)} ~cond := #in~cond; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {20275#(<= ~counter~0 1)} assume !(0 == ~cond); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {20275#(<= ~counter~0 1)} assume true; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,278 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20275#(<= ~counter~0 1)} {20275#(<= ~counter~0 1)} #61#return; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,278 INFO L272 TraceCheckUtils]: 18: Hoare triple {20275#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {20275#(<= ~counter~0 1)} ~cond := #in~cond; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {20275#(<= ~counter~0 1)} assume !(0 == ~cond); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {20275#(<= ~counter~0 1)} assume true; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,279 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20275#(<= ~counter~0 1)} {20275#(<= ~counter~0 1)} #63#return; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,280 INFO L272 TraceCheckUtils]: 23: Hoare triple {20275#(<= ~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)); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {20275#(<= ~counter~0 1)} ~cond := #in~cond; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {20275#(<= ~counter~0 1)} assume !(0 == ~cond); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,281 INFO L290 TraceCheckUtils]: 26: Hoare triple {20275#(<= ~counter~0 1)} assume true; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,281 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20275#(<= ~counter~0 1)} {20275#(<= ~counter~0 1)} #65#return; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,281 INFO L272 TraceCheckUtils]: 28: Hoare triple {20275#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {20275#(<= ~counter~0 1)} ~cond := #in~cond; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {20275#(<= ~counter~0 1)} assume !(0 == ~cond); {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {20275#(<= ~counter~0 1)} assume true; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,283 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20275#(<= ~counter~0 1)} {20275#(<= ~counter~0 1)} #67#return; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {20275#(<= ~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; {20275#(<= ~counter~0 1)} is VALID [2022-04-07 13:05:58,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {20275#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {20360#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,284 INFO L272 TraceCheckUtils]: 36: Hoare triple {20360#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,285 INFO L290 TraceCheckUtils]: 37: Hoare triple {20360#(<= ~counter~0 2)} ~cond := #in~cond; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {20360#(<= ~counter~0 2)} assume !(0 == ~cond); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,285 INFO L290 TraceCheckUtils]: 39: Hoare triple {20360#(<= ~counter~0 2)} assume true; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,286 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20360#(<= ~counter~0 2)} {20360#(<= ~counter~0 2)} #59#return; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,286 INFO L272 TraceCheckUtils]: 41: Hoare triple {20360#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {20360#(<= ~counter~0 2)} ~cond := #in~cond; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {20360#(<= ~counter~0 2)} assume !(0 == ~cond); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,287 INFO L290 TraceCheckUtils]: 44: Hoare triple {20360#(<= ~counter~0 2)} assume true; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,287 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20360#(<= ~counter~0 2)} {20360#(<= ~counter~0 2)} #61#return; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,288 INFO L272 TraceCheckUtils]: 46: Hoare triple {20360#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,288 INFO L290 TraceCheckUtils]: 47: Hoare triple {20360#(<= ~counter~0 2)} ~cond := #in~cond; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {20360#(<= ~counter~0 2)} assume !(0 == ~cond); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,288 INFO L290 TraceCheckUtils]: 49: Hoare triple {20360#(<= ~counter~0 2)} assume true; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,289 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20360#(<= ~counter~0 2)} {20360#(<= ~counter~0 2)} #63#return; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,289 INFO L272 TraceCheckUtils]: 51: Hoare triple {20360#(<= ~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)); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,290 INFO L290 TraceCheckUtils]: 52: Hoare triple {20360#(<= ~counter~0 2)} ~cond := #in~cond; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,290 INFO L290 TraceCheckUtils]: 53: Hoare triple {20360#(<= ~counter~0 2)} assume !(0 == ~cond); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,290 INFO L290 TraceCheckUtils]: 54: Hoare triple {20360#(<= ~counter~0 2)} assume true; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,291 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20360#(<= ~counter~0 2)} {20360#(<= ~counter~0 2)} #65#return; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,291 INFO L272 TraceCheckUtils]: 56: Hoare triple {20360#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,291 INFO L290 TraceCheckUtils]: 57: Hoare triple {20360#(<= ~counter~0 2)} ~cond := #in~cond; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,291 INFO L290 TraceCheckUtils]: 58: Hoare triple {20360#(<= ~counter~0 2)} assume !(0 == ~cond); {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,292 INFO L290 TraceCheckUtils]: 59: Hoare triple {20360#(<= ~counter~0 2)} assume true; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,292 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20360#(<= ~counter~0 2)} {20360#(<= ~counter~0 2)} #67#return; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,292 INFO L290 TraceCheckUtils]: 61: Hoare triple {20360#(<= ~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; {20360#(<= ~counter~0 2)} is VALID [2022-04-07 13:05:58,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {20360#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {20445#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,294 INFO L272 TraceCheckUtils]: 64: Hoare triple {20445#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,294 INFO L290 TraceCheckUtils]: 65: Hoare triple {20445#(<= ~counter~0 3)} ~cond := #in~cond; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,294 INFO L290 TraceCheckUtils]: 66: Hoare triple {20445#(<= ~counter~0 3)} assume !(0 == ~cond); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,295 INFO L290 TraceCheckUtils]: 67: Hoare triple {20445#(<= ~counter~0 3)} assume true; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,295 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20445#(<= ~counter~0 3)} {20445#(<= ~counter~0 3)} #59#return; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,295 INFO L272 TraceCheckUtils]: 69: Hoare triple {20445#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {20445#(<= ~counter~0 3)} ~cond := #in~cond; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,296 INFO L290 TraceCheckUtils]: 71: Hoare triple {20445#(<= ~counter~0 3)} assume !(0 == ~cond); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,296 INFO L290 TraceCheckUtils]: 72: Hoare triple {20445#(<= ~counter~0 3)} assume true; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,297 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20445#(<= ~counter~0 3)} {20445#(<= ~counter~0 3)} #61#return; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,297 INFO L272 TraceCheckUtils]: 74: Hoare triple {20445#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,297 INFO L290 TraceCheckUtils]: 75: Hoare triple {20445#(<= ~counter~0 3)} ~cond := #in~cond; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,298 INFO L290 TraceCheckUtils]: 76: Hoare triple {20445#(<= ~counter~0 3)} assume !(0 == ~cond); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,298 INFO L290 TraceCheckUtils]: 77: Hoare triple {20445#(<= ~counter~0 3)} assume true; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,298 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20445#(<= ~counter~0 3)} {20445#(<= ~counter~0 3)} #63#return; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,299 INFO L272 TraceCheckUtils]: 79: Hoare triple {20445#(<= ~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)); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,299 INFO L290 TraceCheckUtils]: 80: Hoare triple {20445#(<= ~counter~0 3)} ~cond := #in~cond; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,299 INFO L290 TraceCheckUtils]: 81: Hoare triple {20445#(<= ~counter~0 3)} assume !(0 == ~cond); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,300 INFO L290 TraceCheckUtils]: 82: Hoare triple {20445#(<= ~counter~0 3)} assume true; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,300 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {20445#(<= ~counter~0 3)} {20445#(<= ~counter~0 3)} #65#return; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,300 INFO L272 TraceCheckUtils]: 84: Hoare triple {20445#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,301 INFO L290 TraceCheckUtils]: 85: Hoare triple {20445#(<= ~counter~0 3)} ~cond := #in~cond; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,301 INFO L290 TraceCheckUtils]: 86: Hoare triple {20445#(<= ~counter~0 3)} assume !(0 == ~cond); {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,301 INFO L290 TraceCheckUtils]: 87: Hoare triple {20445#(<= ~counter~0 3)} assume true; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,302 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20445#(<= ~counter~0 3)} {20445#(<= ~counter~0 3)} #67#return; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,302 INFO L290 TraceCheckUtils]: 89: Hoare triple {20445#(<= ~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; {20445#(<= ~counter~0 3)} is VALID [2022-04-07 13:05:58,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {20445#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,303 INFO L290 TraceCheckUtils]: 91: Hoare triple {20530#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,303 INFO L272 TraceCheckUtils]: 92: Hoare triple {20530#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {20530#(<= ~counter~0 4)} ~cond := #in~cond; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,304 INFO L290 TraceCheckUtils]: 94: Hoare triple {20530#(<= ~counter~0 4)} assume !(0 == ~cond); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,304 INFO L290 TraceCheckUtils]: 95: Hoare triple {20530#(<= ~counter~0 4)} assume true; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,305 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20530#(<= ~counter~0 4)} {20530#(<= ~counter~0 4)} #59#return; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,305 INFO L272 TraceCheckUtils]: 97: Hoare triple {20530#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,305 INFO L290 TraceCheckUtils]: 98: Hoare triple {20530#(<= ~counter~0 4)} ~cond := #in~cond; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,306 INFO L290 TraceCheckUtils]: 99: Hoare triple {20530#(<= ~counter~0 4)} assume !(0 == ~cond); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,306 INFO L290 TraceCheckUtils]: 100: Hoare triple {20530#(<= ~counter~0 4)} assume true; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,306 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20530#(<= ~counter~0 4)} {20530#(<= ~counter~0 4)} #61#return; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,307 INFO L272 TraceCheckUtils]: 102: Hoare triple {20530#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,307 INFO L290 TraceCheckUtils]: 103: Hoare triple {20530#(<= ~counter~0 4)} ~cond := #in~cond; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,307 INFO L290 TraceCheckUtils]: 104: Hoare triple {20530#(<= ~counter~0 4)} assume !(0 == ~cond); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,307 INFO L290 TraceCheckUtils]: 105: Hoare triple {20530#(<= ~counter~0 4)} assume true; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,308 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20530#(<= ~counter~0 4)} {20530#(<= ~counter~0 4)} #63#return; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,308 INFO L272 TraceCheckUtils]: 107: Hoare triple {20530#(<= ~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)); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,308 INFO L290 TraceCheckUtils]: 108: Hoare triple {20530#(<= ~counter~0 4)} ~cond := #in~cond; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,309 INFO L290 TraceCheckUtils]: 109: Hoare triple {20530#(<= ~counter~0 4)} assume !(0 == ~cond); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,309 INFO L290 TraceCheckUtils]: 110: Hoare triple {20530#(<= ~counter~0 4)} assume true; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,309 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20530#(<= ~counter~0 4)} {20530#(<= ~counter~0 4)} #65#return; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,310 INFO L272 TraceCheckUtils]: 112: Hoare triple {20530#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,310 INFO L290 TraceCheckUtils]: 113: Hoare triple {20530#(<= ~counter~0 4)} ~cond := #in~cond; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,310 INFO L290 TraceCheckUtils]: 114: Hoare triple {20530#(<= ~counter~0 4)} assume !(0 == ~cond); {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,311 INFO L290 TraceCheckUtils]: 115: Hoare triple {20530#(<= ~counter~0 4)} assume true; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,311 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20530#(<= ~counter~0 4)} {20530#(<= ~counter~0 4)} #67#return; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,311 INFO L290 TraceCheckUtils]: 117: Hoare triple {20530#(<= ~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; {20530#(<= ~counter~0 4)} is VALID [2022-04-07 13:05:58,312 INFO L290 TraceCheckUtils]: 118: Hoare triple {20530#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,312 INFO L290 TraceCheckUtils]: 119: Hoare triple {20615#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,313 INFO L272 TraceCheckUtils]: 120: Hoare triple {20615#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,313 INFO L290 TraceCheckUtils]: 121: Hoare triple {20615#(<= ~counter~0 5)} ~cond := #in~cond; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,313 INFO L290 TraceCheckUtils]: 122: Hoare triple {20615#(<= ~counter~0 5)} assume !(0 == ~cond); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,314 INFO L290 TraceCheckUtils]: 123: Hoare triple {20615#(<= ~counter~0 5)} assume true; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,314 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20615#(<= ~counter~0 5)} {20615#(<= ~counter~0 5)} #59#return; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,314 INFO L272 TraceCheckUtils]: 125: Hoare triple {20615#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,315 INFO L290 TraceCheckUtils]: 126: Hoare triple {20615#(<= ~counter~0 5)} ~cond := #in~cond; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,315 INFO L290 TraceCheckUtils]: 127: Hoare triple {20615#(<= ~counter~0 5)} assume !(0 == ~cond); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,315 INFO L290 TraceCheckUtils]: 128: Hoare triple {20615#(<= ~counter~0 5)} assume true; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,316 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20615#(<= ~counter~0 5)} {20615#(<= ~counter~0 5)} #61#return; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,316 INFO L272 TraceCheckUtils]: 130: Hoare triple {20615#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,316 INFO L290 TraceCheckUtils]: 131: Hoare triple {20615#(<= ~counter~0 5)} ~cond := #in~cond; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,317 INFO L290 TraceCheckUtils]: 132: Hoare triple {20615#(<= ~counter~0 5)} assume !(0 == ~cond); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,317 INFO L290 TraceCheckUtils]: 133: Hoare triple {20615#(<= ~counter~0 5)} assume true; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,317 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20615#(<= ~counter~0 5)} {20615#(<= ~counter~0 5)} #63#return; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,318 INFO L272 TraceCheckUtils]: 135: Hoare triple {20615#(<= ~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)); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,318 INFO L290 TraceCheckUtils]: 136: Hoare triple {20615#(<= ~counter~0 5)} ~cond := #in~cond; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,318 INFO L290 TraceCheckUtils]: 137: Hoare triple {20615#(<= ~counter~0 5)} assume !(0 == ~cond); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,319 INFO L290 TraceCheckUtils]: 138: Hoare triple {20615#(<= ~counter~0 5)} assume true; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,319 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {20615#(<= ~counter~0 5)} {20615#(<= ~counter~0 5)} #65#return; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,319 INFO L272 TraceCheckUtils]: 140: Hoare triple {20615#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,320 INFO L290 TraceCheckUtils]: 141: Hoare triple {20615#(<= ~counter~0 5)} ~cond := #in~cond; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,320 INFO L290 TraceCheckUtils]: 142: Hoare triple {20615#(<= ~counter~0 5)} assume !(0 == ~cond); {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,320 INFO L290 TraceCheckUtils]: 143: Hoare triple {20615#(<= ~counter~0 5)} assume true; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,321 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20615#(<= ~counter~0 5)} {20615#(<= ~counter~0 5)} #67#return; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,321 INFO L290 TraceCheckUtils]: 145: Hoare triple {20615#(<= ~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; {20615#(<= ~counter~0 5)} is VALID [2022-04-07 13:05:58,322 INFO L290 TraceCheckUtils]: 146: Hoare triple {20615#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,322 INFO L290 TraceCheckUtils]: 147: Hoare triple {20700#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,322 INFO L272 TraceCheckUtils]: 148: Hoare triple {20700#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,323 INFO L290 TraceCheckUtils]: 149: Hoare triple {20700#(<= ~counter~0 6)} ~cond := #in~cond; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,323 INFO L290 TraceCheckUtils]: 150: Hoare triple {20700#(<= ~counter~0 6)} assume !(0 == ~cond); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,323 INFO L290 TraceCheckUtils]: 151: Hoare triple {20700#(<= ~counter~0 6)} assume true; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,324 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {20700#(<= ~counter~0 6)} {20700#(<= ~counter~0 6)} #59#return; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,324 INFO L272 TraceCheckUtils]: 153: Hoare triple {20700#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,324 INFO L290 TraceCheckUtils]: 154: Hoare triple {20700#(<= ~counter~0 6)} ~cond := #in~cond; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,325 INFO L290 TraceCheckUtils]: 155: Hoare triple {20700#(<= ~counter~0 6)} assume !(0 == ~cond); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,325 INFO L290 TraceCheckUtils]: 156: Hoare triple {20700#(<= ~counter~0 6)} assume true; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,325 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20700#(<= ~counter~0 6)} {20700#(<= ~counter~0 6)} #61#return; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,326 INFO L272 TraceCheckUtils]: 158: Hoare triple {20700#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,326 INFO L290 TraceCheckUtils]: 159: Hoare triple {20700#(<= ~counter~0 6)} ~cond := #in~cond; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,326 INFO L290 TraceCheckUtils]: 160: Hoare triple {20700#(<= ~counter~0 6)} assume !(0 == ~cond); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,326 INFO L290 TraceCheckUtils]: 161: Hoare triple {20700#(<= ~counter~0 6)} assume true; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,327 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {20700#(<= ~counter~0 6)} {20700#(<= ~counter~0 6)} #63#return; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,327 INFO L272 TraceCheckUtils]: 163: Hoare triple {20700#(<= ~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)); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,328 INFO L290 TraceCheckUtils]: 164: Hoare triple {20700#(<= ~counter~0 6)} ~cond := #in~cond; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,328 INFO L290 TraceCheckUtils]: 165: Hoare triple {20700#(<= ~counter~0 6)} assume !(0 == ~cond); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,328 INFO L290 TraceCheckUtils]: 166: Hoare triple {20700#(<= ~counter~0 6)} assume true; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,329 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {20700#(<= ~counter~0 6)} {20700#(<= ~counter~0 6)} #65#return; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,330 INFO L272 TraceCheckUtils]: 168: Hoare triple {20700#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,330 INFO L290 TraceCheckUtils]: 169: Hoare triple {20700#(<= ~counter~0 6)} ~cond := #in~cond; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,330 INFO L290 TraceCheckUtils]: 170: Hoare triple {20700#(<= ~counter~0 6)} assume !(0 == ~cond); {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,330 INFO L290 TraceCheckUtils]: 171: Hoare triple {20700#(<= ~counter~0 6)} assume true; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,340 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20700#(<= ~counter~0 6)} {20700#(<= ~counter~0 6)} #67#return; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,340 INFO L290 TraceCheckUtils]: 173: Hoare triple {20700#(<= ~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; {20700#(<= ~counter~0 6)} is VALID [2022-04-07 13:05:58,341 INFO L290 TraceCheckUtils]: 174: Hoare triple {20700#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,342 INFO L290 TraceCheckUtils]: 175: Hoare triple {20785#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,342 INFO L272 TraceCheckUtils]: 176: Hoare triple {20785#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,343 INFO L290 TraceCheckUtils]: 177: Hoare triple {20785#(<= ~counter~0 7)} ~cond := #in~cond; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,343 INFO L290 TraceCheckUtils]: 178: Hoare triple {20785#(<= ~counter~0 7)} assume !(0 == ~cond); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,343 INFO L290 TraceCheckUtils]: 179: Hoare triple {20785#(<= ~counter~0 7)} assume true; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,344 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {20785#(<= ~counter~0 7)} {20785#(<= ~counter~0 7)} #59#return; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,345 INFO L272 TraceCheckUtils]: 181: Hoare triple {20785#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,345 INFO L290 TraceCheckUtils]: 182: Hoare triple {20785#(<= ~counter~0 7)} ~cond := #in~cond; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,345 INFO L290 TraceCheckUtils]: 183: Hoare triple {20785#(<= ~counter~0 7)} assume !(0 == ~cond); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,346 INFO L290 TraceCheckUtils]: 184: Hoare triple {20785#(<= ~counter~0 7)} assume true; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,346 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20785#(<= ~counter~0 7)} {20785#(<= ~counter~0 7)} #61#return; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,347 INFO L272 TraceCheckUtils]: 186: Hoare triple {20785#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,347 INFO L290 TraceCheckUtils]: 187: Hoare triple {20785#(<= ~counter~0 7)} ~cond := #in~cond; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,347 INFO L290 TraceCheckUtils]: 188: Hoare triple {20785#(<= ~counter~0 7)} assume !(0 == ~cond); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,348 INFO L290 TraceCheckUtils]: 189: Hoare triple {20785#(<= ~counter~0 7)} assume true; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,348 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {20785#(<= ~counter~0 7)} {20785#(<= ~counter~0 7)} #63#return; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,349 INFO L272 TraceCheckUtils]: 191: Hoare triple {20785#(<= ~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)); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,349 INFO L290 TraceCheckUtils]: 192: Hoare triple {20785#(<= ~counter~0 7)} ~cond := #in~cond; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,349 INFO L290 TraceCheckUtils]: 193: Hoare triple {20785#(<= ~counter~0 7)} assume !(0 == ~cond); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,349 INFO L290 TraceCheckUtils]: 194: Hoare triple {20785#(<= ~counter~0 7)} assume true; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,350 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {20785#(<= ~counter~0 7)} {20785#(<= ~counter~0 7)} #65#return; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,350 INFO L272 TraceCheckUtils]: 196: Hoare triple {20785#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,350 INFO L290 TraceCheckUtils]: 197: Hoare triple {20785#(<= ~counter~0 7)} ~cond := #in~cond; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,351 INFO L290 TraceCheckUtils]: 198: Hoare triple {20785#(<= ~counter~0 7)} assume !(0 == ~cond); {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,351 INFO L290 TraceCheckUtils]: 199: Hoare triple {20785#(<= ~counter~0 7)} assume true; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,351 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20785#(<= ~counter~0 7)} {20785#(<= ~counter~0 7)} #67#return; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,352 INFO L290 TraceCheckUtils]: 201: Hoare triple {20785#(<= ~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; {20785#(<= ~counter~0 7)} is VALID [2022-04-07 13:05:58,353 INFO L290 TraceCheckUtils]: 202: Hoare triple {20785#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,353 INFO L290 TraceCheckUtils]: 203: Hoare triple {20870#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,353 INFO L272 TraceCheckUtils]: 204: Hoare triple {20870#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,354 INFO L290 TraceCheckUtils]: 205: Hoare triple {20870#(<= ~counter~0 8)} ~cond := #in~cond; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,354 INFO L290 TraceCheckUtils]: 206: Hoare triple {20870#(<= ~counter~0 8)} assume !(0 == ~cond); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,354 INFO L290 TraceCheckUtils]: 207: Hoare triple {20870#(<= ~counter~0 8)} assume true; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,354 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {20870#(<= ~counter~0 8)} {20870#(<= ~counter~0 8)} #59#return; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,355 INFO L272 TraceCheckUtils]: 209: Hoare triple {20870#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,355 INFO L290 TraceCheckUtils]: 210: Hoare triple {20870#(<= ~counter~0 8)} ~cond := #in~cond; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,355 INFO L290 TraceCheckUtils]: 211: Hoare triple {20870#(<= ~counter~0 8)} assume !(0 == ~cond); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,356 INFO L290 TraceCheckUtils]: 212: Hoare triple {20870#(<= ~counter~0 8)} assume true; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,356 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {20870#(<= ~counter~0 8)} {20870#(<= ~counter~0 8)} #61#return; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,357 INFO L272 TraceCheckUtils]: 214: Hoare triple {20870#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,357 INFO L290 TraceCheckUtils]: 215: Hoare triple {20870#(<= ~counter~0 8)} ~cond := #in~cond; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,357 INFO L290 TraceCheckUtils]: 216: Hoare triple {20870#(<= ~counter~0 8)} assume !(0 == ~cond); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,357 INFO L290 TraceCheckUtils]: 217: Hoare triple {20870#(<= ~counter~0 8)} assume true; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,358 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {20870#(<= ~counter~0 8)} {20870#(<= ~counter~0 8)} #63#return; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,358 INFO L272 TraceCheckUtils]: 219: Hoare triple {20870#(<= ~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)); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,358 INFO L290 TraceCheckUtils]: 220: Hoare triple {20870#(<= ~counter~0 8)} ~cond := #in~cond; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,359 INFO L290 TraceCheckUtils]: 221: Hoare triple {20870#(<= ~counter~0 8)} assume !(0 == ~cond); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,359 INFO L290 TraceCheckUtils]: 222: Hoare triple {20870#(<= ~counter~0 8)} assume true; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,359 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {20870#(<= ~counter~0 8)} {20870#(<= ~counter~0 8)} #65#return; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,360 INFO L272 TraceCheckUtils]: 224: Hoare triple {20870#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,360 INFO L290 TraceCheckUtils]: 225: Hoare triple {20870#(<= ~counter~0 8)} ~cond := #in~cond; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,360 INFO L290 TraceCheckUtils]: 226: Hoare triple {20870#(<= ~counter~0 8)} assume !(0 == ~cond); {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,361 INFO L290 TraceCheckUtils]: 227: Hoare triple {20870#(<= ~counter~0 8)} assume true; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,361 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {20870#(<= ~counter~0 8)} {20870#(<= ~counter~0 8)} #67#return; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,361 INFO L290 TraceCheckUtils]: 229: Hoare triple {20870#(<= ~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; {20870#(<= ~counter~0 8)} is VALID [2022-04-07 13:05:58,362 INFO L290 TraceCheckUtils]: 230: Hoare triple {20870#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,362 INFO L290 TraceCheckUtils]: 231: Hoare triple {20955#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,363 INFO L272 TraceCheckUtils]: 232: Hoare triple {20955#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,363 INFO L290 TraceCheckUtils]: 233: Hoare triple {20955#(<= ~counter~0 9)} ~cond := #in~cond; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,363 INFO L290 TraceCheckUtils]: 234: Hoare triple {20955#(<= ~counter~0 9)} assume !(0 == ~cond); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,364 INFO L290 TraceCheckUtils]: 235: Hoare triple {20955#(<= ~counter~0 9)} assume true; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,364 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20955#(<= ~counter~0 9)} {20955#(<= ~counter~0 9)} #59#return; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,365 INFO L272 TraceCheckUtils]: 237: Hoare triple {20955#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,365 INFO L290 TraceCheckUtils]: 238: Hoare triple {20955#(<= ~counter~0 9)} ~cond := #in~cond; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,365 INFO L290 TraceCheckUtils]: 239: Hoare triple {20955#(<= ~counter~0 9)} assume !(0 == ~cond); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,365 INFO L290 TraceCheckUtils]: 240: Hoare triple {20955#(<= ~counter~0 9)} assume true; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,366 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {20955#(<= ~counter~0 9)} {20955#(<= ~counter~0 9)} #61#return; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,366 INFO L272 TraceCheckUtils]: 242: Hoare triple {20955#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,366 INFO L290 TraceCheckUtils]: 243: Hoare triple {20955#(<= ~counter~0 9)} ~cond := #in~cond; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,367 INFO L290 TraceCheckUtils]: 244: Hoare triple {20955#(<= ~counter~0 9)} assume !(0 == ~cond); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,367 INFO L290 TraceCheckUtils]: 245: Hoare triple {20955#(<= ~counter~0 9)} assume true; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,367 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {20955#(<= ~counter~0 9)} {20955#(<= ~counter~0 9)} #63#return; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,368 INFO L272 TraceCheckUtils]: 247: Hoare triple {20955#(<= ~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)); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,368 INFO L290 TraceCheckUtils]: 248: Hoare triple {20955#(<= ~counter~0 9)} ~cond := #in~cond; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,368 INFO L290 TraceCheckUtils]: 249: Hoare triple {20955#(<= ~counter~0 9)} assume !(0 == ~cond); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,369 INFO L290 TraceCheckUtils]: 250: Hoare triple {20955#(<= ~counter~0 9)} assume true; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,369 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {20955#(<= ~counter~0 9)} {20955#(<= ~counter~0 9)} #65#return; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,369 INFO L272 TraceCheckUtils]: 252: Hoare triple {20955#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,370 INFO L290 TraceCheckUtils]: 253: Hoare triple {20955#(<= ~counter~0 9)} ~cond := #in~cond; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,370 INFO L290 TraceCheckUtils]: 254: Hoare triple {20955#(<= ~counter~0 9)} assume !(0 == ~cond); {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,370 INFO L290 TraceCheckUtils]: 255: Hoare triple {20955#(<= ~counter~0 9)} assume true; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,371 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {20955#(<= ~counter~0 9)} {20955#(<= ~counter~0 9)} #67#return; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,371 INFO L290 TraceCheckUtils]: 257: Hoare triple {20955#(<= ~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; {20955#(<= ~counter~0 9)} is VALID [2022-04-07 13:05:58,372 INFO L290 TraceCheckUtils]: 258: Hoare triple {20955#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,372 INFO L290 TraceCheckUtils]: 259: Hoare triple {21040#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,372 INFO L272 TraceCheckUtils]: 260: Hoare triple {21040#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,373 INFO L290 TraceCheckUtils]: 261: Hoare triple {21040#(<= ~counter~0 10)} ~cond := #in~cond; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,373 INFO L290 TraceCheckUtils]: 262: Hoare triple {21040#(<= ~counter~0 10)} assume !(0 == ~cond); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,373 INFO L290 TraceCheckUtils]: 263: Hoare triple {21040#(<= ~counter~0 10)} assume true; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,374 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {21040#(<= ~counter~0 10)} {21040#(<= ~counter~0 10)} #59#return; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,374 INFO L272 TraceCheckUtils]: 265: Hoare triple {21040#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,374 INFO L290 TraceCheckUtils]: 266: Hoare triple {21040#(<= ~counter~0 10)} ~cond := #in~cond; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,375 INFO L290 TraceCheckUtils]: 267: Hoare triple {21040#(<= ~counter~0 10)} assume !(0 == ~cond); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,375 INFO L290 TraceCheckUtils]: 268: Hoare triple {21040#(<= ~counter~0 10)} assume true; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,375 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {21040#(<= ~counter~0 10)} {21040#(<= ~counter~0 10)} #61#return; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,376 INFO L272 TraceCheckUtils]: 270: Hoare triple {21040#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,376 INFO L290 TraceCheckUtils]: 271: Hoare triple {21040#(<= ~counter~0 10)} ~cond := #in~cond; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,376 INFO L290 TraceCheckUtils]: 272: Hoare triple {21040#(<= ~counter~0 10)} assume !(0 == ~cond); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,376 INFO L290 TraceCheckUtils]: 273: Hoare triple {21040#(<= ~counter~0 10)} assume true; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,377 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {21040#(<= ~counter~0 10)} {21040#(<= ~counter~0 10)} #63#return; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,377 INFO L272 TraceCheckUtils]: 275: Hoare triple {21040#(<= ~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)); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,378 INFO L290 TraceCheckUtils]: 276: Hoare triple {21040#(<= ~counter~0 10)} ~cond := #in~cond; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,378 INFO L290 TraceCheckUtils]: 277: Hoare triple {21040#(<= ~counter~0 10)} assume !(0 == ~cond); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,378 INFO L290 TraceCheckUtils]: 278: Hoare triple {21040#(<= ~counter~0 10)} assume true; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,379 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {21040#(<= ~counter~0 10)} {21040#(<= ~counter~0 10)} #65#return; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,379 INFO L272 TraceCheckUtils]: 280: Hoare triple {21040#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,379 INFO L290 TraceCheckUtils]: 281: Hoare triple {21040#(<= ~counter~0 10)} ~cond := #in~cond; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,380 INFO L290 TraceCheckUtils]: 282: Hoare triple {21040#(<= ~counter~0 10)} assume !(0 == ~cond); {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,380 INFO L290 TraceCheckUtils]: 283: Hoare triple {21040#(<= ~counter~0 10)} assume true; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,380 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {21040#(<= ~counter~0 10)} {21040#(<= ~counter~0 10)} #67#return; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,380 INFO L290 TraceCheckUtils]: 285: Hoare triple {21040#(<= ~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; {21040#(<= ~counter~0 10)} is VALID [2022-04-07 13:05:58,381 INFO L290 TraceCheckUtils]: 286: Hoare triple {21040#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21125#(<= |main_#t~post5| 10)} is VALID [2022-04-07 13:05:58,381 INFO L290 TraceCheckUtils]: 287: Hoare triple {21125#(<= |main_#t~post5| 10)} assume !(#t~post5 < 50);havoc #t~post5; {20252#false} is VALID [2022-04-07 13:05:58,381 INFO L272 TraceCheckUtils]: 288: Hoare triple {20252#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20252#false} is VALID [2022-04-07 13:05:58,381 INFO L290 TraceCheckUtils]: 289: Hoare triple {20252#false} ~cond := #in~cond; {20252#false} is VALID [2022-04-07 13:05:58,381 INFO L290 TraceCheckUtils]: 290: Hoare triple {20252#false} assume !(0 == ~cond); {20252#false} is VALID [2022-04-07 13:05:58,381 INFO L290 TraceCheckUtils]: 291: Hoare triple {20252#false} assume true; {20252#false} is VALID [2022-04-07 13:05:58,382 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {20252#false} {20252#false} #69#return; {20252#false} is VALID [2022-04-07 13:05:58,382 INFO L272 TraceCheckUtils]: 293: Hoare triple {20252#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {20252#false} is VALID [2022-04-07 13:05:58,382 INFO L290 TraceCheckUtils]: 294: Hoare triple {20252#false} ~cond := #in~cond; {20252#false} is VALID [2022-04-07 13:05:58,382 INFO L290 TraceCheckUtils]: 295: Hoare triple {20252#false} assume 0 == ~cond; {20252#false} is VALID [2022-04-07 13:05:58,382 INFO L290 TraceCheckUtils]: 296: Hoare triple {20252#false} assume !false; {20252#false} is VALID [2022-04-07 13:05:58,384 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-07 13:05:58,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:05:59,590 INFO L290 TraceCheckUtils]: 296: Hoare triple {20252#false} assume !false; {20252#false} is VALID [2022-04-07 13:05:59,590 INFO L290 TraceCheckUtils]: 295: Hoare triple {20252#false} assume 0 == ~cond; {20252#false} is VALID [2022-04-07 13:05:59,590 INFO L290 TraceCheckUtils]: 294: Hoare triple {20252#false} ~cond := #in~cond; {20252#false} is VALID [2022-04-07 13:05:59,590 INFO L272 TraceCheckUtils]: 293: Hoare triple {20252#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {20252#false} is VALID [2022-04-07 13:05:59,590 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {20251#true} {20252#false} #69#return; {20252#false} is VALID [2022-04-07 13:05:59,590 INFO L290 TraceCheckUtils]: 291: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,590 INFO L290 TraceCheckUtils]: 290: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,590 INFO L290 TraceCheckUtils]: 289: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,590 INFO L272 TraceCheckUtils]: 288: Hoare triple {20252#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,590 INFO L290 TraceCheckUtils]: 287: Hoare triple {21183#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {20252#false} is VALID [2022-04-07 13:05:59,591 INFO L290 TraceCheckUtils]: 286: Hoare triple {21187#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21183#(< |main_#t~post5| 50)} is VALID [2022-04-07 13:05:59,591 INFO L290 TraceCheckUtils]: 285: Hoare triple {21187#(< ~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; {21187#(< ~counter~0 50)} is VALID [2022-04-07 13:05:59,592 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {20251#true} {21187#(< ~counter~0 50)} #67#return; {21187#(< ~counter~0 50)} is VALID [2022-04-07 13:05:59,592 INFO L290 TraceCheckUtils]: 283: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,592 INFO L290 TraceCheckUtils]: 282: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,592 INFO L290 TraceCheckUtils]: 281: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,592 INFO L272 TraceCheckUtils]: 280: Hoare triple {21187#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,592 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {20251#true} {21187#(< ~counter~0 50)} #65#return; {21187#(< ~counter~0 50)} is VALID [2022-04-07 13:05:59,592 INFO L290 TraceCheckUtils]: 278: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,592 INFO L290 TraceCheckUtils]: 277: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,592 INFO L290 TraceCheckUtils]: 276: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,592 INFO L272 TraceCheckUtils]: 275: Hoare triple {21187#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,593 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {20251#true} {21187#(< ~counter~0 50)} #63#return; {21187#(< ~counter~0 50)} is VALID [2022-04-07 13:05:59,593 INFO L290 TraceCheckUtils]: 273: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,593 INFO L290 TraceCheckUtils]: 272: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,593 INFO L290 TraceCheckUtils]: 271: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,593 INFO L272 TraceCheckUtils]: 270: Hoare triple {21187#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,594 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {20251#true} {21187#(< ~counter~0 50)} #61#return; {21187#(< ~counter~0 50)} is VALID [2022-04-07 13:05:59,594 INFO L290 TraceCheckUtils]: 268: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,594 INFO L290 TraceCheckUtils]: 267: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,594 INFO L290 TraceCheckUtils]: 266: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,594 INFO L272 TraceCheckUtils]: 265: Hoare triple {21187#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,594 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {20251#true} {21187#(< ~counter~0 50)} #59#return; {21187#(< ~counter~0 50)} is VALID [2022-04-07 13:05:59,594 INFO L290 TraceCheckUtils]: 263: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,594 INFO L290 TraceCheckUtils]: 262: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,594 INFO L290 TraceCheckUtils]: 261: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,594 INFO L272 TraceCheckUtils]: 260: Hoare triple {21187#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,595 INFO L290 TraceCheckUtils]: 259: Hoare triple {21187#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {21187#(< ~counter~0 50)} is VALID [2022-04-07 13:05:59,596 INFO L290 TraceCheckUtils]: 258: Hoare triple {21272#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21187#(< ~counter~0 50)} is VALID [2022-04-07 13:05:59,596 INFO L290 TraceCheckUtils]: 257: Hoare triple {21272#(< ~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; {21272#(< ~counter~0 49)} is VALID [2022-04-07 13:05:59,596 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {20251#true} {21272#(< ~counter~0 49)} #67#return; {21272#(< ~counter~0 49)} is VALID [2022-04-07 13:05:59,596 INFO L290 TraceCheckUtils]: 255: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,596 INFO L290 TraceCheckUtils]: 254: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,596 INFO L290 TraceCheckUtils]: 253: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,597 INFO L272 TraceCheckUtils]: 252: Hoare triple {21272#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,597 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {20251#true} {21272#(< ~counter~0 49)} #65#return; {21272#(< ~counter~0 49)} is VALID [2022-04-07 13:05:59,597 INFO L290 TraceCheckUtils]: 250: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,597 INFO L290 TraceCheckUtils]: 249: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,597 INFO L290 TraceCheckUtils]: 248: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,597 INFO L272 TraceCheckUtils]: 247: Hoare triple {21272#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,598 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {20251#true} {21272#(< ~counter~0 49)} #63#return; {21272#(< ~counter~0 49)} is VALID [2022-04-07 13:05:59,598 INFO L290 TraceCheckUtils]: 245: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,598 INFO L290 TraceCheckUtils]: 244: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,598 INFO L290 TraceCheckUtils]: 243: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,598 INFO L272 TraceCheckUtils]: 242: Hoare triple {21272#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,598 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {20251#true} {21272#(< ~counter~0 49)} #61#return; {21272#(< ~counter~0 49)} is VALID [2022-04-07 13:05:59,598 INFO L290 TraceCheckUtils]: 240: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,598 INFO L290 TraceCheckUtils]: 239: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,598 INFO L290 TraceCheckUtils]: 238: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,599 INFO L272 TraceCheckUtils]: 237: Hoare triple {21272#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,599 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20251#true} {21272#(< ~counter~0 49)} #59#return; {21272#(< ~counter~0 49)} is VALID [2022-04-07 13:05:59,599 INFO L290 TraceCheckUtils]: 235: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,600 INFO L290 TraceCheckUtils]: 234: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,600 INFO L290 TraceCheckUtils]: 233: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,600 INFO L272 TraceCheckUtils]: 232: Hoare triple {21272#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,600 INFO L290 TraceCheckUtils]: 231: Hoare triple {21272#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {21272#(< ~counter~0 49)} is VALID [2022-04-07 13:05:59,601 INFO L290 TraceCheckUtils]: 230: Hoare triple {21357#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21272#(< ~counter~0 49)} is VALID [2022-04-07 13:05:59,602 INFO L290 TraceCheckUtils]: 229: Hoare triple {21357#(< ~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; {21357#(< ~counter~0 48)} is VALID [2022-04-07 13:05:59,602 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {20251#true} {21357#(< ~counter~0 48)} #67#return; {21357#(< ~counter~0 48)} is VALID [2022-04-07 13:05:59,602 INFO L290 TraceCheckUtils]: 227: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,602 INFO L290 TraceCheckUtils]: 226: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,603 INFO L290 TraceCheckUtils]: 225: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,603 INFO L272 TraceCheckUtils]: 224: Hoare triple {21357#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,603 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {20251#true} {21357#(< ~counter~0 48)} #65#return; {21357#(< ~counter~0 48)} is VALID [2022-04-07 13:05:59,603 INFO L290 TraceCheckUtils]: 222: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,603 INFO L290 TraceCheckUtils]: 221: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,604 INFO L290 TraceCheckUtils]: 220: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,604 INFO L272 TraceCheckUtils]: 219: Hoare triple {21357#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,604 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {20251#true} {21357#(< ~counter~0 48)} #63#return; {21357#(< ~counter~0 48)} is VALID [2022-04-07 13:05:59,604 INFO L290 TraceCheckUtils]: 217: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,604 INFO L290 TraceCheckUtils]: 216: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,604 INFO L290 TraceCheckUtils]: 215: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,605 INFO L272 TraceCheckUtils]: 214: Hoare triple {21357#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,605 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {20251#true} {21357#(< ~counter~0 48)} #61#return; {21357#(< ~counter~0 48)} is VALID [2022-04-07 13:05:59,605 INFO L290 TraceCheckUtils]: 212: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,605 INFO L290 TraceCheckUtils]: 211: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,605 INFO L290 TraceCheckUtils]: 210: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,606 INFO L272 TraceCheckUtils]: 209: Hoare triple {21357#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,606 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {20251#true} {21357#(< ~counter~0 48)} #59#return; {21357#(< ~counter~0 48)} is VALID [2022-04-07 13:05:59,606 INFO L290 TraceCheckUtils]: 207: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,606 INFO L290 TraceCheckUtils]: 206: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,606 INFO L290 TraceCheckUtils]: 205: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,606 INFO L272 TraceCheckUtils]: 204: Hoare triple {21357#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,607 INFO L290 TraceCheckUtils]: 203: Hoare triple {21357#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {21357#(< ~counter~0 48)} is VALID [2022-04-07 13:05:59,608 INFO L290 TraceCheckUtils]: 202: Hoare triple {21442#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21357#(< ~counter~0 48)} is VALID [2022-04-07 13:05:59,608 INFO L290 TraceCheckUtils]: 201: Hoare triple {21442#(< ~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; {21442#(< ~counter~0 47)} is VALID [2022-04-07 13:05:59,609 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20251#true} {21442#(< ~counter~0 47)} #67#return; {21442#(< ~counter~0 47)} is VALID [2022-04-07 13:05:59,609 INFO L290 TraceCheckUtils]: 199: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,609 INFO L290 TraceCheckUtils]: 198: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,609 INFO L290 TraceCheckUtils]: 197: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,609 INFO L272 TraceCheckUtils]: 196: Hoare triple {21442#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,610 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {20251#true} {21442#(< ~counter~0 47)} #65#return; {21442#(< ~counter~0 47)} is VALID [2022-04-07 13:05:59,610 INFO L290 TraceCheckUtils]: 194: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,610 INFO L290 TraceCheckUtils]: 193: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,610 INFO L290 TraceCheckUtils]: 192: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,610 INFO L272 TraceCheckUtils]: 191: Hoare triple {21442#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,611 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {20251#true} {21442#(< ~counter~0 47)} #63#return; {21442#(< ~counter~0 47)} is VALID [2022-04-07 13:05:59,611 INFO L290 TraceCheckUtils]: 189: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,611 INFO L290 TraceCheckUtils]: 188: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,611 INFO L290 TraceCheckUtils]: 187: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,611 INFO L272 TraceCheckUtils]: 186: Hoare triple {21442#(< ~counter~0 47)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,612 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20251#true} {21442#(< ~counter~0 47)} #61#return; {21442#(< ~counter~0 47)} is VALID [2022-04-07 13:05:59,612 INFO L290 TraceCheckUtils]: 184: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,612 INFO L290 TraceCheckUtils]: 183: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,612 INFO L290 TraceCheckUtils]: 182: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,612 INFO L272 TraceCheckUtils]: 181: Hoare triple {21442#(< ~counter~0 47)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,613 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {20251#true} {21442#(< ~counter~0 47)} #59#return; {21442#(< ~counter~0 47)} is VALID [2022-04-07 13:05:59,613 INFO L290 TraceCheckUtils]: 179: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,613 INFO L290 TraceCheckUtils]: 178: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,613 INFO L290 TraceCheckUtils]: 177: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,613 INFO L272 TraceCheckUtils]: 176: Hoare triple {21442#(< ~counter~0 47)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,613 INFO L290 TraceCheckUtils]: 175: Hoare triple {21442#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {21442#(< ~counter~0 47)} is VALID [2022-04-07 13:05:59,614 INFO L290 TraceCheckUtils]: 174: Hoare triple {21527#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21442#(< ~counter~0 47)} is VALID [2022-04-07 13:05:59,615 INFO L290 TraceCheckUtils]: 173: Hoare triple {21527#(< ~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; {21527#(< ~counter~0 46)} is VALID [2022-04-07 13:05:59,615 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20251#true} {21527#(< ~counter~0 46)} #67#return; {21527#(< ~counter~0 46)} is VALID [2022-04-07 13:05:59,615 INFO L290 TraceCheckUtils]: 171: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,616 INFO L290 TraceCheckUtils]: 170: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,616 INFO L290 TraceCheckUtils]: 169: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,616 INFO L272 TraceCheckUtils]: 168: Hoare triple {21527#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,616 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {20251#true} {21527#(< ~counter~0 46)} #65#return; {21527#(< ~counter~0 46)} is VALID [2022-04-07 13:05:59,616 INFO L290 TraceCheckUtils]: 166: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,616 INFO L290 TraceCheckUtils]: 165: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,617 INFO L290 TraceCheckUtils]: 164: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,617 INFO L272 TraceCheckUtils]: 163: Hoare triple {21527#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,617 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {20251#true} {21527#(< ~counter~0 46)} #63#return; {21527#(< ~counter~0 46)} is VALID [2022-04-07 13:05:59,617 INFO L290 TraceCheckUtils]: 161: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,617 INFO L290 TraceCheckUtils]: 160: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,617 INFO L290 TraceCheckUtils]: 159: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,617 INFO L272 TraceCheckUtils]: 158: Hoare triple {21527#(< ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,618 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20251#true} {21527#(< ~counter~0 46)} #61#return; {21527#(< ~counter~0 46)} is VALID [2022-04-07 13:05:59,618 INFO L290 TraceCheckUtils]: 156: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,618 INFO L290 TraceCheckUtils]: 155: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,618 INFO L290 TraceCheckUtils]: 154: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,618 INFO L272 TraceCheckUtils]: 153: Hoare triple {21527#(< ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,619 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {20251#true} {21527#(< ~counter~0 46)} #59#return; {21527#(< ~counter~0 46)} is VALID [2022-04-07 13:05:59,619 INFO L290 TraceCheckUtils]: 151: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,619 INFO L290 TraceCheckUtils]: 150: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,619 INFO L290 TraceCheckUtils]: 149: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,619 INFO L272 TraceCheckUtils]: 148: Hoare triple {21527#(< ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,620 INFO L290 TraceCheckUtils]: 147: Hoare triple {21527#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {21527#(< ~counter~0 46)} is VALID [2022-04-07 13:05:59,621 INFO L290 TraceCheckUtils]: 146: Hoare triple {21612#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21527#(< ~counter~0 46)} is VALID [2022-04-07 13:05:59,621 INFO L290 TraceCheckUtils]: 145: Hoare triple {21612#(< ~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; {21612#(< ~counter~0 45)} is VALID [2022-04-07 13:05:59,622 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20251#true} {21612#(< ~counter~0 45)} #67#return; {21612#(< ~counter~0 45)} is VALID [2022-04-07 13:05:59,622 INFO L290 TraceCheckUtils]: 143: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,622 INFO L290 TraceCheckUtils]: 142: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,622 INFO L290 TraceCheckUtils]: 141: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,622 INFO L272 TraceCheckUtils]: 140: Hoare triple {21612#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,622 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {20251#true} {21612#(< ~counter~0 45)} #65#return; {21612#(< ~counter~0 45)} is VALID [2022-04-07 13:05:59,623 INFO L290 TraceCheckUtils]: 138: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,623 INFO L290 TraceCheckUtils]: 137: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,623 INFO L290 TraceCheckUtils]: 136: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,623 INFO L272 TraceCheckUtils]: 135: Hoare triple {21612#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,623 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20251#true} {21612#(< ~counter~0 45)} #63#return; {21612#(< ~counter~0 45)} is VALID [2022-04-07 13:05:59,623 INFO L290 TraceCheckUtils]: 133: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,623 INFO L290 TraceCheckUtils]: 132: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,624 INFO L290 TraceCheckUtils]: 131: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,624 INFO L272 TraceCheckUtils]: 130: Hoare triple {21612#(< ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,624 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20251#true} {21612#(< ~counter~0 45)} #61#return; {21612#(< ~counter~0 45)} is VALID [2022-04-07 13:05:59,624 INFO L290 TraceCheckUtils]: 128: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,624 INFO L290 TraceCheckUtils]: 127: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,624 INFO L290 TraceCheckUtils]: 126: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,625 INFO L272 TraceCheckUtils]: 125: Hoare triple {21612#(< ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,625 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20251#true} {21612#(< ~counter~0 45)} #59#return; {21612#(< ~counter~0 45)} is VALID [2022-04-07 13:05:59,625 INFO L290 TraceCheckUtils]: 123: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,625 INFO L290 TraceCheckUtils]: 122: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,625 INFO L290 TraceCheckUtils]: 121: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,625 INFO L272 TraceCheckUtils]: 120: Hoare triple {21612#(< ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,626 INFO L290 TraceCheckUtils]: 119: Hoare triple {21612#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {21612#(< ~counter~0 45)} is VALID [2022-04-07 13:05:59,627 INFO L290 TraceCheckUtils]: 118: Hoare triple {21697#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21612#(< ~counter~0 45)} is VALID [2022-04-07 13:05:59,627 INFO L290 TraceCheckUtils]: 117: Hoare triple {21697#(< ~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; {21697#(< ~counter~0 44)} is VALID [2022-04-07 13:05:59,628 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20251#true} {21697#(< ~counter~0 44)} #67#return; {21697#(< ~counter~0 44)} is VALID [2022-04-07 13:05:59,628 INFO L290 TraceCheckUtils]: 115: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,628 INFO L290 TraceCheckUtils]: 114: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,628 INFO L290 TraceCheckUtils]: 113: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,628 INFO L272 TraceCheckUtils]: 112: Hoare triple {21697#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,628 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20251#true} {21697#(< ~counter~0 44)} #65#return; {21697#(< ~counter~0 44)} is VALID [2022-04-07 13:05:59,629 INFO L290 TraceCheckUtils]: 110: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,629 INFO L290 TraceCheckUtils]: 109: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,629 INFO L290 TraceCheckUtils]: 108: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,629 INFO L272 TraceCheckUtils]: 107: Hoare triple {21697#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,629 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20251#true} {21697#(< ~counter~0 44)} #63#return; {21697#(< ~counter~0 44)} is VALID [2022-04-07 13:05:59,629 INFO L290 TraceCheckUtils]: 105: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,629 INFO L290 TraceCheckUtils]: 104: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,630 INFO L290 TraceCheckUtils]: 103: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,630 INFO L272 TraceCheckUtils]: 102: Hoare triple {21697#(< ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,630 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20251#true} {21697#(< ~counter~0 44)} #61#return; {21697#(< ~counter~0 44)} is VALID [2022-04-07 13:05:59,630 INFO L290 TraceCheckUtils]: 100: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,630 INFO L290 TraceCheckUtils]: 99: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,630 INFO L290 TraceCheckUtils]: 98: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,630 INFO L272 TraceCheckUtils]: 97: Hoare triple {21697#(< ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,631 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20251#true} {21697#(< ~counter~0 44)} #59#return; {21697#(< ~counter~0 44)} is VALID [2022-04-07 13:05:59,631 INFO L290 TraceCheckUtils]: 95: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,631 INFO L290 TraceCheckUtils]: 94: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,631 INFO L290 TraceCheckUtils]: 93: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,631 INFO L272 TraceCheckUtils]: 92: Hoare triple {21697#(< ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,631 INFO L290 TraceCheckUtils]: 91: Hoare triple {21697#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {21697#(< ~counter~0 44)} is VALID [2022-04-07 13:05:59,632 INFO L290 TraceCheckUtils]: 90: Hoare triple {21782#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21697#(< ~counter~0 44)} is VALID [2022-04-07 13:05:59,632 INFO L290 TraceCheckUtils]: 89: Hoare triple {21782#(< ~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; {21782#(< ~counter~0 43)} is VALID [2022-04-07 13:05:59,633 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20251#true} {21782#(< ~counter~0 43)} #67#return; {21782#(< ~counter~0 43)} is VALID [2022-04-07 13:05:59,633 INFO L290 TraceCheckUtils]: 87: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,633 INFO L290 TraceCheckUtils]: 86: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,633 INFO L290 TraceCheckUtils]: 85: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,633 INFO L272 TraceCheckUtils]: 84: Hoare triple {21782#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,634 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {20251#true} {21782#(< ~counter~0 43)} #65#return; {21782#(< ~counter~0 43)} is VALID [2022-04-07 13:05:59,634 INFO L290 TraceCheckUtils]: 82: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,634 INFO L290 TraceCheckUtils]: 81: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,634 INFO L290 TraceCheckUtils]: 80: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,634 INFO L272 TraceCheckUtils]: 79: Hoare triple {21782#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,634 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20251#true} {21782#(< ~counter~0 43)} #63#return; {21782#(< ~counter~0 43)} is VALID [2022-04-07 13:05:59,635 INFO L290 TraceCheckUtils]: 77: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,635 INFO L290 TraceCheckUtils]: 75: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,635 INFO L272 TraceCheckUtils]: 74: Hoare triple {21782#(< ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,635 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20251#true} {21782#(< ~counter~0 43)} #61#return; {21782#(< ~counter~0 43)} is VALID [2022-04-07 13:05:59,635 INFO L290 TraceCheckUtils]: 72: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,635 INFO L290 TraceCheckUtils]: 71: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,635 INFO L290 TraceCheckUtils]: 70: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,636 INFO L272 TraceCheckUtils]: 69: Hoare triple {21782#(< ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,636 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20251#true} {21782#(< ~counter~0 43)} #59#return; {21782#(< ~counter~0 43)} is VALID [2022-04-07 13:05:59,636 INFO L290 TraceCheckUtils]: 67: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,636 INFO L290 TraceCheckUtils]: 65: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,636 INFO L272 TraceCheckUtils]: 64: Hoare triple {21782#(< ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,637 INFO L290 TraceCheckUtils]: 63: Hoare triple {21782#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {21782#(< ~counter~0 43)} is VALID [2022-04-07 13:05:59,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {21867#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21782#(< ~counter~0 43)} is VALID [2022-04-07 13:05:59,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {21867#(< ~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; {21867#(< ~counter~0 42)} is VALID [2022-04-07 13:05:59,638 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20251#true} {21867#(< ~counter~0 42)} #67#return; {21867#(< ~counter~0 42)} is VALID [2022-04-07 13:05:59,638 INFO L290 TraceCheckUtils]: 59: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,639 INFO L290 TraceCheckUtils]: 57: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,639 INFO L272 TraceCheckUtils]: 56: Hoare triple {21867#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,639 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20251#true} {21867#(< ~counter~0 42)} #65#return; {21867#(< ~counter~0 42)} is VALID [2022-04-07 13:05:59,639 INFO L290 TraceCheckUtils]: 54: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,639 INFO L290 TraceCheckUtils]: 53: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {21867#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,640 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20251#true} {21867#(< ~counter~0 42)} #63#return; {21867#(< ~counter~0 42)} is VALID [2022-04-07 13:05:59,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,640 INFO L290 TraceCheckUtils]: 47: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,640 INFO L272 TraceCheckUtils]: 46: Hoare triple {21867#(< ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,640 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20251#true} {21867#(< ~counter~0 42)} #61#return; {21867#(< ~counter~0 42)} is VALID [2022-04-07 13:05:59,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,641 INFO L272 TraceCheckUtils]: 41: Hoare triple {21867#(< ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,641 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20251#true} {21867#(< ~counter~0 42)} #59#return; {21867#(< ~counter~0 42)} is VALID [2022-04-07 13:05:59,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,642 INFO L272 TraceCheckUtils]: 36: Hoare triple {21867#(< ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {21867#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {21867#(< ~counter~0 42)} is VALID [2022-04-07 13:05:59,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {21952#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21867#(< ~counter~0 42)} is VALID [2022-04-07 13:05:59,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {21952#(< ~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; {21952#(< ~counter~0 41)} is VALID [2022-04-07 13:05:59,644 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20251#true} {21952#(< ~counter~0 41)} #67#return; {21952#(< ~counter~0 41)} is VALID [2022-04-07 13:05:59,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,644 INFO L290 TraceCheckUtils]: 30: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,644 INFO L290 TraceCheckUtils]: 29: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,644 INFO L272 TraceCheckUtils]: 28: Hoare triple {21952#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,645 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20251#true} {21952#(< ~counter~0 41)} #65#return; {21952#(< ~counter~0 41)} is VALID [2022-04-07 13:05:59,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,645 INFO L272 TraceCheckUtils]: 23: Hoare triple {21952#(< ~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)); {20251#true} is VALID [2022-04-07 13:05:59,645 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20251#true} {21952#(< ~counter~0 41)} #63#return; {21952#(< ~counter~0 41)} is VALID [2022-04-07 13:05:59,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,646 INFO L272 TraceCheckUtils]: 18: Hoare triple {21952#(< ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,646 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20251#true} {21952#(< ~counter~0 41)} #61#return; {21952#(< ~counter~0 41)} is VALID [2022-04-07 13:05:59,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,646 INFO L272 TraceCheckUtils]: 13: Hoare triple {21952#(< ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,647 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20251#true} {21952#(< ~counter~0 41)} #59#return; {21952#(< ~counter~0 41)} is VALID [2022-04-07 13:05:59,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-04-07 13:05:59,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {20251#true} assume !(0 == ~cond); {20251#true} is VALID [2022-04-07 13:05:59,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {20251#true} ~cond := #in~cond; {20251#true} is VALID [2022-04-07 13:05:59,647 INFO L272 TraceCheckUtils]: 8: Hoare triple {21952#(< ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20251#true} is VALID [2022-04-07 13:05:59,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {21952#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {21952#(< ~counter~0 41)} is VALID [2022-04-07 13:05:59,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {22037#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21952#(< ~counter~0 41)} is VALID [2022-04-07 13:05:59,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {22037#(< ~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; {22037#(< ~counter~0 40)} is VALID [2022-04-07 13:05:59,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {22037#(< ~counter~0 40)} call #t~ret6 := main(); {22037#(< ~counter~0 40)} is VALID [2022-04-07 13:05:59,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22037#(< ~counter~0 40)} {20251#true} #81#return; {22037#(< ~counter~0 40)} is VALID [2022-04-07 13:05:59,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {22037#(< ~counter~0 40)} assume true; {22037#(< ~counter~0 40)} is VALID [2022-04-07 13:05:59,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#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; {22037#(< ~counter~0 40)} is VALID [2022-04-07 13:05:59,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {20251#true} call ULTIMATE.init(); {20251#true} is VALID [2022-04-07 13:05:59,652 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-07 13:05:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:05:59,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131216872] [2022-04-07 13:05:59,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:05:59,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335439871] [2022-04-07 13:05:59,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335439871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:05:59,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:05:59,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-07 13:05:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062437328] [2022-04-07 13:05:59,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:05:59,654 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-07 13:05:59,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:05:59,654 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-07 13:05:59,963 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-07 13:05:59,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-07 13:05:59,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:05:59,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-07 13:05:59,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-07 13:05:59,965 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-07 13:06:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:05,775 INFO L93 Difference]: Finished difference Result 640 states and 652 transitions. [2022-04-07 13:06:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-07 13:06:05,775 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-07 13:06:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:05,776 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-07 13:06:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 386 transitions. [2022-04-07 13:06:05,786 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-07 13:06:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 386 transitions. [2022-04-07 13:06:05,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 386 transitions. [2022-04-07 13:06:06,250 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-07 13:06:06,274 INFO L225 Difference]: With dead ends: 640 [2022-04-07 13:06:06,274 INFO L226 Difference]: Without dead ends: 630 [2022-04-07 13:06:06,275 INFO L912 BasicCegarLoop]: 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-07 13:06:06,275 INFO L913 BasicCegarLoop]: 131 mSDtfsCounter, 242 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:06,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 532 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-07 13:06:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-04-07 13:06:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2022-04-07 13:06:06,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:06,631 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-07 13:06:06,631 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-07 13:06:06,632 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-07 13:06:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:06,650 INFO L93 Difference]: Finished difference Result 630 states and 631 transitions. [2022-04-07 13:06:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-07 13:06:06,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:06,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:06,652 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-07 13:06:06,653 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-07 13:06:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:06,670 INFO L93 Difference]: Finished difference Result 630 states and 631 transitions. [2022-04-07 13:06:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-07 13:06:06,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:06,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:06,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:06,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:06,673 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-07 13:06:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 631 transitions. [2022-04-07 13:06:06,696 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 631 transitions. Word has length 297 [2022-04-07 13:06:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:06,696 INFO L478 AbstractCegarLoop]: Abstraction has 630 states and 631 transitions. [2022-04-07 13:06:06,696 INFO L479 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-07 13:06:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 631 transitions. [2022-04-07 13:06:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2022-04-07 13:06:06,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:06,709 INFO L499 BasicCegarLoop]: 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-07 13:06:06,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-07 13:06:06,918 WARN L460 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-07 13:06:06,919 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:06,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1616558797, now seen corresponding path program 4 times [2022-04-07 13:06:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:06,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029332650] [2022-04-07 13:06:06,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:06,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:06,953 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:06:06,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790700777] [2022-04-07 13:06:06,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 13:06:06,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:06,957 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:06:06,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-07 13:06:07,246 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 13:06:07,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 13:06:07,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-07 13:06:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:07,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:06:10,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {25134#true} call ULTIMATE.init(); {25134#true} is VALID [2022-04-07 13:06:10,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {25134#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; {25142#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:10,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {25142#(<= ~counter~0 0)} assume true; {25142#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:10,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25142#(<= ~counter~0 0)} {25134#true} #81#return; {25142#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:10,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {25142#(<= ~counter~0 0)} call #t~ret6 := main(); {25142#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:10,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {25142#(<= ~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; {25142#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:10,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {25142#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {25158#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,428 INFO L272 TraceCheckUtils]: 8: Hoare triple {25158#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {25158#(<= ~counter~0 1)} ~cond := #in~cond; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {25158#(<= ~counter~0 1)} assume !(0 == ~cond); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {25158#(<= ~counter~0 1)} assume true; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,429 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {25158#(<= ~counter~0 1)} {25158#(<= ~counter~0 1)} #59#return; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,430 INFO L272 TraceCheckUtils]: 13: Hoare triple {25158#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {25158#(<= ~counter~0 1)} ~cond := #in~cond; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {25158#(<= ~counter~0 1)} assume !(0 == ~cond); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {25158#(<= ~counter~0 1)} assume true; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,431 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25158#(<= ~counter~0 1)} {25158#(<= ~counter~0 1)} #61#return; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,431 INFO L272 TraceCheckUtils]: 18: Hoare triple {25158#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {25158#(<= ~counter~0 1)} ~cond := #in~cond; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {25158#(<= ~counter~0 1)} assume !(0 == ~cond); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {25158#(<= ~counter~0 1)} assume true; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,433 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25158#(<= ~counter~0 1)} {25158#(<= ~counter~0 1)} #63#return; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,433 INFO L272 TraceCheckUtils]: 23: Hoare triple {25158#(<= ~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)); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {25158#(<= ~counter~0 1)} ~cond := #in~cond; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {25158#(<= ~counter~0 1)} assume !(0 == ~cond); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {25158#(<= ~counter~0 1)} assume true; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,434 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25158#(<= ~counter~0 1)} {25158#(<= ~counter~0 1)} #65#return; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,435 INFO L272 TraceCheckUtils]: 28: Hoare triple {25158#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {25158#(<= ~counter~0 1)} ~cond := #in~cond; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {25158#(<= ~counter~0 1)} assume !(0 == ~cond); {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {25158#(<= ~counter~0 1)} assume true; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,436 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25158#(<= ~counter~0 1)} {25158#(<= ~counter~0 1)} #67#return; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {25158#(<= ~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; {25158#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:10,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {25158#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {25243#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,438 INFO L272 TraceCheckUtils]: 36: Hoare triple {25243#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,438 INFO L290 TraceCheckUtils]: 37: Hoare triple {25243#(<= ~counter~0 2)} ~cond := #in~cond; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {25243#(<= ~counter~0 2)} assume !(0 == ~cond); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {25243#(<= ~counter~0 2)} assume true; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,439 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {25243#(<= ~counter~0 2)} {25243#(<= ~counter~0 2)} #59#return; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,440 INFO L272 TraceCheckUtils]: 41: Hoare triple {25243#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,440 INFO L290 TraceCheckUtils]: 42: Hoare triple {25243#(<= ~counter~0 2)} ~cond := #in~cond; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {25243#(<= ~counter~0 2)} assume !(0 == ~cond); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {25243#(<= ~counter~0 2)} assume true; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,441 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25243#(<= ~counter~0 2)} {25243#(<= ~counter~0 2)} #61#return; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,441 INFO L272 TraceCheckUtils]: 46: Hoare triple {25243#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {25243#(<= ~counter~0 2)} ~cond := #in~cond; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,442 INFO L290 TraceCheckUtils]: 48: Hoare triple {25243#(<= ~counter~0 2)} assume !(0 == ~cond); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {25243#(<= ~counter~0 2)} assume true; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,443 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25243#(<= ~counter~0 2)} {25243#(<= ~counter~0 2)} #63#return; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,443 INFO L272 TraceCheckUtils]: 51: Hoare triple {25243#(<= ~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)); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,443 INFO L290 TraceCheckUtils]: 52: Hoare triple {25243#(<= ~counter~0 2)} ~cond := #in~cond; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {25243#(<= ~counter~0 2)} assume !(0 == ~cond); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {25243#(<= ~counter~0 2)} assume true; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,444 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25243#(<= ~counter~0 2)} {25243#(<= ~counter~0 2)} #65#return; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,445 INFO L272 TraceCheckUtils]: 56: Hoare triple {25243#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,445 INFO L290 TraceCheckUtils]: 57: Hoare triple {25243#(<= ~counter~0 2)} ~cond := #in~cond; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {25243#(<= ~counter~0 2)} assume !(0 == ~cond); {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,445 INFO L290 TraceCheckUtils]: 59: Hoare triple {25243#(<= ~counter~0 2)} assume true; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,446 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25243#(<= ~counter~0 2)} {25243#(<= ~counter~0 2)} #67#return; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,446 INFO L290 TraceCheckUtils]: 61: Hoare triple {25243#(<= ~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; {25243#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:10,447 INFO L290 TraceCheckUtils]: 62: Hoare triple {25243#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,447 INFO L290 TraceCheckUtils]: 63: Hoare triple {25328#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,448 INFO L272 TraceCheckUtils]: 64: Hoare triple {25328#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,448 INFO L290 TraceCheckUtils]: 65: Hoare triple {25328#(<= ~counter~0 3)} ~cond := #in~cond; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,448 INFO L290 TraceCheckUtils]: 66: Hoare triple {25328#(<= ~counter~0 3)} assume !(0 == ~cond); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,448 INFO L290 TraceCheckUtils]: 67: Hoare triple {25328#(<= ~counter~0 3)} assume true; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,449 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {25328#(<= ~counter~0 3)} {25328#(<= ~counter~0 3)} #59#return; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,449 INFO L272 TraceCheckUtils]: 69: Hoare triple {25328#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {25328#(<= ~counter~0 3)} ~cond := #in~cond; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {25328#(<= ~counter~0 3)} assume !(0 == ~cond); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,450 INFO L290 TraceCheckUtils]: 72: Hoare triple {25328#(<= ~counter~0 3)} assume true; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,450 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {25328#(<= ~counter~0 3)} {25328#(<= ~counter~0 3)} #61#return; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,451 INFO L272 TraceCheckUtils]: 74: Hoare triple {25328#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {25328#(<= ~counter~0 3)} ~cond := #in~cond; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {25328#(<= ~counter~0 3)} assume !(0 == ~cond); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,452 INFO L290 TraceCheckUtils]: 77: Hoare triple {25328#(<= ~counter~0 3)} assume true; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,452 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {25328#(<= ~counter~0 3)} {25328#(<= ~counter~0 3)} #63#return; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,453 INFO L272 TraceCheckUtils]: 79: Hoare triple {25328#(<= ~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)); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,453 INFO L290 TraceCheckUtils]: 80: Hoare triple {25328#(<= ~counter~0 3)} ~cond := #in~cond; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,453 INFO L290 TraceCheckUtils]: 81: Hoare triple {25328#(<= ~counter~0 3)} assume !(0 == ~cond); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,453 INFO L290 TraceCheckUtils]: 82: Hoare triple {25328#(<= ~counter~0 3)} assume true; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,454 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {25328#(<= ~counter~0 3)} {25328#(<= ~counter~0 3)} #65#return; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,454 INFO L272 TraceCheckUtils]: 84: Hoare triple {25328#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,454 INFO L290 TraceCheckUtils]: 85: Hoare triple {25328#(<= ~counter~0 3)} ~cond := #in~cond; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,455 INFO L290 TraceCheckUtils]: 86: Hoare triple {25328#(<= ~counter~0 3)} assume !(0 == ~cond); {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,455 INFO L290 TraceCheckUtils]: 87: Hoare triple {25328#(<= ~counter~0 3)} assume true; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,455 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {25328#(<= ~counter~0 3)} {25328#(<= ~counter~0 3)} #67#return; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,456 INFO L290 TraceCheckUtils]: 89: Hoare triple {25328#(<= ~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; {25328#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:10,457 INFO L290 TraceCheckUtils]: 90: Hoare triple {25328#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,457 INFO L290 TraceCheckUtils]: 91: Hoare triple {25413#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,457 INFO L272 TraceCheckUtils]: 92: Hoare triple {25413#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,458 INFO L290 TraceCheckUtils]: 93: Hoare triple {25413#(<= ~counter~0 4)} ~cond := #in~cond; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,458 INFO L290 TraceCheckUtils]: 94: Hoare triple {25413#(<= ~counter~0 4)} assume !(0 == ~cond); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,458 INFO L290 TraceCheckUtils]: 95: Hoare triple {25413#(<= ~counter~0 4)} assume true; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,458 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {25413#(<= ~counter~0 4)} {25413#(<= ~counter~0 4)} #59#return; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,459 INFO L272 TraceCheckUtils]: 97: Hoare triple {25413#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,459 INFO L290 TraceCheckUtils]: 98: Hoare triple {25413#(<= ~counter~0 4)} ~cond := #in~cond; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,459 INFO L290 TraceCheckUtils]: 99: Hoare triple {25413#(<= ~counter~0 4)} assume !(0 == ~cond); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,460 INFO L290 TraceCheckUtils]: 100: Hoare triple {25413#(<= ~counter~0 4)} assume true; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,460 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25413#(<= ~counter~0 4)} {25413#(<= ~counter~0 4)} #61#return; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,460 INFO L272 TraceCheckUtils]: 102: Hoare triple {25413#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,461 INFO L290 TraceCheckUtils]: 103: Hoare triple {25413#(<= ~counter~0 4)} ~cond := #in~cond; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,461 INFO L290 TraceCheckUtils]: 104: Hoare triple {25413#(<= ~counter~0 4)} assume !(0 == ~cond); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,461 INFO L290 TraceCheckUtils]: 105: Hoare triple {25413#(<= ~counter~0 4)} assume true; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,462 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {25413#(<= ~counter~0 4)} {25413#(<= ~counter~0 4)} #63#return; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,462 INFO L272 TraceCheckUtils]: 107: Hoare triple {25413#(<= ~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)); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,462 INFO L290 TraceCheckUtils]: 108: Hoare triple {25413#(<= ~counter~0 4)} ~cond := #in~cond; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,463 INFO L290 TraceCheckUtils]: 109: Hoare triple {25413#(<= ~counter~0 4)} assume !(0 == ~cond); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,463 INFO L290 TraceCheckUtils]: 110: Hoare triple {25413#(<= ~counter~0 4)} assume true; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,463 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25413#(<= ~counter~0 4)} {25413#(<= ~counter~0 4)} #65#return; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,464 INFO L272 TraceCheckUtils]: 112: Hoare triple {25413#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,464 INFO L290 TraceCheckUtils]: 113: Hoare triple {25413#(<= ~counter~0 4)} ~cond := #in~cond; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,464 INFO L290 TraceCheckUtils]: 114: Hoare triple {25413#(<= ~counter~0 4)} assume !(0 == ~cond); {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,464 INFO L290 TraceCheckUtils]: 115: Hoare triple {25413#(<= ~counter~0 4)} assume true; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,465 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25413#(<= ~counter~0 4)} {25413#(<= ~counter~0 4)} #67#return; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,465 INFO L290 TraceCheckUtils]: 117: Hoare triple {25413#(<= ~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; {25413#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:10,466 INFO L290 TraceCheckUtils]: 118: Hoare triple {25413#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,466 INFO L290 TraceCheckUtils]: 119: Hoare triple {25498#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,467 INFO L272 TraceCheckUtils]: 120: Hoare triple {25498#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,467 INFO L290 TraceCheckUtils]: 121: Hoare triple {25498#(<= ~counter~0 5)} ~cond := #in~cond; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,467 INFO L290 TraceCheckUtils]: 122: Hoare triple {25498#(<= ~counter~0 5)} assume !(0 == ~cond); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,468 INFO L290 TraceCheckUtils]: 123: Hoare triple {25498#(<= ~counter~0 5)} assume true; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,468 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {25498#(<= ~counter~0 5)} {25498#(<= ~counter~0 5)} #59#return; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,468 INFO L272 TraceCheckUtils]: 125: Hoare triple {25498#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,469 INFO L290 TraceCheckUtils]: 126: Hoare triple {25498#(<= ~counter~0 5)} ~cond := #in~cond; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,469 INFO L290 TraceCheckUtils]: 127: Hoare triple {25498#(<= ~counter~0 5)} assume !(0 == ~cond); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,469 INFO L290 TraceCheckUtils]: 128: Hoare triple {25498#(<= ~counter~0 5)} assume true; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,470 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {25498#(<= ~counter~0 5)} {25498#(<= ~counter~0 5)} #61#return; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,470 INFO L272 TraceCheckUtils]: 130: Hoare triple {25498#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,470 INFO L290 TraceCheckUtils]: 131: Hoare triple {25498#(<= ~counter~0 5)} ~cond := #in~cond; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,470 INFO L290 TraceCheckUtils]: 132: Hoare triple {25498#(<= ~counter~0 5)} assume !(0 == ~cond); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,471 INFO L290 TraceCheckUtils]: 133: Hoare triple {25498#(<= ~counter~0 5)} assume true; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,471 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {25498#(<= ~counter~0 5)} {25498#(<= ~counter~0 5)} #63#return; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,472 INFO L272 TraceCheckUtils]: 135: Hoare triple {25498#(<= ~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)); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,472 INFO L290 TraceCheckUtils]: 136: Hoare triple {25498#(<= ~counter~0 5)} ~cond := #in~cond; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,472 INFO L290 TraceCheckUtils]: 137: Hoare triple {25498#(<= ~counter~0 5)} assume !(0 == ~cond); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,472 INFO L290 TraceCheckUtils]: 138: Hoare triple {25498#(<= ~counter~0 5)} assume true; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,473 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {25498#(<= ~counter~0 5)} {25498#(<= ~counter~0 5)} #65#return; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,473 INFO L272 TraceCheckUtils]: 140: Hoare triple {25498#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,474 INFO L290 TraceCheckUtils]: 141: Hoare triple {25498#(<= ~counter~0 5)} ~cond := #in~cond; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,474 INFO L290 TraceCheckUtils]: 142: Hoare triple {25498#(<= ~counter~0 5)} assume !(0 == ~cond); {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,474 INFO L290 TraceCheckUtils]: 143: Hoare triple {25498#(<= ~counter~0 5)} assume true; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,474 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {25498#(<= ~counter~0 5)} {25498#(<= ~counter~0 5)} #67#return; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,475 INFO L290 TraceCheckUtils]: 145: Hoare triple {25498#(<= ~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; {25498#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:10,476 INFO L290 TraceCheckUtils]: 146: Hoare triple {25498#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,476 INFO L290 TraceCheckUtils]: 147: Hoare triple {25583#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,476 INFO L272 TraceCheckUtils]: 148: Hoare triple {25583#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,477 INFO L290 TraceCheckUtils]: 149: Hoare triple {25583#(<= ~counter~0 6)} ~cond := #in~cond; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,477 INFO L290 TraceCheckUtils]: 150: Hoare triple {25583#(<= ~counter~0 6)} assume !(0 == ~cond); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,477 INFO L290 TraceCheckUtils]: 151: Hoare triple {25583#(<= ~counter~0 6)} assume true; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,478 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25583#(<= ~counter~0 6)} {25583#(<= ~counter~0 6)} #59#return; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,478 INFO L272 TraceCheckUtils]: 153: Hoare triple {25583#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,478 INFO L290 TraceCheckUtils]: 154: Hoare triple {25583#(<= ~counter~0 6)} ~cond := #in~cond; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,478 INFO L290 TraceCheckUtils]: 155: Hoare triple {25583#(<= ~counter~0 6)} assume !(0 == ~cond); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,479 INFO L290 TraceCheckUtils]: 156: Hoare triple {25583#(<= ~counter~0 6)} assume true; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,479 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25583#(<= ~counter~0 6)} {25583#(<= ~counter~0 6)} #61#return; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,480 INFO L272 TraceCheckUtils]: 158: Hoare triple {25583#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,480 INFO L290 TraceCheckUtils]: 159: Hoare triple {25583#(<= ~counter~0 6)} ~cond := #in~cond; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,480 INFO L290 TraceCheckUtils]: 160: Hoare triple {25583#(<= ~counter~0 6)} assume !(0 == ~cond); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,480 INFO L290 TraceCheckUtils]: 161: Hoare triple {25583#(<= ~counter~0 6)} assume true; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,481 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25583#(<= ~counter~0 6)} {25583#(<= ~counter~0 6)} #63#return; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,481 INFO L272 TraceCheckUtils]: 163: Hoare triple {25583#(<= ~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)); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,481 INFO L290 TraceCheckUtils]: 164: Hoare triple {25583#(<= ~counter~0 6)} ~cond := #in~cond; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,482 INFO L290 TraceCheckUtils]: 165: Hoare triple {25583#(<= ~counter~0 6)} assume !(0 == ~cond); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,482 INFO L290 TraceCheckUtils]: 166: Hoare triple {25583#(<= ~counter~0 6)} assume true; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,482 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25583#(<= ~counter~0 6)} {25583#(<= ~counter~0 6)} #65#return; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,483 INFO L272 TraceCheckUtils]: 168: Hoare triple {25583#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,483 INFO L290 TraceCheckUtils]: 169: Hoare triple {25583#(<= ~counter~0 6)} ~cond := #in~cond; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,483 INFO L290 TraceCheckUtils]: 170: Hoare triple {25583#(<= ~counter~0 6)} assume !(0 == ~cond); {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,484 INFO L290 TraceCheckUtils]: 171: Hoare triple {25583#(<= ~counter~0 6)} assume true; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,484 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25583#(<= ~counter~0 6)} {25583#(<= ~counter~0 6)} #67#return; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,484 INFO L290 TraceCheckUtils]: 173: Hoare triple {25583#(<= ~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; {25583#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:10,485 INFO L290 TraceCheckUtils]: 174: Hoare triple {25583#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,485 INFO L290 TraceCheckUtils]: 175: Hoare triple {25668#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,486 INFO L272 TraceCheckUtils]: 176: Hoare triple {25668#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,486 INFO L290 TraceCheckUtils]: 177: Hoare triple {25668#(<= ~counter~0 7)} ~cond := #in~cond; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,486 INFO L290 TraceCheckUtils]: 178: Hoare triple {25668#(<= ~counter~0 7)} assume !(0 == ~cond); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,487 INFO L290 TraceCheckUtils]: 179: Hoare triple {25668#(<= ~counter~0 7)} assume true; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,487 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {25668#(<= ~counter~0 7)} {25668#(<= ~counter~0 7)} #59#return; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,488 INFO L272 TraceCheckUtils]: 181: Hoare triple {25668#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,488 INFO L290 TraceCheckUtils]: 182: Hoare triple {25668#(<= ~counter~0 7)} ~cond := #in~cond; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,488 INFO L290 TraceCheckUtils]: 183: Hoare triple {25668#(<= ~counter~0 7)} assume !(0 == ~cond); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,488 INFO L290 TraceCheckUtils]: 184: Hoare triple {25668#(<= ~counter~0 7)} assume true; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,489 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {25668#(<= ~counter~0 7)} {25668#(<= ~counter~0 7)} #61#return; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,489 INFO L272 TraceCheckUtils]: 186: Hoare triple {25668#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,489 INFO L290 TraceCheckUtils]: 187: Hoare triple {25668#(<= ~counter~0 7)} ~cond := #in~cond; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,490 INFO L290 TraceCheckUtils]: 188: Hoare triple {25668#(<= ~counter~0 7)} assume !(0 == ~cond); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,490 INFO L290 TraceCheckUtils]: 189: Hoare triple {25668#(<= ~counter~0 7)} assume true; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,490 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {25668#(<= ~counter~0 7)} {25668#(<= ~counter~0 7)} #63#return; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,491 INFO L272 TraceCheckUtils]: 191: Hoare triple {25668#(<= ~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)); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,491 INFO L290 TraceCheckUtils]: 192: Hoare triple {25668#(<= ~counter~0 7)} ~cond := #in~cond; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,491 INFO L290 TraceCheckUtils]: 193: Hoare triple {25668#(<= ~counter~0 7)} assume !(0 == ~cond); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,492 INFO L290 TraceCheckUtils]: 194: Hoare triple {25668#(<= ~counter~0 7)} assume true; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,492 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {25668#(<= ~counter~0 7)} {25668#(<= ~counter~0 7)} #65#return; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,492 INFO L272 TraceCheckUtils]: 196: Hoare triple {25668#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,493 INFO L290 TraceCheckUtils]: 197: Hoare triple {25668#(<= ~counter~0 7)} ~cond := #in~cond; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,493 INFO L290 TraceCheckUtils]: 198: Hoare triple {25668#(<= ~counter~0 7)} assume !(0 == ~cond); {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,493 INFO L290 TraceCheckUtils]: 199: Hoare triple {25668#(<= ~counter~0 7)} assume true; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,494 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {25668#(<= ~counter~0 7)} {25668#(<= ~counter~0 7)} #67#return; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,494 INFO L290 TraceCheckUtils]: 201: Hoare triple {25668#(<= ~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; {25668#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:10,495 INFO L290 TraceCheckUtils]: 202: Hoare triple {25668#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,495 INFO L290 TraceCheckUtils]: 203: Hoare triple {25753#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,496 INFO L272 TraceCheckUtils]: 204: Hoare triple {25753#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,496 INFO L290 TraceCheckUtils]: 205: Hoare triple {25753#(<= ~counter~0 8)} ~cond := #in~cond; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,496 INFO L290 TraceCheckUtils]: 206: Hoare triple {25753#(<= ~counter~0 8)} assume !(0 == ~cond); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,496 INFO L290 TraceCheckUtils]: 207: Hoare triple {25753#(<= ~counter~0 8)} assume true; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,497 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {25753#(<= ~counter~0 8)} {25753#(<= ~counter~0 8)} #59#return; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,497 INFO L272 TraceCheckUtils]: 209: Hoare triple {25753#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,497 INFO L290 TraceCheckUtils]: 210: Hoare triple {25753#(<= ~counter~0 8)} ~cond := #in~cond; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,498 INFO L290 TraceCheckUtils]: 211: Hoare triple {25753#(<= ~counter~0 8)} assume !(0 == ~cond); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,498 INFO L290 TraceCheckUtils]: 212: Hoare triple {25753#(<= ~counter~0 8)} assume true; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,498 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {25753#(<= ~counter~0 8)} {25753#(<= ~counter~0 8)} #61#return; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,499 INFO L272 TraceCheckUtils]: 214: Hoare triple {25753#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,499 INFO L290 TraceCheckUtils]: 215: Hoare triple {25753#(<= ~counter~0 8)} ~cond := #in~cond; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,499 INFO L290 TraceCheckUtils]: 216: Hoare triple {25753#(<= ~counter~0 8)} assume !(0 == ~cond); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,500 INFO L290 TraceCheckUtils]: 217: Hoare triple {25753#(<= ~counter~0 8)} assume true; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,500 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {25753#(<= ~counter~0 8)} {25753#(<= ~counter~0 8)} #63#return; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,500 INFO L272 TraceCheckUtils]: 219: Hoare triple {25753#(<= ~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)); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,501 INFO L290 TraceCheckUtils]: 220: Hoare triple {25753#(<= ~counter~0 8)} ~cond := #in~cond; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,501 INFO L290 TraceCheckUtils]: 221: Hoare triple {25753#(<= ~counter~0 8)} assume !(0 == ~cond); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,501 INFO L290 TraceCheckUtils]: 222: Hoare triple {25753#(<= ~counter~0 8)} assume true; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,502 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {25753#(<= ~counter~0 8)} {25753#(<= ~counter~0 8)} #65#return; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,502 INFO L272 TraceCheckUtils]: 224: Hoare triple {25753#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,502 INFO L290 TraceCheckUtils]: 225: Hoare triple {25753#(<= ~counter~0 8)} ~cond := #in~cond; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,502 INFO L290 TraceCheckUtils]: 226: Hoare triple {25753#(<= ~counter~0 8)} assume !(0 == ~cond); {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,503 INFO L290 TraceCheckUtils]: 227: Hoare triple {25753#(<= ~counter~0 8)} assume true; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,503 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {25753#(<= ~counter~0 8)} {25753#(<= ~counter~0 8)} #67#return; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,503 INFO L290 TraceCheckUtils]: 229: Hoare triple {25753#(<= ~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; {25753#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:10,504 INFO L290 TraceCheckUtils]: 230: Hoare triple {25753#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,505 INFO L290 TraceCheckUtils]: 231: Hoare triple {25838#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,505 INFO L272 TraceCheckUtils]: 232: Hoare triple {25838#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,505 INFO L290 TraceCheckUtils]: 233: Hoare triple {25838#(<= ~counter~0 9)} ~cond := #in~cond; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,506 INFO L290 TraceCheckUtils]: 234: Hoare triple {25838#(<= ~counter~0 9)} assume !(0 == ~cond); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,506 INFO L290 TraceCheckUtils]: 235: Hoare triple {25838#(<= ~counter~0 9)} assume true; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,506 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {25838#(<= ~counter~0 9)} {25838#(<= ~counter~0 9)} #59#return; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,507 INFO L272 TraceCheckUtils]: 237: Hoare triple {25838#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,507 INFO L290 TraceCheckUtils]: 238: Hoare triple {25838#(<= ~counter~0 9)} ~cond := #in~cond; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,507 INFO L290 TraceCheckUtils]: 239: Hoare triple {25838#(<= ~counter~0 9)} assume !(0 == ~cond); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,507 INFO L290 TraceCheckUtils]: 240: Hoare triple {25838#(<= ~counter~0 9)} assume true; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,508 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {25838#(<= ~counter~0 9)} {25838#(<= ~counter~0 9)} #61#return; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,508 INFO L272 TraceCheckUtils]: 242: Hoare triple {25838#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,509 INFO L290 TraceCheckUtils]: 243: Hoare triple {25838#(<= ~counter~0 9)} ~cond := #in~cond; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,509 INFO L290 TraceCheckUtils]: 244: Hoare triple {25838#(<= ~counter~0 9)} assume !(0 == ~cond); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,509 INFO L290 TraceCheckUtils]: 245: Hoare triple {25838#(<= ~counter~0 9)} assume true; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,509 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {25838#(<= ~counter~0 9)} {25838#(<= ~counter~0 9)} #63#return; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,510 INFO L272 TraceCheckUtils]: 247: Hoare triple {25838#(<= ~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)); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,510 INFO L290 TraceCheckUtils]: 248: Hoare triple {25838#(<= ~counter~0 9)} ~cond := #in~cond; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,510 INFO L290 TraceCheckUtils]: 249: Hoare triple {25838#(<= ~counter~0 9)} assume !(0 == ~cond); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,511 INFO L290 TraceCheckUtils]: 250: Hoare triple {25838#(<= ~counter~0 9)} assume true; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,511 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {25838#(<= ~counter~0 9)} {25838#(<= ~counter~0 9)} #65#return; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,512 INFO L272 TraceCheckUtils]: 252: Hoare triple {25838#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,512 INFO L290 TraceCheckUtils]: 253: Hoare triple {25838#(<= ~counter~0 9)} ~cond := #in~cond; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,512 INFO L290 TraceCheckUtils]: 254: Hoare triple {25838#(<= ~counter~0 9)} assume !(0 == ~cond); {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,512 INFO L290 TraceCheckUtils]: 255: Hoare triple {25838#(<= ~counter~0 9)} assume true; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,513 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {25838#(<= ~counter~0 9)} {25838#(<= ~counter~0 9)} #67#return; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,513 INFO L290 TraceCheckUtils]: 257: Hoare triple {25838#(<= ~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; {25838#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:10,514 INFO L290 TraceCheckUtils]: 258: Hoare triple {25838#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,514 INFO L290 TraceCheckUtils]: 259: Hoare triple {25923#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,515 INFO L272 TraceCheckUtils]: 260: Hoare triple {25923#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,515 INFO L290 TraceCheckUtils]: 261: Hoare triple {25923#(<= ~counter~0 10)} ~cond := #in~cond; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,515 INFO L290 TraceCheckUtils]: 262: Hoare triple {25923#(<= ~counter~0 10)} assume !(0 == ~cond); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,515 INFO L290 TraceCheckUtils]: 263: Hoare triple {25923#(<= ~counter~0 10)} assume true; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,516 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {25923#(<= ~counter~0 10)} {25923#(<= ~counter~0 10)} #59#return; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,516 INFO L272 TraceCheckUtils]: 265: Hoare triple {25923#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,517 INFO L290 TraceCheckUtils]: 266: Hoare triple {25923#(<= ~counter~0 10)} ~cond := #in~cond; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,517 INFO L290 TraceCheckUtils]: 267: Hoare triple {25923#(<= ~counter~0 10)} assume !(0 == ~cond); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,517 INFO L290 TraceCheckUtils]: 268: Hoare triple {25923#(<= ~counter~0 10)} assume true; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,517 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {25923#(<= ~counter~0 10)} {25923#(<= ~counter~0 10)} #61#return; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,518 INFO L272 TraceCheckUtils]: 270: Hoare triple {25923#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,518 INFO L290 TraceCheckUtils]: 271: Hoare triple {25923#(<= ~counter~0 10)} ~cond := #in~cond; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,518 INFO L290 TraceCheckUtils]: 272: Hoare triple {25923#(<= ~counter~0 10)} assume !(0 == ~cond); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,519 INFO L290 TraceCheckUtils]: 273: Hoare triple {25923#(<= ~counter~0 10)} assume true; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,519 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {25923#(<= ~counter~0 10)} {25923#(<= ~counter~0 10)} #63#return; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,520 INFO L272 TraceCheckUtils]: 275: Hoare triple {25923#(<= ~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)); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,520 INFO L290 TraceCheckUtils]: 276: Hoare triple {25923#(<= ~counter~0 10)} ~cond := #in~cond; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,520 INFO L290 TraceCheckUtils]: 277: Hoare triple {25923#(<= ~counter~0 10)} assume !(0 == ~cond); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,520 INFO L290 TraceCheckUtils]: 278: Hoare triple {25923#(<= ~counter~0 10)} assume true; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,521 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {25923#(<= ~counter~0 10)} {25923#(<= ~counter~0 10)} #65#return; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,521 INFO L272 TraceCheckUtils]: 280: Hoare triple {25923#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,521 INFO L290 TraceCheckUtils]: 281: Hoare triple {25923#(<= ~counter~0 10)} ~cond := #in~cond; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,522 INFO L290 TraceCheckUtils]: 282: Hoare triple {25923#(<= ~counter~0 10)} assume !(0 == ~cond); {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,522 INFO L290 TraceCheckUtils]: 283: Hoare triple {25923#(<= ~counter~0 10)} assume true; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,522 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {25923#(<= ~counter~0 10)} {25923#(<= ~counter~0 10)} #67#return; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,523 INFO L290 TraceCheckUtils]: 285: Hoare triple {25923#(<= ~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; {25923#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:10,524 INFO L290 TraceCheckUtils]: 286: Hoare triple {25923#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,524 INFO L290 TraceCheckUtils]: 287: Hoare triple {26008#(<= ~counter~0 11)} assume !!(#t~post5 < 50);havoc #t~post5; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,524 INFO L272 TraceCheckUtils]: 288: Hoare triple {26008#(<= ~counter~0 11)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,525 INFO L290 TraceCheckUtils]: 289: Hoare triple {26008#(<= ~counter~0 11)} ~cond := #in~cond; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,525 INFO L290 TraceCheckUtils]: 290: Hoare triple {26008#(<= ~counter~0 11)} assume !(0 == ~cond); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,525 INFO L290 TraceCheckUtils]: 291: Hoare triple {26008#(<= ~counter~0 11)} assume true; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,526 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {26008#(<= ~counter~0 11)} {26008#(<= ~counter~0 11)} #59#return; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,526 INFO L272 TraceCheckUtils]: 293: Hoare triple {26008#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,526 INFO L290 TraceCheckUtils]: 294: Hoare triple {26008#(<= ~counter~0 11)} ~cond := #in~cond; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,535 INFO L290 TraceCheckUtils]: 295: Hoare triple {26008#(<= ~counter~0 11)} assume !(0 == ~cond); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,536 INFO L290 TraceCheckUtils]: 296: Hoare triple {26008#(<= ~counter~0 11)} assume true; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,536 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {26008#(<= ~counter~0 11)} {26008#(<= ~counter~0 11)} #61#return; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,537 INFO L272 TraceCheckUtils]: 298: Hoare triple {26008#(<= ~counter~0 11)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,537 INFO L290 TraceCheckUtils]: 299: Hoare triple {26008#(<= ~counter~0 11)} ~cond := #in~cond; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,537 INFO L290 TraceCheckUtils]: 300: Hoare triple {26008#(<= ~counter~0 11)} assume !(0 == ~cond); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,537 INFO L290 TraceCheckUtils]: 301: Hoare triple {26008#(<= ~counter~0 11)} assume true; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,538 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {26008#(<= ~counter~0 11)} {26008#(<= ~counter~0 11)} #63#return; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,538 INFO L272 TraceCheckUtils]: 303: Hoare triple {26008#(<= ~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)); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,539 INFO L290 TraceCheckUtils]: 304: Hoare triple {26008#(<= ~counter~0 11)} ~cond := #in~cond; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,539 INFO L290 TraceCheckUtils]: 305: Hoare triple {26008#(<= ~counter~0 11)} assume !(0 == ~cond); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,539 INFO L290 TraceCheckUtils]: 306: Hoare triple {26008#(<= ~counter~0 11)} assume true; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,540 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {26008#(<= ~counter~0 11)} {26008#(<= ~counter~0 11)} #65#return; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,540 INFO L272 TraceCheckUtils]: 308: Hoare triple {26008#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,540 INFO L290 TraceCheckUtils]: 309: Hoare triple {26008#(<= ~counter~0 11)} ~cond := #in~cond; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,541 INFO L290 TraceCheckUtils]: 310: Hoare triple {26008#(<= ~counter~0 11)} assume !(0 == ~cond); {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,541 INFO L290 TraceCheckUtils]: 311: Hoare triple {26008#(<= ~counter~0 11)} assume true; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,541 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {26008#(<= ~counter~0 11)} {26008#(<= ~counter~0 11)} #67#return; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,541 INFO L290 TraceCheckUtils]: 313: Hoare triple {26008#(<= ~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; {26008#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:10,542 INFO L290 TraceCheckUtils]: 314: Hoare triple {26008#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,543 INFO L290 TraceCheckUtils]: 315: Hoare triple {26093#(<= ~counter~0 12)} assume !!(#t~post5 < 50);havoc #t~post5; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,543 INFO L272 TraceCheckUtils]: 316: Hoare triple {26093#(<= ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,543 INFO L290 TraceCheckUtils]: 317: Hoare triple {26093#(<= ~counter~0 12)} ~cond := #in~cond; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,544 INFO L290 TraceCheckUtils]: 318: Hoare triple {26093#(<= ~counter~0 12)} assume !(0 == ~cond); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,544 INFO L290 TraceCheckUtils]: 319: Hoare triple {26093#(<= ~counter~0 12)} assume true; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,544 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {26093#(<= ~counter~0 12)} {26093#(<= ~counter~0 12)} #59#return; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,545 INFO L272 TraceCheckUtils]: 321: Hoare triple {26093#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,545 INFO L290 TraceCheckUtils]: 322: Hoare triple {26093#(<= ~counter~0 12)} ~cond := #in~cond; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,545 INFO L290 TraceCheckUtils]: 323: Hoare triple {26093#(<= ~counter~0 12)} assume !(0 == ~cond); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,546 INFO L290 TraceCheckUtils]: 324: Hoare triple {26093#(<= ~counter~0 12)} assume true; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,546 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {26093#(<= ~counter~0 12)} {26093#(<= ~counter~0 12)} #61#return; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,546 INFO L272 TraceCheckUtils]: 326: Hoare triple {26093#(<= ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,547 INFO L290 TraceCheckUtils]: 327: Hoare triple {26093#(<= ~counter~0 12)} ~cond := #in~cond; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,547 INFO L290 TraceCheckUtils]: 328: Hoare triple {26093#(<= ~counter~0 12)} assume !(0 == ~cond); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,547 INFO L290 TraceCheckUtils]: 329: Hoare triple {26093#(<= ~counter~0 12)} assume true; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,548 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {26093#(<= ~counter~0 12)} {26093#(<= ~counter~0 12)} #63#return; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,548 INFO L272 TraceCheckUtils]: 331: Hoare triple {26093#(<= ~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)); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,548 INFO L290 TraceCheckUtils]: 332: Hoare triple {26093#(<= ~counter~0 12)} ~cond := #in~cond; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,549 INFO L290 TraceCheckUtils]: 333: Hoare triple {26093#(<= ~counter~0 12)} assume !(0 == ~cond); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,549 INFO L290 TraceCheckUtils]: 334: Hoare triple {26093#(<= ~counter~0 12)} assume true; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,549 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {26093#(<= ~counter~0 12)} {26093#(<= ~counter~0 12)} #65#return; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,550 INFO L272 TraceCheckUtils]: 336: Hoare triple {26093#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,550 INFO L290 TraceCheckUtils]: 337: Hoare triple {26093#(<= ~counter~0 12)} ~cond := #in~cond; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,550 INFO L290 TraceCheckUtils]: 338: Hoare triple {26093#(<= ~counter~0 12)} assume !(0 == ~cond); {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,551 INFO L290 TraceCheckUtils]: 339: Hoare triple {26093#(<= ~counter~0 12)} assume true; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,551 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {26093#(<= ~counter~0 12)} {26093#(<= ~counter~0 12)} #67#return; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,551 INFO L290 TraceCheckUtils]: 341: Hoare triple {26093#(<= ~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; {26093#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:10,552 INFO L290 TraceCheckUtils]: 342: Hoare triple {26093#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,552 INFO L290 TraceCheckUtils]: 343: Hoare triple {26178#(<= ~counter~0 13)} assume !!(#t~post5 < 50);havoc #t~post5; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,553 INFO L272 TraceCheckUtils]: 344: Hoare triple {26178#(<= ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,553 INFO L290 TraceCheckUtils]: 345: Hoare triple {26178#(<= ~counter~0 13)} ~cond := #in~cond; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,553 INFO L290 TraceCheckUtils]: 346: Hoare triple {26178#(<= ~counter~0 13)} assume !(0 == ~cond); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,554 INFO L290 TraceCheckUtils]: 347: Hoare triple {26178#(<= ~counter~0 13)} assume true; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,554 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {26178#(<= ~counter~0 13)} {26178#(<= ~counter~0 13)} #59#return; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,554 INFO L272 TraceCheckUtils]: 349: Hoare triple {26178#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,555 INFO L290 TraceCheckUtils]: 350: Hoare triple {26178#(<= ~counter~0 13)} ~cond := #in~cond; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,555 INFO L290 TraceCheckUtils]: 351: Hoare triple {26178#(<= ~counter~0 13)} assume !(0 == ~cond); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,555 INFO L290 TraceCheckUtils]: 352: Hoare triple {26178#(<= ~counter~0 13)} assume true; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,556 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {26178#(<= ~counter~0 13)} {26178#(<= ~counter~0 13)} #61#return; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,556 INFO L272 TraceCheckUtils]: 354: Hoare triple {26178#(<= ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,556 INFO L290 TraceCheckUtils]: 355: Hoare triple {26178#(<= ~counter~0 13)} ~cond := #in~cond; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,557 INFO L290 TraceCheckUtils]: 356: Hoare triple {26178#(<= ~counter~0 13)} assume !(0 == ~cond); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,557 INFO L290 TraceCheckUtils]: 357: Hoare triple {26178#(<= ~counter~0 13)} assume true; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,557 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {26178#(<= ~counter~0 13)} {26178#(<= ~counter~0 13)} #63#return; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,558 INFO L272 TraceCheckUtils]: 359: Hoare triple {26178#(<= ~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)); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,558 INFO L290 TraceCheckUtils]: 360: Hoare triple {26178#(<= ~counter~0 13)} ~cond := #in~cond; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,558 INFO L290 TraceCheckUtils]: 361: Hoare triple {26178#(<= ~counter~0 13)} assume !(0 == ~cond); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,558 INFO L290 TraceCheckUtils]: 362: Hoare triple {26178#(<= ~counter~0 13)} assume true; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,559 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {26178#(<= ~counter~0 13)} {26178#(<= ~counter~0 13)} #65#return; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,559 INFO L272 TraceCheckUtils]: 364: Hoare triple {26178#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,560 INFO L290 TraceCheckUtils]: 365: Hoare triple {26178#(<= ~counter~0 13)} ~cond := #in~cond; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,560 INFO L290 TraceCheckUtils]: 366: Hoare triple {26178#(<= ~counter~0 13)} assume !(0 == ~cond); {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,560 INFO L290 TraceCheckUtils]: 367: Hoare triple {26178#(<= ~counter~0 13)} assume true; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,561 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {26178#(<= ~counter~0 13)} {26178#(<= ~counter~0 13)} #67#return; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,561 INFO L290 TraceCheckUtils]: 369: Hoare triple {26178#(<= ~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; {26178#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:10,562 INFO L290 TraceCheckUtils]: 370: Hoare triple {26178#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,562 INFO L290 TraceCheckUtils]: 371: Hoare triple {26263#(<= ~counter~0 14)} assume !!(#t~post5 < 50);havoc #t~post5; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,563 INFO L272 TraceCheckUtils]: 372: Hoare triple {26263#(<= ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,563 INFO L290 TraceCheckUtils]: 373: Hoare triple {26263#(<= ~counter~0 14)} ~cond := #in~cond; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,563 INFO L290 TraceCheckUtils]: 374: Hoare triple {26263#(<= ~counter~0 14)} assume !(0 == ~cond); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,563 INFO L290 TraceCheckUtils]: 375: Hoare triple {26263#(<= ~counter~0 14)} assume true; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,564 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {26263#(<= ~counter~0 14)} {26263#(<= ~counter~0 14)} #59#return; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,564 INFO L272 TraceCheckUtils]: 377: Hoare triple {26263#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,564 INFO L290 TraceCheckUtils]: 378: Hoare triple {26263#(<= ~counter~0 14)} ~cond := #in~cond; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,565 INFO L290 TraceCheckUtils]: 379: Hoare triple {26263#(<= ~counter~0 14)} assume !(0 == ~cond); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,565 INFO L290 TraceCheckUtils]: 380: Hoare triple {26263#(<= ~counter~0 14)} assume true; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,565 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {26263#(<= ~counter~0 14)} {26263#(<= ~counter~0 14)} #61#return; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,566 INFO L272 TraceCheckUtils]: 382: Hoare triple {26263#(<= ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,566 INFO L290 TraceCheckUtils]: 383: Hoare triple {26263#(<= ~counter~0 14)} ~cond := #in~cond; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,566 INFO L290 TraceCheckUtils]: 384: Hoare triple {26263#(<= ~counter~0 14)} assume !(0 == ~cond); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,567 INFO L290 TraceCheckUtils]: 385: Hoare triple {26263#(<= ~counter~0 14)} assume true; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,567 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {26263#(<= ~counter~0 14)} {26263#(<= ~counter~0 14)} #63#return; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,567 INFO L272 TraceCheckUtils]: 387: Hoare triple {26263#(<= ~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)); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,568 INFO L290 TraceCheckUtils]: 388: Hoare triple {26263#(<= ~counter~0 14)} ~cond := #in~cond; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,568 INFO L290 TraceCheckUtils]: 389: Hoare triple {26263#(<= ~counter~0 14)} assume !(0 == ~cond); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,568 INFO L290 TraceCheckUtils]: 390: Hoare triple {26263#(<= ~counter~0 14)} assume true; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,569 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {26263#(<= ~counter~0 14)} {26263#(<= ~counter~0 14)} #65#return; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,569 INFO L272 TraceCheckUtils]: 392: Hoare triple {26263#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,569 INFO L290 TraceCheckUtils]: 393: Hoare triple {26263#(<= ~counter~0 14)} ~cond := #in~cond; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,570 INFO L290 TraceCheckUtils]: 394: Hoare triple {26263#(<= ~counter~0 14)} assume !(0 == ~cond); {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,570 INFO L290 TraceCheckUtils]: 395: Hoare triple {26263#(<= ~counter~0 14)} assume true; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,570 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {26263#(<= ~counter~0 14)} {26263#(<= ~counter~0 14)} #67#return; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,571 INFO L290 TraceCheckUtils]: 397: Hoare triple {26263#(<= ~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; {26263#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:10,571 INFO L290 TraceCheckUtils]: 398: Hoare triple {26263#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,572 INFO L290 TraceCheckUtils]: 399: Hoare triple {26348#(<= ~counter~0 15)} assume !!(#t~post5 < 50);havoc #t~post5; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,572 INFO L272 TraceCheckUtils]: 400: Hoare triple {26348#(<= ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,572 INFO L290 TraceCheckUtils]: 401: Hoare triple {26348#(<= ~counter~0 15)} ~cond := #in~cond; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,573 INFO L290 TraceCheckUtils]: 402: Hoare triple {26348#(<= ~counter~0 15)} assume !(0 == ~cond); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,573 INFO L290 TraceCheckUtils]: 403: Hoare triple {26348#(<= ~counter~0 15)} assume true; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,573 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {26348#(<= ~counter~0 15)} {26348#(<= ~counter~0 15)} #59#return; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,574 INFO L272 TraceCheckUtils]: 405: Hoare triple {26348#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,574 INFO L290 TraceCheckUtils]: 406: Hoare triple {26348#(<= ~counter~0 15)} ~cond := #in~cond; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,574 INFO L290 TraceCheckUtils]: 407: Hoare triple {26348#(<= ~counter~0 15)} assume !(0 == ~cond); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,575 INFO L290 TraceCheckUtils]: 408: Hoare triple {26348#(<= ~counter~0 15)} assume true; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,575 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {26348#(<= ~counter~0 15)} {26348#(<= ~counter~0 15)} #61#return; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,576 INFO L272 TraceCheckUtils]: 410: Hoare triple {26348#(<= ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,576 INFO L290 TraceCheckUtils]: 411: Hoare triple {26348#(<= ~counter~0 15)} ~cond := #in~cond; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,576 INFO L290 TraceCheckUtils]: 412: Hoare triple {26348#(<= ~counter~0 15)} assume !(0 == ~cond); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,576 INFO L290 TraceCheckUtils]: 413: Hoare triple {26348#(<= ~counter~0 15)} assume true; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,577 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {26348#(<= ~counter~0 15)} {26348#(<= ~counter~0 15)} #63#return; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,577 INFO L272 TraceCheckUtils]: 415: Hoare triple {26348#(<= ~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)); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,577 INFO L290 TraceCheckUtils]: 416: Hoare triple {26348#(<= ~counter~0 15)} ~cond := #in~cond; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,578 INFO L290 TraceCheckUtils]: 417: Hoare triple {26348#(<= ~counter~0 15)} assume !(0 == ~cond); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,578 INFO L290 TraceCheckUtils]: 418: Hoare triple {26348#(<= ~counter~0 15)} assume true; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,578 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {26348#(<= ~counter~0 15)} {26348#(<= ~counter~0 15)} #65#return; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,579 INFO L272 TraceCheckUtils]: 420: Hoare triple {26348#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,579 INFO L290 TraceCheckUtils]: 421: Hoare triple {26348#(<= ~counter~0 15)} ~cond := #in~cond; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,579 INFO L290 TraceCheckUtils]: 422: Hoare triple {26348#(<= ~counter~0 15)} assume !(0 == ~cond); {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,580 INFO L290 TraceCheckUtils]: 423: Hoare triple {26348#(<= ~counter~0 15)} assume true; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,580 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {26348#(<= ~counter~0 15)} {26348#(<= ~counter~0 15)} #67#return; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,580 INFO L290 TraceCheckUtils]: 425: Hoare triple {26348#(<= ~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; {26348#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:10,581 INFO L290 TraceCheckUtils]: 426: Hoare triple {26348#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,582 INFO L290 TraceCheckUtils]: 427: Hoare triple {26433#(<= ~counter~0 16)} assume !!(#t~post5 < 50);havoc #t~post5; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,582 INFO L272 TraceCheckUtils]: 428: Hoare triple {26433#(<= ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,582 INFO L290 TraceCheckUtils]: 429: Hoare triple {26433#(<= ~counter~0 16)} ~cond := #in~cond; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,582 INFO L290 TraceCheckUtils]: 430: Hoare triple {26433#(<= ~counter~0 16)} assume !(0 == ~cond); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,583 INFO L290 TraceCheckUtils]: 431: Hoare triple {26433#(<= ~counter~0 16)} assume true; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,583 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {26433#(<= ~counter~0 16)} {26433#(<= ~counter~0 16)} #59#return; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,584 INFO L272 TraceCheckUtils]: 433: Hoare triple {26433#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,584 INFO L290 TraceCheckUtils]: 434: Hoare triple {26433#(<= ~counter~0 16)} ~cond := #in~cond; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,584 INFO L290 TraceCheckUtils]: 435: Hoare triple {26433#(<= ~counter~0 16)} assume !(0 == ~cond); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,584 INFO L290 TraceCheckUtils]: 436: Hoare triple {26433#(<= ~counter~0 16)} assume true; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,585 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {26433#(<= ~counter~0 16)} {26433#(<= ~counter~0 16)} #61#return; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,585 INFO L272 TraceCheckUtils]: 438: Hoare triple {26433#(<= ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,585 INFO L290 TraceCheckUtils]: 439: Hoare triple {26433#(<= ~counter~0 16)} ~cond := #in~cond; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,586 INFO L290 TraceCheckUtils]: 440: Hoare triple {26433#(<= ~counter~0 16)} assume !(0 == ~cond); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,586 INFO L290 TraceCheckUtils]: 441: Hoare triple {26433#(<= ~counter~0 16)} assume true; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,586 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {26433#(<= ~counter~0 16)} {26433#(<= ~counter~0 16)} #63#return; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,587 INFO L272 TraceCheckUtils]: 443: Hoare triple {26433#(<= ~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)); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,587 INFO L290 TraceCheckUtils]: 444: Hoare triple {26433#(<= ~counter~0 16)} ~cond := #in~cond; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,587 INFO L290 TraceCheckUtils]: 445: Hoare triple {26433#(<= ~counter~0 16)} assume !(0 == ~cond); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,588 INFO L290 TraceCheckUtils]: 446: Hoare triple {26433#(<= ~counter~0 16)} assume true; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,588 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {26433#(<= ~counter~0 16)} {26433#(<= ~counter~0 16)} #65#return; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,589 INFO L272 TraceCheckUtils]: 448: Hoare triple {26433#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,589 INFO L290 TraceCheckUtils]: 449: Hoare triple {26433#(<= ~counter~0 16)} ~cond := #in~cond; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,589 INFO L290 TraceCheckUtils]: 450: Hoare triple {26433#(<= ~counter~0 16)} assume !(0 == ~cond); {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,589 INFO L290 TraceCheckUtils]: 451: Hoare triple {26433#(<= ~counter~0 16)} assume true; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,590 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {26433#(<= ~counter~0 16)} {26433#(<= ~counter~0 16)} #67#return; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,590 INFO L290 TraceCheckUtils]: 453: Hoare triple {26433#(<= ~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; {26433#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:10,591 INFO L290 TraceCheckUtils]: 454: Hoare triple {26433#(<= ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,591 INFO L290 TraceCheckUtils]: 455: Hoare triple {26518#(<= ~counter~0 17)} assume !!(#t~post5 < 50);havoc #t~post5; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,592 INFO L272 TraceCheckUtils]: 456: Hoare triple {26518#(<= ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,592 INFO L290 TraceCheckUtils]: 457: Hoare triple {26518#(<= ~counter~0 17)} ~cond := #in~cond; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,592 INFO L290 TraceCheckUtils]: 458: Hoare triple {26518#(<= ~counter~0 17)} assume !(0 == ~cond); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,592 INFO L290 TraceCheckUtils]: 459: Hoare triple {26518#(<= ~counter~0 17)} assume true; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,593 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {26518#(<= ~counter~0 17)} {26518#(<= ~counter~0 17)} #59#return; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,593 INFO L272 TraceCheckUtils]: 461: Hoare triple {26518#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,594 INFO L290 TraceCheckUtils]: 462: Hoare triple {26518#(<= ~counter~0 17)} ~cond := #in~cond; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,594 INFO L290 TraceCheckUtils]: 463: Hoare triple {26518#(<= ~counter~0 17)} assume !(0 == ~cond); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,594 INFO L290 TraceCheckUtils]: 464: Hoare triple {26518#(<= ~counter~0 17)} assume true; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,595 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {26518#(<= ~counter~0 17)} {26518#(<= ~counter~0 17)} #61#return; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,596 INFO L272 TraceCheckUtils]: 466: Hoare triple {26518#(<= ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,596 INFO L290 TraceCheckUtils]: 467: Hoare triple {26518#(<= ~counter~0 17)} ~cond := #in~cond; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,597 INFO L290 TraceCheckUtils]: 468: Hoare triple {26518#(<= ~counter~0 17)} assume !(0 == ~cond); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,597 INFO L290 TraceCheckUtils]: 469: Hoare triple {26518#(<= ~counter~0 17)} assume true; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,597 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {26518#(<= ~counter~0 17)} {26518#(<= ~counter~0 17)} #63#return; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,599 INFO L272 TraceCheckUtils]: 471: Hoare triple {26518#(<= ~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)); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,599 INFO L290 TraceCheckUtils]: 472: Hoare triple {26518#(<= ~counter~0 17)} ~cond := #in~cond; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,599 INFO L290 TraceCheckUtils]: 473: Hoare triple {26518#(<= ~counter~0 17)} assume !(0 == ~cond); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,599 INFO L290 TraceCheckUtils]: 474: Hoare triple {26518#(<= ~counter~0 17)} assume true; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,600 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {26518#(<= ~counter~0 17)} {26518#(<= ~counter~0 17)} #65#return; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,600 INFO L272 TraceCheckUtils]: 476: Hoare triple {26518#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,600 INFO L290 TraceCheckUtils]: 477: Hoare triple {26518#(<= ~counter~0 17)} ~cond := #in~cond; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,601 INFO L290 TraceCheckUtils]: 478: Hoare triple {26518#(<= ~counter~0 17)} assume !(0 == ~cond); {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,601 INFO L290 TraceCheckUtils]: 479: Hoare triple {26518#(<= ~counter~0 17)} assume true; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,601 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {26518#(<= ~counter~0 17)} {26518#(<= ~counter~0 17)} #67#return; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,602 INFO L290 TraceCheckUtils]: 481: Hoare triple {26518#(<= ~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; {26518#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:10,604 INFO L290 TraceCheckUtils]: 482: Hoare triple {26518#(<= ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,604 INFO L290 TraceCheckUtils]: 483: Hoare triple {26603#(<= ~counter~0 18)} assume !!(#t~post5 < 50);havoc #t~post5; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,604 INFO L272 TraceCheckUtils]: 484: Hoare triple {26603#(<= ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,605 INFO L290 TraceCheckUtils]: 485: Hoare triple {26603#(<= ~counter~0 18)} ~cond := #in~cond; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,605 INFO L290 TraceCheckUtils]: 486: Hoare triple {26603#(<= ~counter~0 18)} assume !(0 == ~cond); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,605 INFO L290 TraceCheckUtils]: 487: Hoare triple {26603#(<= ~counter~0 18)} assume true; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,606 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {26603#(<= ~counter~0 18)} {26603#(<= ~counter~0 18)} #59#return; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,606 INFO L272 TraceCheckUtils]: 489: Hoare triple {26603#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,606 INFO L290 TraceCheckUtils]: 490: Hoare triple {26603#(<= ~counter~0 18)} ~cond := #in~cond; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,607 INFO L290 TraceCheckUtils]: 491: Hoare triple {26603#(<= ~counter~0 18)} assume !(0 == ~cond); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,607 INFO L290 TraceCheckUtils]: 492: Hoare triple {26603#(<= ~counter~0 18)} assume true; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,607 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {26603#(<= ~counter~0 18)} {26603#(<= ~counter~0 18)} #61#return; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,608 INFO L272 TraceCheckUtils]: 494: Hoare triple {26603#(<= ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,608 INFO L290 TraceCheckUtils]: 495: Hoare triple {26603#(<= ~counter~0 18)} ~cond := #in~cond; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,608 INFO L290 TraceCheckUtils]: 496: Hoare triple {26603#(<= ~counter~0 18)} assume !(0 == ~cond); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,608 INFO L290 TraceCheckUtils]: 497: Hoare triple {26603#(<= ~counter~0 18)} assume true; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,609 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {26603#(<= ~counter~0 18)} {26603#(<= ~counter~0 18)} #63#return; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,609 INFO L272 TraceCheckUtils]: 499: Hoare triple {26603#(<= ~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)); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,610 INFO L290 TraceCheckUtils]: 500: Hoare triple {26603#(<= ~counter~0 18)} ~cond := #in~cond; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,610 INFO L290 TraceCheckUtils]: 501: Hoare triple {26603#(<= ~counter~0 18)} assume !(0 == ~cond); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,610 INFO L290 TraceCheckUtils]: 502: Hoare triple {26603#(<= ~counter~0 18)} assume true; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,611 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {26603#(<= ~counter~0 18)} {26603#(<= ~counter~0 18)} #65#return; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,611 INFO L272 TraceCheckUtils]: 504: Hoare triple {26603#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,611 INFO L290 TraceCheckUtils]: 505: Hoare triple {26603#(<= ~counter~0 18)} ~cond := #in~cond; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,612 INFO L290 TraceCheckUtils]: 506: Hoare triple {26603#(<= ~counter~0 18)} assume !(0 == ~cond); {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,612 INFO L290 TraceCheckUtils]: 507: Hoare triple {26603#(<= ~counter~0 18)} assume true; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,612 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {26603#(<= ~counter~0 18)} {26603#(<= ~counter~0 18)} #67#return; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,613 INFO L290 TraceCheckUtils]: 509: Hoare triple {26603#(<= ~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; {26603#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:10,613 INFO L290 TraceCheckUtils]: 510: Hoare triple {26603#(<= ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,614 INFO L290 TraceCheckUtils]: 511: Hoare triple {26688#(<= ~counter~0 19)} assume !!(#t~post5 < 50);havoc #t~post5; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,614 INFO L272 TraceCheckUtils]: 512: Hoare triple {26688#(<= ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,615 INFO L290 TraceCheckUtils]: 513: Hoare triple {26688#(<= ~counter~0 19)} ~cond := #in~cond; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,615 INFO L290 TraceCheckUtils]: 514: Hoare triple {26688#(<= ~counter~0 19)} assume !(0 == ~cond); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,615 INFO L290 TraceCheckUtils]: 515: Hoare triple {26688#(<= ~counter~0 19)} assume true; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,615 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {26688#(<= ~counter~0 19)} {26688#(<= ~counter~0 19)} #59#return; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,616 INFO L272 TraceCheckUtils]: 517: Hoare triple {26688#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,616 INFO L290 TraceCheckUtils]: 518: Hoare triple {26688#(<= ~counter~0 19)} ~cond := #in~cond; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,616 INFO L290 TraceCheckUtils]: 519: Hoare triple {26688#(<= ~counter~0 19)} assume !(0 == ~cond); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,617 INFO L290 TraceCheckUtils]: 520: Hoare triple {26688#(<= ~counter~0 19)} assume true; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,617 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {26688#(<= ~counter~0 19)} {26688#(<= ~counter~0 19)} #61#return; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,618 INFO L272 TraceCheckUtils]: 522: Hoare triple {26688#(<= ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,618 INFO L290 TraceCheckUtils]: 523: Hoare triple {26688#(<= ~counter~0 19)} ~cond := #in~cond; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,618 INFO L290 TraceCheckUtils]: 524: Hoare triple {26688#(<= ~counter~0 19)} assume !(0 == ~cond); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,618 INFO L290 TraceCheckUtils]: 525: Hoare triple {26688#(<= ~counter~0 19)} assume true; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,619 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {26688#(<= ~counter~0 19)} {26688#(<= ~counter~0 19)} #63#return; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,619 INFO L272 TraceCheckUtils]: 527: Hoare triple {26688#(<= ~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)); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,620 INFO L290 TraceCheckUtils]: 528: Hoare triple {26688#(<= ~counter~0 19)} ~cond := #in~cond; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,620 INFO L290 TraceCheckUtils]: 529: Hoare triple {26688#(<= ~counter~0 19)} assume !(0 == ~cond); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,620 INFO L290 TraceCheckUtils]: 530: Hoare triple {26688#(<= ~counter~0 19)} assume true; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,621 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {26688#(<= ~counter~0 19)} {26688#(<= ~counter~0 19)} #65#return; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,621 INFO L272 TraceCheckUtils]: 532: Hoare triple {26688#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,621 INFO L290 TraceCheckUtils]: 533: Hoare triple {26688#(<= ~counter~0 19)} ~cond := #in~cond; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,621 INFO L290 TraceCheckUtils]: 534: Hoare triple {26688#(<= ~counter~0 19)} assume !(0 == ~cond); {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,622 INFO L290 TraceCheckUtils]: 535: Hoare triple {26688#(<= ~counter~0 19)} assume true; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,622 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {26688#(<= ~counter~0 19)} {26688#(<= ~counter~0 19)} #67#return; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,622 INFO L290 TraceCheckUtils]: 537: Hoare triple {26688#(<= ~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; {26688#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:10,623 INFO L290 TraceCheckUtils]: 538: Hoare triple {26688#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,624 INFO L290 TraceCheckUtils]: 539: Hoare triple {26773#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,624 INFO L272 TraceCheckUtils]: 540: Hoare triple {26773#(<= ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,624 INFO L290 TraceCheckUtils]: 541: Hoare triple {26773#(<= ~counter~0 20)} ~cond := #in~cond; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,625 INFO L290 TraceCheckUtils]: 542: Hoare triple {26773#(<= ~counter~0 20)} assume !(0 == ~cond); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,625 INFO L290 TraceCheckUtils]: 543: Hoare triple {26773#(<= ~counter~0 20)} assume true; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,625 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {26773#(<= ~counter~0 20)} {26773#(<= ~counter~0 20)} #59#return; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,626 INFO L272 TraceCheckUtils]: 545: Hoare triple {26773#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,626 INFO L290 TraceCheckUtils]: 546: Hoare triple {26773#(<= ~counter~0 20)} ~cond := #in~cond; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,626 INFO L290 TraceCheckUtils]: 547: Hoare triple {26773#(<= ~counter~0 20)} assume !(0 == ~cond); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,626 INFO L290 TraceCheckUtils]: 548: Hoare triple {26773#(<= ~counter~0 20)} assume true; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,627 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {26773#(<= ~counter~0 20)} {26773#(<= ~counter~0 20)} #61#return; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,632 INFO L272 TraceCheckUtils]: 550: Hoare triple {26773#(<= ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,632 INFO L290 TraceCheckUtils]: 551: Hoare triple {26773#(<= ~counter~0 20)} ~cond := #in~cond; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,633 INFO L290 TraceCheckUtils]: 552: Hoare triple {26773#(<= ~counter~0 20)} assume !(0 == ~cond); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,633 INFO L290 TraceCheckUtils]: 553: Hoare triple {26773#(<= ~counter~0 20)} assume true; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,634 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {26773#(<= ~counter~0 20)} {26773#(<= ~counter~0 20)} #63#return; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,634 INFO L272 TraceCheckUtils]: 555: Hoare triple {26773#(<= ~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)); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,635 INFO L290 TraceCheckUtils]: 556: Hoare triple {26773#(<= ~counter~0 20)} ~cond := #in~cond; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,635 INFO L290 TraceCheckUtils]: 557: Hoare triple {26773#(<= ~counter~0 20)} assume !(0 == ~cond); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,635 INFO L290 TraceCheckUtils]: 558: Hoare triple {26773#(<= ~counter~0 20)} assume true; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,636 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {26773#(<= ~counter~0 20)} {26773#(<= ~counter~0 20)} #65#return; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,637 INFO L272 TraceCheckUtils]: 560: Hoare triple {26773#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,637 INFO L290 TraceCheckUtils]: 561: Hoare triple {26773#(<= ~counter~0 20)} ~cond := #in~cond; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,637 INFO L290 TraceCheckUtils]: 562: Hoare triple {26773#(<= ~counter~0 20)} assume !(0 == ~cond); {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,638 INFO L290 TraceCheckUtils]: 563: Hoare triple {26773#(<= ~counter~0 20)} assume true; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,638 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {26773#(<= ~counter~0 20)} {26773#(<= ~counter~0 20)} #67#return; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,639 INFO L290 TraceCheckUtils]: 565: Hoare triple {26773#(<= ~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; {26773#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:10,640 INFO L290 TraceCheckUtils]: 566: Hoare triple {26773#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,640 INFO L290 TraceCheckUtils]: 567: Hoare triple {26858#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,641 INFO L272 TraceCheckUtils]: 568: Hoare triple {26858#(<= ~counter~0 21)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,641 INFO L290 TraceCheckUtils]: 569: Hoare triple {26858#(<= ~counter~0 21)} ~cond := #in~cond; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,641 INFO L290 TraceCheckUtils]: 570: Hoare triple {26858#(<= ~counter~0 21)} assume !(0 == ~cond); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,642 INFO L290 TraceCheckUtils]: 571: Hoare triple {26858#(<= ~counter~0 21)} assume true; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,642 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {26858#(<= ~counter~0 21)} {26858#(<= ~counter~0 21)} #59#return; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,643 INFO L272 TraceCheckUtils]: 573: Hoare triple {26858#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,643 INFO L290 TraceCheckUtils]: 574: Hoare triple {26858#(<= ~counter~0 21)} ~cond := #in~cond; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,644 INFO L290 TraceCheckUtils]: 575: Hoare triple {26858#(<= ~counter~0 21)} assume !(0 == ~cond); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,644 INFO L290 TraceCheckUtils]: 576: Hoare triple {26858#(<= ~counter~0 21)} assume true; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,645 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {26858#(<= ~counter~0 21)} {26858#(<= ~counter~0 21)} #61#return; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,645 INFO L272 TraceCheckUtils]: 578: Hoare triple {26858#(<= ~counter~0 21)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,645 INFO L290 TraceCheckUtils]: 579: Hoare triple {26858#(<= ~counter~0 21)} ~cond := #in~cond; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,646 INFO L290 TraceCheckUtils]: 580: Hoare triple {26858#(<= ~counter~0 21)} assume !(0 == ~cond); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,646 INFO L290 TraceCheckUtils]: 581: Hoare triple {26858#(<= ~counter~0 21)} assume true; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,647 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {26858#(<= ~counter~0 21)} {26858#(<= ~counter~0 21)} #63#return; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,647 INFO L272 TraceCheckUtils]: 583: Hoare triple {26858#(<= ~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)); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,648 INFO L290 TraceCheckUtils]: 584: Hoare triple {26858#(<= ~counter~0 21)} ~cond := #in~cond; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,648 INFO L290 TraceCheckUtils]: 585: Hoare triple {26858#(<= ~counter~0 21)} assume !(0 == ~cond); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,648 INFO L290 TraceCheckUtils]: 586: Hoare triple {26858#(<= ~counter~0 21)} assume true; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,649 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {26858#(<= ~counter~0 21)} {26858#(<= ~counter~0 21)} #65#return; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,650 INFO L272 TraceCheckUtils]: 588: Hoare triple {26858#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,650 INFO L290 TraceCheckUtils]: 589: Hoare triple {26858#(<= ~counter~0 21)} ~cond := #in~cond; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,650 INFO L290 TraceCheckUtils]: 590: Hoare triple {26858#(<= ~counter~0 21)} assume !(0 == ~cond); {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,651 INFO L290 TraceCheckUtils]: 591: Hoare triple {26858#(<= ~counter~0 21)} assume true; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,651 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {26858#(<= ~counter~0 21)} {26858#(<= ~counter~0 21)} #67#return; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,652 INFO L290 TraceCheckUtils]: 593: Hoare triple {26858#(<= ~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; {26858#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:10,653 INFO L290 TraceCheckUtils]: 594: Hoare triple {26858#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,653 INFO L290 TraceCheckUtils]: 595: Hoare triple {26943#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,654 INFO L272 TraceCheckUtils]: 596: Hoare triple {26943#(<= ~counter~0 22)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,654 INFO L290 TraceCheckUtils]: 597: Hoare triple {26943#(<= ~counter~0 22)} ~cond := #in~cond; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,655 INFO L290 TraceCheckUtils]: 598: Hoare triple {26943#(<= ~counter~0 22)} assume !(0 == ~cond); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,655 INFO L290 TraceCheckUtils]: 599: Hoare triple {26943#(<= ~counter~0 22)} assume true; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,656 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {26943#(<= ~counter~0 22)} {26943#(<= ~counter~0 22)} #59#return; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,656 INFO L272 TraceCheckUtils]: 601: Hoare triple {26943#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,657 INFO L290 TraceCheckUtils]: 602: Hoare triple {26943#(<= ~counter~0 22)} ~cond := #in~cond; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,657 INFO L290 TraceCheckUtils]: 603: Hoare triple {26943#(<= ~counter~0 22)} assume !(0 == ~cond); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,657 INFO L290 TraceCheckUtils]: 604: Hoare triple {26943#(<= ~counter~0 22)} assume true; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,658 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {26943#(<= ~counter~0 22)} {26943#(<= ~counter~0 22)} #61#return; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,659 INFO L272 TraceCheckUtils]: 606: Hoare triple {26943#(<= ~counter~0 22)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,659 INFO L290 TraceCheckUtils]: 607: Hoare triple {26943#(<= ~counter~0 22)} ~cond := #in~cond; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,659 INFO L290 TraceCheckUtils]: 608: Hoare triple {26943#(<= ~counter~0 22)} assume !(0 == ~cond); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,660 INFO L290 TraceCheckUtils]: 609: Hoare triple {26943#(<= ~counter~0 22)} assume true; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,660 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {26943#(<= ~counter~0 22)} {26943#(<= ~counter~0 22)} #63#return; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,661 INFO L272 TraceCheckUtils]: 611: Hoare triple {26943#(<= ~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)); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,661 INFO L290 TraceCheckUtils]: 612: Hoare triple {26943#(<= ~counter~0 22)} ~cond := #in~cond; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,661 INFO L290 TraceCheckUtils]: 613: Hoare triple {26943#(<= ~counter~0 22)} assume !(0 == ~cond); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,662 INFO L290 TraceCheckUtils]: 614: Hoare triple {26943#(<= ~counter~0 22)} assume true; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,662 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {26943#(<= ~counter~0 22)} {26943#(<= ~counter~0 22)} #65#return; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,663 INFO L272 TraceCheckUtils]: 616: Hoare triple {26943#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,663 INFO L290 TraceCheckUtils]: 617: Hoare triple {26943#(<= ~counter~0 22)} ~cond := #in~cond; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,664 INFO L290 TraceCheckUtils]: 618: Hoare triple {26943#(<= ~counter~0 22)} assume !(0 == ~cond); {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,664 INFO L290 TraceCheckUtils]: 619: Hoare triple {26943#(<= ~counter~0 22)} assume true; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,665 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {26943#(<= ~counter~0 22)} {26943#(<= ~counter~0 22)} #67#return; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,665 INFO L290 TraceCheckUtils]: 621: Hoare triple {26943#(<= ~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; {26943#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:10,665 INFO L290 TraceCheckUtils]: 622: Hoare triple {26943#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27028#(<= |main_#t~post5| 22)} is VALID [2022-04-07 13:06:10,666 INFO L290 TraceCheckUtils]: 623: Hoare triple {27028#(<= |main_#t~post5| 22)} assume !(#t~post5 < 50);havoc #t~post5; {25135#false} is VALID [2022-04-07 13:06:10,666 INFO L272 TraceCheckUtils]: 624: Hoare triple {25135#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25135#false} is VALID [2022-04-07 13:06:10,666 INFO L290 TraceCheckUtils]: 625: Hoare triple {25135#false} ~cond := #in~cond; {25135#false} is VALID [2022-04-07 13:06:10,666 INFO L290 TraceCheckUtils]: 626: Hoare triple {25135#false} assume !(0 == ~cond); {25135#false} is VALID [2022-04-07 13:06:10,666 INFO L290 TraceCheckUtils]: 627: Hoare triple {25135#false} assume true; {25135#false} is VALID [2022-04-07 13:06:10,666 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {25135#false} {25135#false} #69#return; {25135#false} is VALID [2022-04-07 13:06:10,666 INFO L272 TraceCheckUtils]: 629: Hoare triple {25135#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {25135#false} is VALID [2022-04-07 13:06:10,666 INFO L290 TraceCheckUtils]: 630: Hoare triple {25135#false} ~cond := #in~cond; {25135#false} is VALID [2022-04-07 13:06:10,667 INFO L290 TraceCheckUtils]: 631: Hoare triple {25135#false} assume 0 == ~cond; {25135#false} is VALID [2022-04-07 13:06:10,667 INFO L290 TraceCheckUtils]: 632: Hoare triple {25135#false} assume !false; {25135#false} is VALID [2022-04-07 13:06:10,678 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-07 13:06:10,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:06:13,592 INFO L290 TraceCheckUtils]: 632: Hoare triple {25135#false} assume !false; {25135#false} is VALID [2022-04-07 13:06:13,592 INFO L290 TraceCheckUtils]: 631: Hoare triple {25135#false} assume 0 == ~cond; {25135#false} is VALID [2022-04-07 13:06:13,592 INFO L290 TraceCheckUtils]: 630: Hoare triple {25135#false} ~cond := #in~cond; {25135#false} is VALID [2022-04-07 13:06:13,592 INFO L272 TraceCheckUtils]: 629: Hoare triple {25135#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {25135#false} is VALID [2022-04-07 13:06:13,592 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {25134#true} {25135#false} #69#return; {25135#false} is VALID [2022-04-07 13:06:13,592 INFO L290 TraceCheckUtils]: 627: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,592 INFO L290 TraceCheckUtils]: 626: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,592 INFO L290 TraceCheckUtils]: 625: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,593 INFO L272 TraceCheckUtils]: 624: Hoare triple {25135#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,593 INFO L290 TraceCheckUtils]: 623: Hoare triple {27086#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {25135#false} is VALID [2022-04-07 13:06:13,593 INFO L290 TraceCheckUtils]: 622: Hoare triple {27090#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27086#(< |main_#t~post5| 50)} is VALID [2022-04-07 13:06:13,594 INFO L290 TraceCheckUtils]: 621: Hoare triple {27090#(< ~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; {27090#(< ~counter~0 50)} is VALID [2022-04-07 13:06:13,594 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {25134#true} {27090#(< ~counter~0 50)} #67#return; {27090#(< ~counter~0 50)} is VALID [2022-04-07 13:06:13,594 INFO L290 TraceCheckUtils]: 619: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,594 INFO L290 TraceCheckUtils]: 618: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,594 INFO L290 TraceCheckUtils]: 617: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,594 INFO L272 TraceCheckUtils]: 616: Hoare triple {27090#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,595 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {25134#true} {27090#(< ~counter~0 50)} #65#return; {27090#(< ~counter~0 50)} is VALID [2022-04-07 13:06:13,595 INFO L290 TraceCheckUtils]: 614: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,595 INFO L290 TraceCheckUtils]: 613: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,595 INFO L290 TraceCheckUtils]: 612: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,595 INFO L272 TraceCheckUtils]: 611: Hoare triple {27090#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,596 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {25134#true} {27090#(< ~counter~0 50)} #63#return; {27090#(< ~counter~0 50)} is VALID [2022-04-07 13:06:13,596 INFO L290 TraceCheckUtils]: 609: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,596 INFO L290 TraceCheckUtils]: 608: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,596 INFO L290 TraceCheckUtils]: 607: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,596 INFO L272 TraceCheckUtils]: 606: Hoare triple {27090#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,597 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {25134#true} {27090#(< ~counter~0 50)} #61#return; {27090#(< ~counter~0 50)} is VALID [2022-04-07 13:06:13,597 INFO L290 TraceCheckUtils]: 604: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,597 INFO L290 TraceCheckUtils]: 603: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,597 INFO L290 TraceCheckUtils]: 602: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,597 INFO L272 TraceCheckUtils]: 601: Hoare triple {27090#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,597 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {25134#true} {27090#(< ~counter~0 50)} #59#return; {27090#(< ~counter~0 50)} is VALID [2022-04-07 13:06:13,597 INFO L290 TraceCheckUtils]: 599: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,598 INFO L290 TraceCheckUtils]: 598: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,598 INFO L290 TraceCheckUtils]: 597: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,598 INFO L272 TraceCheckUtils]: 596: Hoare triple {27090#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,598 INFO L290 TraceCheckUtils]: 595: Hoare triple {27090#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {27090#(< ~counter~0 50)} is VALID [2022-04-07 13:06:13,599 INFO L290 TraceCheckUtils]: 594: Hoare triple {27175#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27090#(< ~counter~0 50)} is VALID [2022-04-07 13:06:13,599 INFO L290 TraceCheckUtils]: 593: Hoare triple {27175#(< ~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; {27175#(< ~counter~0 49)} is VALID [2022-04-07 13:06:13,600 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {25134#true} {27175#(< ~counter~0 49)} #67#return; {27175#(< ~counter~0 49)} is VALID [2022-04-07 13:06:13,600 INFO L290 TraceCheckUtils]: 591: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,600 INFO L290 TraceCheckUtils]: 590: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,600 INFO L290 TraceCheckUtils]: 589: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,600 INFO L272 TraceCheckUtils]: 588: Hoare triple {27175#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,601 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {25134#true} {27175#(< ~counter~0 49)} #65#return; {27175#(< ~counter~0 49)} is VALID [2022-04-07 13:06:13,601 INFO L290 TraceCheckUtils]: 586: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,601 INFO L290 TraceCheckUtils]: 585: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,601 INFO L290 TraceCheckUtils]: 584: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,601 INFO L272 TraceCheckUtils]: 583: Hoare triple {27175#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,602 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {25134#true} {27175#(< ~counter~0 49)} #63#return; {27175#(< ~counter~0 49)} is VALID [2022-04-07 13:06:13,603 INFO L290 TraceCheckUtils]: 581: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,603 INFO L290 TraceCheckUtils]: 580: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,603 INFO L290 TraceCheckUtils]: 579: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,603 INFO L272 TraceCheckUtils]: 578: Hoare triple {27175#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,603 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {25134#true} {27175#(< ~counter~0 49)} #61#return; {27175#(< ~counter~0 49)} is VALID [2022-04-07 13:06:13,604 INFO L290 TraceCheckUtils]: 576: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,604 INFO L290 TraceCheckUtils]: 575: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,604 INFO L290 TraceCheckUtils]: 574: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,604 INFO L272 TraceCheckUtils]: 573: Hoare triple {27175#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,604 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {25134#true} {27175#(< ~counter~0 49)} #59#return; {27175#(< ~counter~0 49)} is VALID [2022-04-07 13:06:13,604 INFO L290 TraceCheckUtils]: 571: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,604 INFO L290 TraceCheckUtils]: 570: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,604 INFO L290 TraceCheckUtils]: 569: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,605 INFO L272 TraceCheckUtils]: 568: Hoare triple {27175#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,605 INFO L290 TraceCheckUtils]: 567: Hoare triple {27175#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {27175#(< ~counter~0 49)} is VALID [2022-04-07 13:06:13,606 INFO L290 TraceCheckUtils]: 566: Hoare triple {27260#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27175#(< ~counter~0 49)} is VALID [2022-04-07 13:06:13,606 INFO L290 TraceCheckUtils]: 565: Hoare triple {27260#(< ~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; {27260#(< ~counter~0 48)} is VALID [2022-04-07 13:06:13,607 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {25134#true} {27260#(< ~counter~0 48)} #67#return; {27260#(< ~counter~0 48)} is VALID [2022-04-07 13:06:13,607 INFO L290 TraceCheckUtils]: 563: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,607 INFO L290 TraceCheckUtils]: 562: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,607 INFO L290 TraceCheckUtils]: 561: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,607 INFO L272 TraceCheckUtils]: 560: Hoare triple {27260#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,608 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {25134#true} {27260#(< ~counter~0 48)} #65#return; {27260#(< ~counter~0 48)} is VALID [2022-04-07 13:06:13,608 INFO L290 TraceCheckUtils]: 558: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,608 INFO L290 TraceCheckUtils]: 557: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,608 INFO L290 TraceCheckUtils]: 556: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,608 INFO L272 TraceCheckUtils]: 555: Hoare triple {27260#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,608 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {25134#true} {27260#(< ~counter~0 48)} #63#return; {27260#(< ~counter~0 48)} is VALID [2022-04-07 13:06:13,608 INFO L290 TraceCheckUtils]: 553: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,609 INFO L290 TraceCheckUtils]: 552: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,609 INFO L290 TraceCheckUtils]: 551: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,609 INFO L272 TraceCheckUtils]: 550: Hoare triple {27260#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,609 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {25134#true} {27260#(< ~counter~0 48)} #61#return; {27260#(< ~counter~0 48)} is VALID [2022-04-07 13:06:13,609 INFO L290 TraceCheckUtils]: 548: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,609 INFO L290 TraceCheckUtils]: 547: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,609 INFO L290 TraceCheckUtils]: 546: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,610 INFO L272 TraceCheckUtils]: 545: Hoare triple {27260#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,610 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {25134#true} {27260#(< ~counter~0 48)} #59#return; {27260#(< ~counter~0 48)} is VALID [2022-04-07 13:06:13,610 INFO L290 TraceCheckUtils]: 543: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,610 INFO L290 TraceCheckUtils]: 542: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,610 INFO L290 TraceCheckUtils]: 541: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,610 INFO L272 TraceCheckUtils]: 540: Hoare triple {27260#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,611 INFO L290 TraceCheckUtils]: 539: Hoare triple {27260#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {27260#(< ~counter~0 48)} is VALID [2022-04-07 13:06:13,612 INFO L290 TraceCheckUtils]: 538: Hoare triple {27345#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27260#(< ~counter~0 48)} is VALID [2022-04-07 13:06:13,612 INFO L290 TraceCheckUtils]: 537: Hoare triple {27345#(< ~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; {27345#(< ~counter~0 47)} is VALID [2022-04-07 13:06:13,612 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {25134#true} {27345#(< ~counter~0 47)} #67#return; {27345#(< ~counter~0 47)} is VALID [2022-04-07 13:06:13,613 INFO L290 TraceCheckUtils]: 535: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,613 INFO L290 TraceCheckUtils]: 534: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,613 INFO L290 TraceCheckUtils]: 533: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,613 INFO L272 TraceCheckUtils]: 532: Hoare triple {27345#(< ~counter~0 47)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,613 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {25134#true} {27345#(< ~counter~0 47)} #65#return; {27345#(< ~counter~0 47)} is VALID [2022-04-07 13:06:13,613 INFO L290 TraceCheckUtils]: 530: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,613 INFO L290 TraceCheckUtils]: 529: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,614 INFO L290 TraceCheckUtils]: 528: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,614 INFO L272 TraceCheckUtils]: 527: Hoare triple {27345#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,614 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {25134#true} {27345#(< ~counter~0 47)} #63#return; {27345#(< ~counter~0 47)} is VALID [2022-04-07 13:06:13,614 INFO L290 TraceCheckUtils]: 525: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,614 INFO L290 TraceCheckUtils]: 524: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,614 INFO L290 TraceCheckUtils]: 523: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,614 INFO L272 TraceCheckUtils]: 522: Hoare triple {27345#(< ~counter~0 47)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,615 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {25134#true} {27345#(< ~counter~0 47)} #61#return; {27345#(< ~counter~0 47)} is VALID [2022-04-07 13:06:13,615 INFO L290 TraceCheckUtils]: 520: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,615 INFO L290 TraceCheckUtils]: 519: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,615 INFO L290 TraceCheckUtils]: 518: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,615 INFO L272 TraceCheckUtils]: 517: Hoare triple {27345#(< ~counter~0 47)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,616 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {25134#true} {27345#(< ~counter~0 47)} #59#return; {27345#(< ~counter~0 47)} is VALID [2022-04-07 13:06:13,616 INFO L290 TraceCheckUtils]: 515: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,616 INFO L290 TraceCheckUtils]: 514: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,616 INFO L290 TraceCheckUtils]: 513: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,616 INFO L272 TraceCheckUtils]: 512: Hoare triple {27345#(< ~counter~0 47)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,616 INFO L290 TraceCheckUtils]: 511: Hoare triple {27345#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {27345#(< ~counter~0 47)} is VALID [2022-04-07 13:06:13,618 INFO L290 TraceCheckUtils]: 510: Hoare triple {27430#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27345#(< ~counter~0 47)} is VALID [2022-04-07 13:06:13,618 INFO L290 TraceCheckUtils]: 509: Hoare triple {27430#(< ~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; {27430#(< ~counter~0 46)} is VALID [2022-04-07 13:06:13,619 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {25134#true} {27430#(< ~counter~0 46)} #67#return; {27430#(< ~counter~0 46)} is VALID [2022-04-07 13:06:13,619 INFO L290 TraceCheckUtils]: 507: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,619 INFO L290 TraceCheckUtils]: 506: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,619 INFO L290 TraceCheckUtils]: 505: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,619 INFO L272 TraceCheckUtils]: 504: Hoare triple {27430#(< ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,619 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {25134#true} {27430#(< ~counter~0 46)} #65#return; {27430#(< ~counter~0 46)} is VALID [2022-04-07 13:06:13,620 INFO L290 TraceCheckUtils]: 502: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,620 INFO L290 TraceCheckUtils]: 501: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,620 INFO L290 TraceCheckUtils]: 500: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,620 INFO L272 TraceCheckUtils]: 499: Hoare triple {27430#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,620 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {25134#true} {27430#(< ~counter~0 46)} #63#return; {27430#(< ~counter~0 46)} is VALID [2022-04-07 13:06:13,620 INFO L290 TraceCheckUtils]: 497: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,620 INFO L290 TraceCheckUtils]: 496: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,620 INFO L290 TraceCheckUtils]: 495: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,621 INFO L272 TraceCheckUtils]: 494: Hoare triple {27430#(< ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,621 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {25134#true} {27430#(< ~counter~0 46)} #61#return; {27430#(< ~counter~0 46)} is VALID [2022-04-07 13:06:13,621 INFO L290 TraceCheckUtils]: 492: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,621 INFO L290 TraceCheckUtils]: 491: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,621 INFO L290 TraceCheckUtils]: 490: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,621 INFO L272 TraceCheckUtils]: 489: Hoare triple {27430#(< ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,622 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {25134#true} {27430#(< ~counter~0 46)} #59#return; {27430#(< ~counter~0 46)} is VALID [2022-04-07 13:06:13,622 INFO L290 TraceCheckUtils]: 487: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,622 INFO L290 TraceCheckUtils]: 486: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,622 INFO L290 TraceCheckUtils]: 485: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,622 INFO L272 TraceCheckUtils]: 484: Hoare triple {27430#(< ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,622 INFO L290 TraceCheckUtils]: 483: Hoare triple {27430#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {27430#(< ~counter~0 46)} is VALID [2022-04-07 13:06:13,624 INFO L290 TraceCheckUtils]: 482: Hoare triple {27515#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27430#(< ~counter~0 46)} is VALID [2022-04-07 13:06:13,624 INFO L290 TraceCheckUtils]: 481: Hoare triple {27515#(< ~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; {27515#(< ~counter~0 45)} is VALID [2022-04-07 13:06:13,624 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {25134#true} {27515#(< ~counter~0 45)} #67#return; {27515#(< ~counter~0 45)} is VALID [2022-04-07 13:06:13,625 INFO L290 TraceCheckUtils]: 479: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,625 INFO L290 TraceCheckUtils]: 478: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,625 INFO L290 TraceCheckUtils]: 477: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,625 INFO L272 TraceCheckUtils]: 476: Hoare triple {27515#(< ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,625 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {25134#true} {27515#(< ~counter~0 45)} #65#return; {27515#(< ~counter~0 45)} is VALID [2022-04-07 13:06:13,625 INFO L290 TraceCheckUtils]: 474: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,625 INFO L290 TraceCheckUtils]: 473: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,625 INFO L290 TraceCheckUtils]: 472: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,626 INFO L272 TraceCheckUtils]: 471: Hoare triple {27515#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,626 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {25134#true} {27515#(< ~counter~0 45)} #63#return; {27515#(< ~counter~0 45)} is VALID [2022-04-07 13:06:13,626 INFO L290 TraceCheckUtils]: 469: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,626 INFO L290 TraceCheckUtils]: 468: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,626 INFO L290 TraceCheckUtils]: 467: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,626 INFO L272 TraceCheckUtils]: 466: Hoare triple {27515#(< ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,627 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {25134#true} {27515#(< ~counter~0 45)} #61#return; {27515#(< ~counter~0 45)} is VALID [2022-04-07 13:06:13,627 INFO L290 TraceCheckUtils]: 464: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,627 INFO L290 TraceCheckUtils]: 463: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,627 INFO L290 TraceCheckUtils]: 462: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,627 INFO L272 TraceCheckUtils]: 461: Hoare triple {27515#(< ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,628 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {25134#true} {27515#(< ~counter~0 45)} #59#return; {27515#(< ~counter~0 45)} is VALID [2022-04-07 13:06:13,628 INFO L290 TraceCheckUtils]: 459: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,628 INFO L290 TraceCheckUtils]: 458: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,628 INFO L290 TraceCheckUtils]: 457: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,628 INFO L272 TraceCheckUtils]: 456: Hoare triple {27515#(< ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,628 INFO L290 TraceCheckUtils]: 455: Hoare triple {27515#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {27515#(< ~counter~0 45)} is VALID [2022-04-07 13:06:13,629 INFO L290 TraceCheckUtils]: 454: Hoare triple {27600#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27515#(< ~counter~0 45)} is VALID [2022-04-07 13:06:13,630 INFO L290 TraceCheckUtils]: 453: Hoare triple {27600#(< ~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; {27600#(< ~counter~0 44)} is VALID [2022-04-07 13:06:13,630 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {25134#true} {27600#(< ~counter~0 44)} #67#return; {27600#(< ~counter~0 44)} is VALID [2022-04-07 13:06:13,630 INFO L290 TraceCheckUtils]: 451: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,630 INFO L290 TraceCheckUtils]: 450: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,630 INFO L290 TraceCheckUtils]: 449: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,631 INFO L272 TraceCheckUtils]: 448: Hoare triple {27600#(< ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,631 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {25134#true} {27600#(< ~counter~0 44)} #65#return; {27600#(< ~counter~0 44)} is VALID [2022-04-07 13:06:13,631 INFO L290 TraceCheckUtils]: 446: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,631 INFO L290 TraceCheckUtils]: 445: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,631 INFO L290 TraceCheckUtils]: 444: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,631 INFO L272 TraceCheckUtils]: 443: Hoare triple {27600#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,632 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {25134#true} {27600#(< ~counter~0 44)} #63#return; {27600#(< ~counter~0 44)} is VALID [2022-04-07 13:06:13,632 INFO L290 TraceCheckUtils]: 441: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,632 INFO L290 TraceCheckUtils]: 440: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,632 INFO L290 TraceCheckUtils]: 439: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,632 INFO L272 TraceCheckUtils]: 438: Hoare triple {27600#(< ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,633 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {25134#true} {27600#(< ~counter~0 44)} #61#return; {27600#(< ~counter~0 44)} is VALID [2022-04-07 13:06:13,633 INFO L290 TraceCheckUtils]: 436: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,633 INFO L290 TraceCheckUtils]: 435: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,633 INFO L290 TraceCheckUtils]: 434: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,633 INFO L272 TraceCheckUtils]: 433: Hoare triple {27600#(< ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,634 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {25134#true} {27600#(< ~counter~0 44)} #59#return; {27600#(< ~counter~0 44)} is VALID [2022-04-07 13:06:13,634 INFO L290 TraceCheckUtils]: 431: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,634 INFO L290 TraceCheckUtils]: 430: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,634 INFO L290 TraceCheckUtils]: 429: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,634 INFO L272 TraceCheckUtils]: 428: Hoare triple {27600#(< ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,635 INFO L290 TraceCheckUtils]: 427: Hoare triple {27600#(< ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {27600#(< ~counter~0 44)} is VALID [2022-04-07 13:06:13,636 INFO L290 TraceCheckUtils]: 426: Hoare triple {27685#(< ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27600#(< ~counter~0 44)} is VALID [2022-04-07 13:06:13,636 INFO L290 TraceCheckUtils]: 425: Hoare triple {27685#(< ~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; {27685#(< ~counter~0 43)} is VALID [2022-04-07 13:06:13,637 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {25134#true} {27685#(< ~counter~0 43)} #67#return; {27685#(< ~counter~0 43)} is VALID [2022-04-07 13:06:13,637 INFO L290 TraceCheckUtils]: 423: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,637 INFO L290 TraceCheckUtils]: 422: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,637 INFO L290 TraceCheckUtils]: 421: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,637 INFO L272 TraceCheckUtils]: 420: Hoare triple {27685#(< ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,638 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {25134#true} {27685#(< ~counter~0 43)} #65#return; {27685#(< ~counter~0 43)} is VALID [2022-04-07 13:06:13,638 INFO L290 TraceCheckUtils]: 418: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,638 INFO L290 TraceCheckUtils]: 417: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,638 INFO L290 TraceCheckUtils]: 416: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,638 INFO L272 TraceCheckUtils]: 415: Hoare triple {27685#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,639 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {25134#true} {27685#(< ~counter~0 43)} #63#return; {27685#(< ~counter~0 43)} is VALID [2022-04-07 13:06:13,639 INFO L290 TraceCheckUtils]: 413: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,639 INFO L290 TraceCheckUtils]: 412: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,639 INFO L290 TraceCheckUtils]: 411: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,639 INFO L272 TraceCheckUtils]: 410: Hoare triple {27685#(< ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,639 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {25134#true} {27685#(< ~counter~0 43)} #61#return; {27685#(< ~counter~0 43)} is VALID [2022-04-07 13:06:13,640 INFO L290 TraceCheckUtils]: 408: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,640 INFO L290 TraceCheckUtils]: 407: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,640 INFO L290 TraceCheckUtils]: 406: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,640 INFO L272 TraceCheckUtils]: 405: Hoare triple {27685#(< ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,640 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {25134#true} {27685#(< ~counter~0 43)} #59#return; {27685#(< ~counter~0 43)} is VALID [2022-04-07 13:06:13,640 INFO L290 TraceCheckUtils]: 403: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,640 INFO L290 TraceCheckUtils]: 402: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,641 INFO L290 TraceCheckUtils]: 401: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,641 INFO L272 TraceCheckUtils]: 400: Hoare triple {27685#(< ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,641 INFO L290 TraceCheckUtils]: 399: Hoare triple {27685#(< ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {27685#(< ~counter~0 43)} is VALID [2022-04-07 13:06:13,655 INFO L290 TraceCheckUtils]: 398: Hoare triple {27770#(< ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27685#(< ~counter~0 43)} is VALID [2022-04-07 13:06:13,656 INFO L290 TraceCheckUtils]: 397: Hoare triple {27770#(< ~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; {27770#(< ~counter~0 42)} is VALID [2022-04-07 13:06:13,657 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {25134#true} {27770#(< ~counter~0 42)} #67#return; {27770#(< ~counter~0 42)} is VALID [2022-04-07 13:06:13,657 INFO L290 TraceCheckUtils]: 395: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,657 INFO L290 TraceCheckUtils]: 394: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,657 INFO L290 TraceCheckUtils]: 393: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,658 INFO L272 TraceCheckUtils]: 392: Hoare triple {27770#(< ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,658 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {25134#true} {27770#(< ~counter~0 42)} #65#return; {27770#(< ~counter~0 42)} is VALID [2022-04-07 13:06:13,658 INFO L290 TraceCheckUtils]: 390: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,658 INFO L290 TraceCheckUtils]: 389: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,658 INFO L290 TraceCheckUtils]: 388: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,658 INFO L272 TraceCheckUtils]: 387: Hoare triple {27770#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,659 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {25134#true} {27770#(< ~counter~0 42)} #63#return; {27770#(< ~counter~0 42)} is VALID [2022-04-07 13:06:13,659 INFO L290 TraceCheckUtils]: 385: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,659 INFO L290 TraceCheckUtils]: 384: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,659 INFO L290 TraceCheckUtils]: 383: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,659 INFO L272 TraceCheckUtils]: 382: Hoare triple {27770#(< ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,660 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {25134#true} {27770#(< ~counter~0 42)} #61#return; {27770#(< ~counter~0 42)} is VALID [2022-04-07 13:06:13,660 INFO L290 TraceCheckUtils]: 380: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,660 INFO L290 TraceCheckUtils]: 379: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,660 INFO L290 TraceCheckUtils]: 378: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,660 INFO L272 TraceCheckUtils]: 377: Hoare triple {27770#(< ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,661 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {25134#true} {27770#(< ~counter~0 42)} #59#return; {27770#(< ~counter~0 42)} is VALID [2022-04-07 13:06:13,661 INFO L290 TraceCheckUtils]: 375: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,661 INFO L290 TraceCheckUtils]: 374: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,661 INFO L290 TraceCheckUtils]: 373: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,661 INFO L272 TraceCheckUtils]: 372: Hoare triple {27770#(< ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,661 INFO L290 TraceCheckUtils]: 371: Hoare triple {27770#(< ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {27770#(< ~counter~0 42)} is VALID [2022-04-07 13:06:13,662 INFO L290 TraceCheckUtils]: 370: Hoare triple {27855#(< ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27770#(< ~counter~0 42)} is VALID [2022-04-07 13:06:13,663 INFO L290 TraceCheckUtils]: 369: Hoare triple {27855#(< ~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; {27855#(< ~counter~0 41)} is VALID [2022-04-07 13:06:13,663 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {25134#true} {27855#(< ~counter~0 41)} #67#return; {27855#(< ~counter~0 41)} is VALID [2022-04-07 13:06:13,663 INFO L290 TraceCheckUtils]: 367: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,663 INFO L290 TraceCheckUtils]: 366: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,663 INFO L290 TraceCheckUtils]: 365: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,663 INFO L272 TraceCheckUtils]: 364: Hoare triple {27855#(< ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,664 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {25134#true} {27855#(< ~counter~0 41)} #65#return; {27855#(< ~counter~0 41)} is VALID [2022-04-07 13:06:13,664 INFO L290 TraceCheckUtils]: 362: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,664 INFO L290 TraceCheckUtils]: 361: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,664 INFO L290 TraceCheckUtils]: 360: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,664 INFO L272 TraceCheckUtils]: 359: Hoare triple {27855#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,665 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {25134#true} {27855#(< ~counter~0 41)} #63#return; {27855#(< ~counter~0 41)} is VALID [2022-04-07 13:06:13,665 INFO L290 TraceCheckUtils]: 357: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,665 INFO L290 TraceCheckUtils]: 356: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,665 INFO L290 TraceCheckUtils]: 355: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,665 INFO L272 TraceCheckUtils]: 354: Hoare triple {27855#(< ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,666 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {25134#true} {27855#(< ~counter~0 41)} #61#return; {27855#(< ~counter~0 41)} is VALID [2022-04-07 13:06:13,666 INFO L290 TraceCheckUtils]: 352: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,666 INFO L290 TraceCheckUtils]: 351: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,666 INFO L290 TraceCheckUtils]: 350: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,666 INFO L272 TraceCheckUtils]: 349: Hoare triple {27855#(< ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,666 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {25134#true} {27855#(< ~counter~0 41)} #59#return; {27855#(< ~counter~0 41)} is VALID [2022-04-07 13:06:13,666 INFO L290 TraceCheckUtils]: 347: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,667 INFO L290 TraceCheckUtils]: 346: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,667 INFO L290 TraceCheckUtils]: 345: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,667 INFO L272 TraceCheckUtils]: 344: Hoare triple {27855#(< ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,667 INFO L290 TraceCheckUtils]: 343: Hoare triple {27855#(< ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {27855#(< ~counter~0 41)} is VALID [2022-04-07 13:06:13,668 INFO L290 TraceCheckUtils]: 342: Hoare triple {27940#(< ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27855#(< ~counter~0 41)} is VALID [2022-04-07 13:06:13,668 INFO L290 TraceCheckUtils]: 341: Hoare triple {27940#(< ~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; {27940#(< ~counter~0 40)} is VALID [2022-04-07 13:06:13,669 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {25134#true} {27940#(< ~counter~0 40)} #67#return; {27940#(< ~counter~0 40)} is VALID [2022-04-07 13:06:13,669 INFO L290 TraceCheckUtils]: 339: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,669 INFO L290 TraceCheckUtils]: 338: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,669 INFO L290 TraceCheckUtils]: 337: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,669 INFO L272 TraceCheckUtils]: 336: Hoare triple {27940#(< ~counter~0 40)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,670 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {25134#true} {27940#(< ~counter~0 40)} #65#return; {27940#(< ~counter~0 40)} is VALID [2022-04-07 13:06:13,670 INFO L290 TraceCheckUtils]: 334: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,670 INFO L290 TraceCheckUtils]: 333: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,670 INFO L290 TraceCheckUtils]: 332: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,670 INFO L272 TraceCheckUtils]: 331: Hoare triple {27940#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,671 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {25134#true} {27940#(< ~counter~0 40)} #63#return; {27940#(< ~counter~0 40)} is VALID [2022-04-07 13:06:13,671 INFO L290 TraceCheckUtils]: 329: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,671 INFO L290 TraceCheckUtils]: 328: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,671 INFO L290 TraceCheckUtils]: 327: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,671 INFO L272 TraceCheckUtils]: 326: Hoare triple {27940#(< ~counter~0 40)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,671 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {25134#true} {27940#(< ~counter~0 40)} #61#return; {27940#(< ~counter~0 40)} is VALID [2022-04-07 13:06:13,672 INFO L290 TraceCheckUtils]: 324: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,672 INFO L290 TraceCheckUtils]: 323: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,672 INFO L290 TraceCheckUtils]: 322: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,672 INFO L272 TraceCheckUtils]: 321: Hoare triple {27940#(< ~counter~0 40)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,672 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {25134#true} {27940#(< ~counter~0 40)} #59#return; {27940#(< ~counter~0 40)} is VALID [2022-04-07 13:06:13,672 INFO L290 TraceCheckUtils]: 319: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,672 INFO L290 TraceCheckUtils]: 318: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,672 INFO L290 TraceCheckUtils]: 317: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,672 INFO L272 TraceCheckUtils]: 316: Hoare triple {27940#(< ~counter~0 40)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,673 INFO L290 TraceCheckUtils]: 315: Hoare triple {27940#(< ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {27940#(< ~counter~0 40)} is VALID [2022-04-07 13:06:13,674 INFO L290 TraceCheckUtils]: 314: Hoare triple {28025#(< ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {27940#(< ~counter~0 40)} is VALID [2022-04-07 13:06:13,674 INFO L290 TraceCheckUtils]: 313: Hoare triple {28025#(< ~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; {28025#(< ~counter~0 39)} is VALID [2022-04-07 13:06:13,675 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {25134#true} {28025#(< ~counter~0 39)} #67#return; {28025#(< ~counter~0 39)} is VALID [2022-04-07 13:06:13,675 INFO L290 TraceCheckUtils]: 311: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,675 INFO L290 TraceCheckUtils]: 310: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,675 INFO L290 TraceCheckUtils]: 309: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,675 INFO L272 TraceCheckUtils]: 308: Hoare triple {28025#(< ~counter~0 39)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,675 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {25134#true} {28025#(< ~counter~0 39)} #65#return; {28025#(< ~counter~0 39)} is VALID [2022-04-07 13:06:13,675 INFO L290 TraceCheckUtils]: 306: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,675 INFO L290 TraceCheckUtils]: 305: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,676 INFO L290 TraceCheckUtils]: 304: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,676 INFO L272 TraceCheckUtils]: 303: Hoare triple {28025#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,676 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {25134#true} {28025#(< ~counter~0 39)} #63#return; {28025#(< ~counter~0 39)} is VALID [2022-04-07 13:06:13,676 INFO L290 TraceCheckUtils]: 301: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,676 INFO L290 TraceCheckUtils]: 300: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,676 INFO L290 TraceCheckUtils]: 299: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,676 INFO L272 TraceCheckUtils]: 298: Hoare triple {28025#(< ~counter~0 39)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,677 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {25134#true} {28025#(< ~counter~0 39)} #61#return; {28025#(< ~counter~0 39)} is VALID [2022-04-07 13:06:13,677 INFO L290 TraceCheckUtils]: 296: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,677 INFO L290 TraceCheckUtils]: 295: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,677 INFO L290 TraceCheckUtils]: 294: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,677 INFO L272 TraceCheckUtils]: 293: Hoare triple {28025#(< ~counter~0 39)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,678 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {25134#true} {28025#(< ~counter~0 39)} #59#return; {28025#(< ~counter~0 39)} is VALID [2022-04-07 13:06:13,678 INFO L290 TraceCheckUtils]: 291: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,678 INFO L290 TraceCheckUtils]: 290: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,678 INFO L290 TraceCheckUtils]: 289: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,678 INFO L272 TraceCheckUtils]: 288: Hoare triple {28025#(< ~counter~0 39)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,678 INFO L290 TraceCheckUtils]: 287: Hoare triple {28025#(< ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {28025#(< ~counter~0 39)} is VALID [2022-04-07 13:06:13,679 INFO L290 TraceCheckUtils]: 286: Hoare triple {28110#(< ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28025#(< ~counter~0 39)} is VALID [2022-04-07 13:06:13,679 INFO L290 TraceCheckUtils]: 285: Hoare triple {28110#(< ~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; {28110#(< ~counter~0 38)} is VALID [2022-04-07 13:06:13,680 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {25134#true} {28110#(< ~counter~0 38)} #67#return; {28110#(< ~counter~0 38)} is VALID [2022-04-07 13:06:13,680 INFO L290 TraceCheckUtils]: 283: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,680 INFO L290 TraceCheckUtils]: 282: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,680 INFO L290 TraceCheckUtils]: 281: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,680 INFO L272 TraceCheckUtils]: 280: Hoare triple {28110#(< ~counter~0 38)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,681 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {25134#true} {28110#(< ~counter~0 38)} #65#return; {28110#(< ~counter~0 38)} is VALID [2022-04-07 13:06:13,681 INFO L290 TraceCheckUtils]: 278: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,681 INFO L290 TraceCheckUtils]: 277: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,681 INFO L290 TraceCheckUtils]: 276: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,681 INFO L272 TraceCheckUtils]: 275: Hoare triple {28110#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,681 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {25134#true} {28110#(< ~counter~0 38)} #63#return; {28110#(< ~counter~0 38)} is VALID [2022-04-07 13:06:13,682 INFO L290 TraceCheckUtils]: 273: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,682 INFO L290 TraceCheckUtils]: 272: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,682 INFO L290 TraceCheckUtils]: 271: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,682 INFO L272 TraceCheckUtils]: 270: Hoare triple {28110#(< ~counter~0 38)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,682 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {25134#true} {28110#(< ~counter~0 38)} #61#return; {28110#(< ~counter~0 38)} is VALID [2022-04-07 13:06:13,682 INFO L290 TraceCheckUtils]: 268: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,682 INFO L290 TraceCheckUtils]: 267: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,682 INFO L290 TraceCheckUtils]: 266: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,683 INFO L272 TraceCheckUtils]: 265: Hoare triple {28110#(< ~counter~0 38)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,683 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {25134#true} {28110#(< ~counter~0 38)} #59#return; {28110#(< ~counter~0 38)} is VALID [2022-04-07 13:06:13,683 INFO L290 TraceCheckUtils]: 263: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,683 INFO L290 TraceCheckUtils]: 262: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,683 INFO L290 TraceCheckUtils]: 261: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,683 INFO L272 TraceCheckUtils]: 260: Hoare triple {28110#(< ~counter~0 38)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,684 INFO L290 TraceCheckUtils]: 259: Hoare triple {28110#(< ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {28110#(< ~counter~0 38)} is VALID [2022-04-07 13:06:13,685 INFO L290 TraceCheckUtils]: 258: Hoare triple {28195#(< ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28110#(< ~counter~0 38)} is VALID [2022-04-07 13:06:13,685 INFO L290 TraceCheckUtils]: 257: Hoare triple {28195#(< ~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; {28195#(< ~counter~0 37)} is VALID [2022-04-07 13:06:13,685 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {25134#true} {28195#(< ~counter~0 37)} #67#return; {28195#(< ~counter~0 37)} is VALID [2022-04-07 13:06:13,686 INFO L290 TraceCheckUtils]: 255: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,686 INFO L290 TraceCheckUtils]: 254: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,686 INFO L290 TraceCheckUtils]: 253: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,686 INFO L272 TraceCheckUtils]: 252: Hoare triple {28195#(< ~counter~0 37)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,686 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {25134#true} {28195#(< ~counter~0 37)} #65#return; {28195#(< ~counter~0 37)} is VALID [2022-04-07 13:06:13,686 INFO L290 TraceCheckUtils]: 250: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,686 INFO L290 TraceCheckUtils]: 249: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,687 INFO L290 TraceCheckUtils]: 248: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,687 INFO L272 TraceCheckUtils]: 247: Hoare triple {28195#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,687 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {25134#true} {28195#(< ~counter~0 37)} #63#return; {28195#(< ~counter~0 37)} is VALID [2022-04-07 13:06:13,687 INFO L290 TraceCheckUtils]: 245: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,687 INFO L290 TraceCheckUtils]: 244: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,687 INFO L290 TraceCheckUtils]: 243: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,687 INFO L272 TraceCheckUtils]: 242: Hoare triple {28195#(< ~counter~0 37)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,688 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {25134#true} {28195#(< ~counter~0 37)} #61#return; {28195#(< ~counter~0 37)} is VALID [2022-04-07 13:06:13,688 INFO L290 TraceCheckUtils]: 240: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,688 INFO L290 TraceCheckUtils]: 239: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,688 INFO L290 TraceCheckUtils]: 238: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,688 INFO L272 TraceCheckUtils]: 237: Hoare triple {28195#(< ~counter~0 37)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,689 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {25134#true} {28195#(< ~counter~0 37)} #59#return; {28195#(< ~counter~0 37)} is VALID [2022-04-07 13:06:13,689 INFO L290 TraceCheckUtils]: 235: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,689 INFO L290 TraceCheckUtils]: 234: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,689 INFO L290 TraceCheckUtils]: 233: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,689 INFO L272 TraceCheckUtils]: 232: Hoare triple {28195#(< ~counter~0 37)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,689 INFO L290 TraceCheckUtils]: 231: Hoare triple {28195#(< ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {28195#(< ~counter~0 37)} is VALID [2022-04-07 13:06:13,690 INFO L290 TraceCheckUtils]: 230: Hoare triple {28280#(< ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28195#(< ~counter~0 37)} is VALID [2022-04-07 13:06:13,691 INFO L290 TraceCheckUtils]: 229: Hoare triple {28280#(< ~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; {28280#(< ~counter~0 36)} is VALID [2022-04-07 13:06:13,691 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {25134#true} {28280#(< ~counter~0 36)} #67#return; {28280#(< ~counter~0 36)} is VALID [2022-04-07 13:06:13,691 INFO L290 TraceCheckUtils]: 227: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,691 INFO L290 TraceCheckUtils]: 226: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,692 INFO L290 TraceCheckUtils]: 225: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,692 INFO L272 TraceCheckUtils]: 224: Hoare triple {28280#(< ~counter~0 36)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,692 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {25134#true} {28280#(< ~counter~0 36)} #65#return; {28280#(< ~counter~0 36)} is VALID [2022-04-07 13:06:13,692 INFO L290 TraceCheckUtils]: 222: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,692 INFO L290 TraceCheckUtils]: 221: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,692 INFO L290 TraceCheckUtils]: 220: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,692 INFO L272 TraceCheckUtils]: 219: Hoare triple {28280#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,693 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {25134#true} {28280#(< ~counter~0 36)} #63#return; {28280#(< ~counter~0 36)} is VALID [2022-04-07 13:06:13,693 INFO L290 TraceCheckUtils]: 217: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,693 INFO L290 TraceCheckUtils]: 216: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,693 INFO L290 TraceCheckUtils]: 215: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,693 INFO L272 TraceCheckUtils]: 214: Hoare triple {28280#(< ~counter~0 36)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,694 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {25134#true} {28280#(< ~counter~0 36)} #61#return; {28280#(< ~counter~0 36)} is VALID [2022-04-07 13:06:13,694 INFO L290 TraceCheckUtils]: 212: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,694 INFO L290 TraceCheckUtils]: 211: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,694 INFO L290 TraceCheckUtils]: 210: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,694 INFO L272 TraceCheckUtils]: 209: Hoare triple {28280#(< ~counter~0 36)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,694 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {25134#true} {28280#(< ~counter~0 36)} #59#return; {28280#(< ~counter~0 36)} is VALID [2022-04-07 13:06:13,695 INFO L290 TraceCheckUtils]: 207: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,695 INFO L290 TraceCheckUtils]: 206: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,695 INFO L290 TraceCheckUtils]: 205: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,695 INFO L272 TraceCheckUtils]: 204: Hoare triple {28280#(< ~counter~0 36)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,695 INFO L290 TraceCheckUtils]: 203: Hoare triple {28280#(< ~counter~0 36)} assume !!(#t~post5 < 50);havoc #t~post5; {28280#(< ~counter~0 36)} is VALID [2022-04-07 13:06:13,696 INFO L290 TraceCheckUtils]: 202: Hoare triple {28365#(< ~counter~0 35)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28280#(< ~counter~0 36)} is VALID [2022-04-07 13:06:13,696 INFO L290 TraceCheckUtils]: 201: Hoare triple {28365#(< ~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; {28365#(< ~counter~0 35)} is VALID [2022-04-07 13:06:13,697 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {25134#true} {28365#(< ~counter~0 35)} #67#return; {28365#(< ~counter~0 35)} is VALID [2022-04-07 13:06:13,697 INFO L290 TraceCheckUtils]: 199: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,697 INFO L290 TraceCheckUtils]: 198: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,697 INFO L290 TraceCheckUtils]: 197: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,697 INFO L272 TraceCheckUtils]: 196: Hoare triple {28365#(< ~counter~0 35)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,698 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {25134#true} {28365#(< ~counter~0 35)} #65#return; {28365#(< ~counter~0 35)} is VALID [2022-04-07 13:06:13,698 INFO L290 TraceCheckUtils]: 194: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,698 INFO L290 TraceCheckUtils]: 193: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,698 INFO L290 TraceCheckUtils]: 192: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,698 INFO L272 TraceCheckUtils]: 191: Hoare triple {28365#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,698 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {25134#true} {28365#(< ~counter~0 35)} #63#return; {28365#(< ~counter~0 35)} is VALID [2022-04-07 13:06:13,698 INFO L290 TraceCheckUtils]: 189: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,699 INFO L290 TraceCheckUtils]: 188: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,699 INFO L290 TraceCheckUtils]: 187: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,699 INFO L272 TraceCheckUtils]: 186: Hoare triple {28365#(< ~counter~0 35)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,699 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {25134#true} {28365#(< ~counter~0 35)} #61#return; {28365#(< ~counter~0 35)} is VALID [2022-04-07 13:06:13,699 INFO L290 TraceCheckUtils]: 184: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,699 INFO L290 TraceCheckUtils]: 183: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,699 INFO L290 TraceCheckUtils]: 182: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,699 INFO L272 TraceCheckUtils]: 181: Hoare triple {28365#(< ~counter~0 35)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,700 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {25134#true} {28365#(< ~counter~0 35)} #59#return; {28365#(< ~counter~0 35)} is VALID [2022-04-07 13:06:13,700 INFO L290 TraceCheckUtils]: 179: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,700 INFO L290 TraceCheckUtils]: 178: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,700 INFO L290 TraceCheckUtils]: 177: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,700 INFO L272 TraceCheckUtils]: 176: Hoare triple {28365#(< ~counter~0 35)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,700 INFO L290 TraceCheckUtils]: 175: Hoare triple {28365#(< ~counter~0 35)} assume !!(#t~post5 < 50);havoc #t~post5; {28365#(< ~counter~0 35)} is VALID [2022-04-07 13:06:13,702 INFO L290 TraceCheckUtils]: 174: Hoare triple {28450#(< ~counter~0 34)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28365#(< ~counter~0 35)} is VALID [2022-04-07 13:06:13,702 INFO L290 TraceCheckUtils]: 173: Hoare triple {28450#(< ~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; {28450#(< ~counter~0 34)} is VALID [2022-04-07 13:06:13,702 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25134#true} {28450#(< ~counter~0 34)} #67#return; {28450#(< ~counter~0 34)} is VALID [2022-04-07 13:06:13,703 INFO L290 TraceCheckUtils]: 171: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,703 INFO L290 TraceCheckUtils]: 170: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,703 INFO L290 TraceCheckUtils]: 169: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,703 INFO L272 TraceCheckUtils]: 168: Hoare triple {28450#(< ~counter~0 34)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,703 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25134#true} {28450#(< ~counter~0 34)} #65#return; {28450#(< ~counter~0 34)} is VALID [2022-04-07 13:06:13,703 INFO L290 TraceCheckUtils]: 166: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,703 INFO L290 TraceCheckUtils]: 165: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,704 INFO L290 TraceCheckUtils]: 164: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,704 INFO L272 TraceCheckUtils]: 163: Hoare triple {28450#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,704 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25134#true} {28450#(< ~counter~0 34)} #63#return; {28450#(< ~counter~0 34)} is VALID [2022-04-07 13:06:13,704 INFO L290 TraceCheckUtils]: 161: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,704 INFO L290 TraceCheckUtils]: 160: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,704 INFO L290 TraceCheckUtils]: 159: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,704 INFO L272 TraceCheckUtils]: 158: Hoare triple {28450#(< ~counter~0 34)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,705 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25134#true} {28450#(< ~counter~0 34)} #61#return; {28450#(< ~counter~0 34)} is VALID [2022-04-07 13:06:13,705 INFO L290 TraceCheckUtils]: 156: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,705 INFO L290 TraceCheckUtils]: 155: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,705 INFO L290 TraceCheckUtils]: 154: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,705 INFO L272 TraceCheckUtils]: 153: Hoare triple {28450#(< ~counter~0 34)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,706 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25134#true} {28450#(< ~counter~0 34)} #59#return; {28450#(< ~counter~0 34)} is VALID [2022-04-07 13:06:13,706 INFO L290 TraceCheckUtils]: 151: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,706 INFO L290 TraceCheckUtils]: 150: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,706 INFO L290 TraceCheckUtils]: 149: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,706 INFO L272 TraceCheckUtils]: 148: Hoare triple {28450#(< ~counter~0 34)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,706 INFO L290 TraceCheckUtils]: 147: Hoare triple {28450#(< ~counter~0 34)} assume !!(#t~post5 < 50);havoc #t~post5; {28450#(< ~counter~0 34)} is VALID [2022-04-07 13:06:13,707 INFO L290 TraceCheckUtils]: 146: Hoare triple {28535#(< ~counter~0 33)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28450#(< ~counter~0 34)} is VALID [2022-04-07 13:06:13,708 INFO L290 TraceCheckUtils]: 145: Hoare triple {28535#(< ~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; {28535#(< ~counter~0 33)} is VALID [2022-04-07 13:06:13,708 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {25134#true} {28535#(< ~counter~0 33)} #67#return; {28535#(< ~counter~0 33)} is VALID [2022-04-07 13:06:13,708 INFO L290 TraceCheckUtils]: 143: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,709 INFO L290 TraceCheckUtils]: 142: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,709 INFO L290 TraceCheckUtils]: 141: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,709 INFO L272 TraceCheckUtils]: 140: Hoare triple {28535#(< ~counter~0 33)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,709 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {25134#true} {28535#(< ~counter~0 33)} #65#return; {28535#(< ~counter~0 33)} is VALID [2022-04-07 13:06:13,709 INFO L290 TraceCheckUtils]: 138: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,709 INFO L290 TraceCheckUtils]: 137: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,709 INFO L290 TraceCheckUtils]: 136: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,709 INFO L272 TraceCheckUtils]: 135: Hoare triple {28535#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,710 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {25134#true} {28535#(< ~counter~0 33)} #63#return; {28535#(< ~counter~0 33)} is VALID [2022-04-07 13:06:13,710 INFO L290 TraceCheckUtils]: 133: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,710 INFO L290 TraceCheckUtils]: 132: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,710 INFO L290 TraceCheckUtils]: 131: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,710 INFO L272 TraceCheckUtils]: 130: Hoare triple {28535#(< ~counter~0 33)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,711 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {25134#true} {28535#(< ~counter~0 33)} #61#return; {28535#(< ~counter~0 33)} is VALID [2022-04-07 13:06:13,711 INFO L290 TraceCheckUtils]: 128: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,711 INFO L290 TraceCheckUtils]: 127: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,711 INFO L290 TraceCheckUtils]: 126: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,711 INFO L272 TraceCheckUtils]: 125: Hoare triple {28535#(< ~counter~0 33)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,712 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {25134#true} {28535#(< ~counter~0 33)} #59#return; {28535#(< ~counter~0 33)} is VALID [2022-04-07 13:06:13,712 INFO L290 TraceCheckUtils]: 123: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,712 INFO L290 TraceCheckUtils]: 122: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,712 INFO L290 TraceCheckUtils]: 121: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,712 INFO L272 TraceCheckUtils]: 120: Hoare triple {28535#(< ~counter~0 33)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,712 INFO L290 TraceCheckUtils]: 119: Hoare triple {28535#(< ~counter~0 33)} assume !!(#t~post5 < 50);havoc #t~post5; {28535#(< ~counter~0 33)} is VALID [2022-04-07 13:06:13,713 INFO L290 TraceCheckUtils]: 118: Hoare triple {28620#(< ~counter~0 32)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28535#(< ~counter~0 33)} is VALID [2022-04-07 13:06:13,713 INFO L290 TraceCheckUtils]: 117: Hoare triple {28620#(< ~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; {28620#(< ~counter~0 32)} is VALID [2022-04-07 13:06:13,714 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25134#true} {28620#(< ~counter~0 32)} #67#return; {28620#(< ~counter~0 32)} is VALID [2022-04-07 13:06:13,714 INFO L290 TraceCheckUtils]: 115: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,714 INFO L290 TraceCheckUtils]: 114: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,714 INFO L290 TraceCheckUtils]: 113: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,714 INFO L272 TraceCheckUtils]: 112: Hoare triple {28620#(< ~counter~0 32)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,715 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {25134#true} {28620#(< ~counter~0 32)} #65#return; {28620#(< ~counter~0 32)} is VALID [2022-04-07 13:06:13,715 INFO L290 TraceCheckUtils]: 110: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,715 INFO L290 TraceCheckUtils]: 109: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,715 INFO L290 TraceCheckUtils]: 108: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,715 INFO L272 TraceCheckUtils]: 107: Hoare triple {28620#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,716 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {25134#true} {28620#(< ~counter~0 32)} #63#return; {28620#(< ~counter~0 32)} is VALID [2022-04-07 13:06:13,716 INFO L290 TraceCheckUtils]: 105: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,716 INFO L290 TraceCheckUtils]: 104: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,716 INFO L290 TraceCheckUtils]: 103: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,716 INFO L272 TraceCheckUtils]: 102: Hoare triple {28620#(< ~counter~0 32)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,716 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25134#true} {28620#(< ~counter~0 32)} #61#return; {28620#(< ~counter~0 32)} is VALID [2022-04-07 13:06:13,716 INFO L290 TraceCheckUtils]: 100: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,716 INFO L290 TraceCheckUtils]: 99: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,717 INFO L290 TraceCheckUtils]: 98: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,717 INFO L272 TraceCheckUtils]: 97: Hoare triple {28620#(< ~counter~0 32)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,717 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {25134#true} {28620#(< ~counter~0 32)} #59#return; {28620#(< ~counter~0 32)} is VALID [2022-04-07 13:06:13,717 INFO L290 TraceCheckUtils]: 95: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,717 INFO L290 TraceCheckUtils]: 94: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,717 INFO L290 TraceCheckUtils]: 93: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,717 INFO L272 TraceCheckUtils]: 92: Hoare triple {28620#(< ~counter~0 32)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,718 INFO L290 TraceCheckUtils]: 91: Hoare triple {28620#(< ~counter~0 32)} assume !!(#t~post5 < 50);havoc #t~post5; {28620#(< ~counter~0 32)} is VALID [2022-04-07 13:06:13,719 INFO L290 TraceCheckUtils]: 90: Hoare triple {28705#(< ~counter~0 31)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28620#(< ~counter~0 32)} is VALID [2022-04-07 13:06:13,719 INFO L290 TraceCheckUtils]: 89: Hoare triple {28705#(< ~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; {28705#(< ~counter~0 31)} is VALID [2022-04-07 13:06:13,720 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {25134#true} {28705#(< ~counter~0 31)} #67#return; {28705#(< ~counter~0 31)} is VALID [2022-04-07 13:06:13,720 INFO L290 TraceCheckUtils]: 87: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,720 INFO L290 TraceCheckUtils]: 86: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,720 INFO L290 TraceCheckUtils]: 85: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,720 INFO L272 TraceCheckUtils]: 84: Hoare triple {28705#(< ~counter~0 31)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,720 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {25134#true} {28705#(< ~counter~0 31)} #65#return; {28705#(< ~counter~0 31)} is VALID [2022-04-07 13:06:13,720 INFO L290 TraceCheckUtils]: 82: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,721 INFO L290 TraceCheckUtils]: 81: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,721 INFO L290 TraceCheckUtils]: 80: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,721 INFO L272 TraceCheckUtils]: 79: Hoare triple {28705#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,721 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {25134#true} {28705#(< ~counter~0 31)} #63#return; {28705#(< ~counter~0 31)} is VALID [2022-04-07 13:06:13,721 INFO L290 TraceCheckUtils]: 77: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,721 INFO L290 TraceCheckUtils]: 76: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,721 INFO L290 TraceCheckUtils]: 75: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,721 INFO L272 TraceCheckUtils]: 74: Hoare triple {28705#(< ~counter~0 31)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,722 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {25134#true} {28705#(< ~counter~0 31)} #61#return; {28705#(< ~counter~0 31)} is VALID [2022-04-07 13:06:13,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,722 INFO L290 TraceCheckUtils]: 70: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,722 INFO L272 TraceCheckUtils]: 69: Hoare triple {28705#(< ~counter~0 31)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,723 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {25134#true} {28705#(< ~counter~0 31)} #59#return; {28705#(< ~counter~0 31)} is VALID [2022-04-07 13:06:13,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,723 INFO L290 TraceCheckUtils]: 66: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,723 INFO L272 TraceCheckUtils]: 64: Hoare triple {28705#(< ~counter~0 31)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {28705#(< ~counter~0 31)} assume !!(#t~post5 < 50);havoc #t~post5; {28705#(< ~counter~0 31)} is VALID [2022-04-07 13:06:13,724 INFO L290 TraceCheckUtils]: 62: Hoare triple {28790#(< ~counter~0 30)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28705#(< ~counter~0 31)} is VALID [2022-04-07 13:06:13,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {28790#(< ~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; {28790#(< ~counter~0 30)} is VALID [2022-04-07 13:06:13,725 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25134#true} {28790#(< ~counter~0 30)} #67#return; {28790#(< ~counter~0 30)} is VALID [2022-04-07 13:06:13,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,726 INFO L272 TraceCheckUtils]: 56: Hoare triple {28790#(< ~counter~0 30)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,726 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25134#true} {28790#(< ~counter~0 30)} #65#return; {28790#(< ~counter~0 30)} is VALID [2022-04-07 13:06:13,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,726 INFO L272 TraceCheckUtils]: 51: Hoare triple {28790#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,727 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25134#true} {28790#(< ~counter~0 30)} #63#return; {28790#(< ~counter~0 30)} is VALID [2022-04-07 13:06:13,727 INFO L290 TraceCheckUtils]: 49: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,727 INFO L290 TraceCheckUtils]: 48: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,727 INFO L290 TraceCheckUtils]: 47: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,727 INFO L272 TraceCheckUtils]: 46: Hoare triple {28790#(< ~counter~0 30)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,728 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25134#true} {28790#(< ~counter~0 30)} #61#return; {28790#(< ~counter~0 30)} is VALID [2022-04-07 13:06:13,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,728 INFO L272 TraceCheckUtils]: 41: Hoare triple {28790#(< ~counter~0 30)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,728 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {25134#true} {28790#(< ~counter~0 30)} #59#return; {28790#(< ~counter~0 30)} is VALID [2022-04-07 13:06:13,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,729 INFO L290 TraceCheckUtils]: 37: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,729 INFO L272 TraceCheckUtils]: 36: Hoare triple {28790#(< ~counter~0 30)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {28790#(< ~counter~0 30)} assume !!(#t~post5 < 50);havoc #t~post5; {28790#(< ~counter~0 30)} is VALID [2022-04-07 13:06:13,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {28875#(< ~counter~0 29)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28790#(< ~counter~0 30)} is VALID [2022-04-07 13:06:13,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {28875#(< ~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; {28875#(< ~counter~0 29)} is VALID [2022-04-07 13:06:13,731 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25134#true} {28875#(< ~counter~0 29)} #67#return; {28875#(< ~counter~0 29)} is VALID [2022-04-07 13:06:13,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,731 INFO L272 TraceCheckUtils]: 28: Hoare triple {28875#(< ~counter~0 29)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,732 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25134#true} {28875#(< ~counter~0 29)} #65#return; {28875#(< ~counter~0 29)} is VALID [2022-04-07 13:06:13,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,732 INFO L272 TraceCheckUtils]: 23: Hoare triple {28875#(< ~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)); {25134#true} is VALID [2022-04-07 13:06:13,732 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25134#true} {28875#(< ~counter~0 29)} #63#return; {28875#(< ~counter~0 29)} is VALID [2022-04-07 13:06:13,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,733 INFO L272 TraceCheckUtils]: 18: Hoare triple {28875#(< ~counter~0 29)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,733 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25134#true} {28875#(< ~counter~0 29)} #61#return; {28875#(< ~counter~0 29)} is VALID [2022-04-07 13:06:13,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {28875#(< ~counter~0 29)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,734 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {25134#true} {28875#(< ~counter~0 29)} #59#return; {28875#(< ~counter~0 29)} is VALID [2022-04-07 13:06:13,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {25134#true} assume true; {25134#true} is VALID [2022-04-07 13:06:13,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {25134#true} assume !(0 == ~cond); {25134#true} is VALID [2022-04-07 13:06:13,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {25134#true} ~cond := #in~cond; {25134#true} is VALID [2022-04-07 13:06:13,734 INFO L272 TraceCheckUtils]: 8: Hoare triple {28875#(< ~counter~0 29)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25134#true} is VALID [2022-04-07 13:06:13,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {28875#(< ~counter~0 29)} assume !!(#t~post5 < 50);havoc #t~post5; {28875#(< ~counter~0 29)} is VALID [2022-04-07 13:06:13,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {28960#(< ~counter~0 28)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {28875#(< ~counter~0 29)} is VALID [2022-04-07 13:06:13,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {28960#(< ~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; {28960#(< ~counter~0 28)} is VALID [2022-04-07 13:06:13,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {28960#(< ~counter~0 28)} call #t~ret6 := main(); {28960#(< ~counter~0 28)} is VALID [2022-04-07 13:06:13,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28960#(< ~counter~0 28)} {25134#true} #81#return; {28960#(< ~counter~0 28)} is VALID [2022-04-07 13:06:13,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {28960#(< ~counter~0 28)} assume true; {28960#(< ~counter~0 28)} is VALID [2022-04-07 13:06:13,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {25134#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; {28960#(< ~counter~0 28)} is VALID [2022-04-07 13:06:13,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {25134#true} call ULTIMATE.init(); {25134#true} is VALID [2022-04-07 13:06:13,746 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-07 13:06:13,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:06:13,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029332650] [2022-04-07 13:06:13,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:06:13,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790700777] [2022-04-07 13:06:13,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790700777] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:06:13,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:06:13,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-07 13:06:13,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627602220] [2022-04-07 13:06:13,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:06:13,749 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-07 13:06:13,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:06:13,750 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-07 13:06:14,568 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-07 13:06:14,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-07 13:06:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:06:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-07 13:06:14,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-07 13:06:14,570 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-07 13:06:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:28,870 INFO L93 Difference]: Finished difference Result 1312 states and 1336 transitions. [2022-04-07 13:06:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-07 13:06:28,870 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-07 13:06:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:28,872 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-07 13:06:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 782 transitions. [2022-04-07 13:06:28,896 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-07 13:06:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 782 transitions. [2022-04-07 13:06:28,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 782 transitions. [2022-04-07 13:06:29,750 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-07 13:06:29,830 INFO L225 Difference]: With dead ends: 1312 [2022-04-07 13:06:29,831 INFO L226 Difference]: Without dead ends: 1302 [2022-04-07 13:06:29,833 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1310 GetRequests, 1217 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-07 13:06:29,833 INFO L913 BasicCegarLoop]: 251 mSDtfsCounter, 507 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:29,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 1012 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 13:06:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-04-07 13:06:30,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2022-04-07 13:06:30,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:30,529 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-07 13:06:30,530 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-07 13:06:30,532 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-07 13:06:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:30,598 INFO L93 Difference]: Finished difference Result 1302 states and 1303 transitions. [2022-04-07 13:06:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-07 13:06:30,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:30,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:30,603 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-07 13:06:30,605 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-07 13:06:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:30,674 INFO L93 Difference]: Finished difference Result 1302 states and 1303 transitions. [2022-04-07 13:06:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-07 13:06:30,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:30,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:30,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:30,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:30,678 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-07 13:06:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1303 transitions. [2022-04-07 13:06:30,769 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1303 transitions. Word has length 633 [2022-04-07 13:06:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:30,770 INFO L478 AbstractCegarLoop]: Abstraction has 1302 states and 1303 transitions. [2022-04-07 13:06:30,771 INFO L479 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-07 13:06:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1303 transitions. [2022-04-07 13:06:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2022-04-07 13:06:30,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:30,793 INFO L499 BasicCegarLoop]: 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-07 13:06:30,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-07 13:06:31,007 WARN L460 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-07 13:06:31,007 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash 966643877, now seen corresponding path program 5 times [2022-04-07 13:06:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:31,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420424535] [2022-04-07 13:06:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:31,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:06:31,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366499815] [2022-04-07 13:06:31,066 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-07 13:06:31,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:31,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:31,067 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:06:31,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-07 13:06:40,183 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 163 check-sat command(s) [2022-04-07 13:06:40,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 13:06:40,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-07 13:06:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:40,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:06:47,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {35321#true} call ULTIMATE.init(); {35321#true} is VALID [2022-04-07 13:06:47,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {35321#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; {35329#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:47,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {35329#(<= ~counter~0 0)} assume true; {35329#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:47,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35329#(<= ~counter~0 0)} {35321#true} #81#return; {35329#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:47,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {35329#(<= ~counter~0 0)} call #t~ret6 := main(); {35329#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:47,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {35329#(<= ~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; {35329#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:47,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {35329#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {35345#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,039 INFO L272 TraceCheckUtils]: 8: Hoare triple {35345#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {35345#(<= ~counter~0 1)} ~cond := #in~cond; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {35345#(<= ~counter~0 1)} assume !(0 == ~cond); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {35345#(<= ~counter~0 1)} assume true; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,040 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35345#(<= ~counter~0 1)} {35345#(<= ~counter~0 1)} #59#return; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,041 INFO L272 TraceCheckUtils]: 13: Hoare triple {35345#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {35345#(<= ~counter~0 1)} ~cond := #in~cond; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {35345#(<= ~counter~0 1)} assume !(0 == ~cond); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {35345#(<= ~counter~0 1)} assume true; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,042 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35345#(<= ~counter~0 1)} {35345#(<= ~counter~0 1)} #61#return; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,043 INFO L272 TraceCheckUtils]: 18: Hoare triple {35345#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {35345#(<= ~counter~0 1)} ~cond := #in~cond; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {35345#(<= ~counter~0 1)} assume !(0 == ~cond); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {35345#(<= ~counter~0 1)} assume true; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,044 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35345#(<= ~counter~0 1)} {35345#(<= ~counter~0 1)} #63#return; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,045 INFO L272 TraceCheckUtils]: 23: Hoare triple {35345#(<= ~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)); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {35345#(<= ~counter~0 1)} ~cond := #in~cond; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {35345#(<= ~counter~0 1)} assume !(0 == ~cond); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {35345#(<= ~counter~0 1)} assume true; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,046 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {35345#(<= ~counter~0 1)} {35345#(<= ~counter~0 1)} #65#return; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,047 INFO L272 TraceCheckUtils]: 28: Hoare triple {35345#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {35345#(<= ~counter~0 1)} ~cond := #in~cond; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {35345#(<= ~counter~0 1)} assume !(0 == ~cond); {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {35345#(<= ~counter~0 1)} assume true; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,048 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {35345#(<= ~counter~0 1)} {35345#(<= ~counter~0 1)} #67#return; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {35345#(<= ~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; {35345#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:47,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {35345#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {35430#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,050 INFO L272 TraceCheckUtils]: 36: Hoare triple {35430#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {35430#(<= ~counter~0 2)} ~cond := #in~cond; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {35430#(<= ~counter~0 2)} assume !(0 == ~cond); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {35430#(<= ~counter~0 2)} assume true; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,052 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35430#(<= ~counter~0 2)} {35430#(<= ~counter~0 2)} #59#return; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,052 INFO L272 TraceCheckUtils]: 41: Hoare triple {35430#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {35430#(<= ~counter~0 2)} ~cond := #in~cond; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {35430#(<= ~counter~0 2)} assume !(0 == ~cond); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {35430#(<= ~counter~0 2)} assume true; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,054 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {35430#(<= ~counter~0 2)} {35430#(<= ~counter~0 2)} #61#return; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,054 INFO L272 TraceCheckUtils]: 46: Hoare triple {35430#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {35430#(<= ~counter~0 2)} ~cond := #in~cond; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {35430#(<= ~counter~0 2)} assume !(0 == ~cond); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {35430#(<= ~counter~0 2)} assume true; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,056 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {35430#(<= ~counter~0 2)} {35430#(<= ~counter~0 2)} #63#return; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,056 INFO L272 TraceCheckUtils]: 51: Hoare triple {35430#(<= ~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)); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {35430#(<= ~counter~0 2)} ~cond := #in~cond; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {35430#(<= ~counter~0 2)} assume !(0 == ~cond); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {35430#(<= ~counter~0 2)} assume true; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,058 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {35430#(<= ~counter~0 2)} {35430#(<= ~counter~0 2)} #65#return; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,058 INFO L272 TraceCheckUtils]: 56: Hoare triple {35430#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {35430#(<= ~counter~0 2)} ~cond := #in~cond; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {35430#(<= ~counter~0 2)} assume !(0 == ~cond); {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {35430#(<= ~counter~0 2)} assume true; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,060 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {35430#(<= ~counter~0 2)} {35430#(<= ~counter~0 2)} #67#return; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,060 INFO L290 TraceCheckUtils]: 61: Hoare triple {35430#(<= ~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; {35430#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:47,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {35430#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,062 INFO L290 TraceCheckUtils]: 63: Hoare triple {35515#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,062 INFO L272 TraceCheckUtils]: 64: Hoare triple {35515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,063 INFO L290 TraceCheckUtils]: 65: Hoare triple {35515#(<= ~counter~0 3)} ~cond := #in~cond; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,063 INFO L290 TraceCheckUtils]: 66: Hoare triple {35515#(<= ~counter~0 3)} assume !(0 == ~cond); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,063 INFO L290 TraceCheckUtils]: 67: Hoare triple {35515#(<= ~counter~0 3)} assume true; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,064 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35515#(<= ~counter~0 3)} {35515#(<= ~counter~0 3)} #59#return; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,064 INFO L272 TraceCheckUtils]: 69: Hoare triple {35515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {35515#(<= ~counter~0 3)} ~cond := #in~cond; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {35515#(<= ~counter~0 3)} assume !(0 == ~cond); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,065 INFO L290 TraceCheckUtils]: 72: Hoare triple {35515#(<= ~counter~0 3)} assume true; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,066 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35515#(<= ~counter~0 3)} {35515#(<= ~counter~0 3)} #61#return; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,066 INFO L272 TraceCheckUtils]: 74: Hoare triple {35515#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,067 INFO L290 TraceCheckUtils]: 75: Hoare triple {35515#(<= ~counter~0 3)} ~cond := #in~cond; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,067 INFO L290 TraceCheckUtils]: 76: Hoare triple {35515#(<= ~counter~0 3)} assume !(0 == ~cond); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,067 INFO L290 TraceCheckUtils]: 77: Hoare triple {35515#(<= ~counter~0 3)} assume true; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,068 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35515#(<= ~counter~0 3)} {35515#(<= ~counter~0 3)} #63#return; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,068 INFO L272 TraceCheckUtils]: 79: Hoare triple {35515#(<= ~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)); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,069 INFO L290 TraceCheckUtils]: 80: Hoare triple {35515#(<= ~counter~0 3)} ~cond := #in~cond; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,069 INFO L290 TraceCheckUtils]: 81: Hoare triple {35515#(<= ~counter~0 3)} assume !(0 == ~cond); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,069 INFO L290 TraceCheckUtils]: 82: Hoare triple {35515#(<= ~counter~0 3)} assume true; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,070 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {35515#(<= ~counter~0 3)} {35515#(<= ~counter~0 3)} #65#return; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,070 INFO L272 TraceCheckUtils]: 84: Hoare triple {35515#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,071 INFO L290 TraceCheckUtils]: 85: Hoare triple {35515#(<= ~counter~0 3)} ~cond := #in~cond; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,071 INFO L290 TraceCheckUtils]: 86: Hoare triple {35515#(<= ~counter~0 3)} assume !(0 == ~cond); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,071 INFO L290 TraceCheckUtils]: 87: Hoare triple {35515#(<= ~counter~0 3)} assume true; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,072 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {35515#(<= ~counter~0 3)} {35515#(<= ~counter~0 3)} #67#return; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,072 INFO L290 TraceCheckUtils]: 89: Hoare triple {35515#(<= ~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; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:47,073 INFO L290 TraceCheckUtils]: 90: Hoare triple {35515#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,073 INFO L290 TraceCheckUtils]: 91: Hoare triple {35600#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,074 INFO L272 TraceCheckUtils]: 92: Hoare triple {35600#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,074 INFO L290 TraceCheckUtils]: 93: Hoare triple {35600#(<= ~counter~0 4)} ~cond := #in~cond; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,075 INFO L290 TraceCheckUtils]: 94: Hoare triple {35600#(<= ~counter~0 4)} assume !(0 == ~cond); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,075 INFO L290 TraceCheckUtils]: 95: Hoare triple {35600#(<= ~counter~0 4)} assume true; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,075 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35600#(<= ~counter~0 4)} {35600#(<= ~counter~0 4)} #59#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,076 INFO L272 TraceCheckUtils]: 97: Hoare triple {35600#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,076 INFO L290 TraceCheckUtils]: 98: Hoare triple {35600#(<= ~counter~0 4)} ~cond := #in~cond; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,077 INFO L290 TraceCheckUtils]: 99: Hoare triple {35600#(<= ~counter~0 4)} assume !(0 == ~cond); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,077 INFO L290 TraceCheckUtils]: 100: Hoare triple {35600#(<= ~counter~0 4)} assume true; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,077 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35600#(<= ~counter~0 4)} {35600#(<= ~counter~0 4)} #61#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,078 INFO L272 TraceCheckUtils]: 102: Hoare triple {35600#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,078 INFO L290 TraceCheckUtils]: 103: Hoare triple {35600#(<= ~counter~0 4)} ~cond := #in~cond; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,079 INFO L290 TraceCheckUtils]: 104: Hoare triple {35600#(<= ~counter~0 4)} assume !(0 == ~cond); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,079 INFO L290 TraceCheckUtils]: 105: Hoare triple {35600#(<= ~counter~0 4)} assume true; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,079 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {35600#(<= ~counter~0 4)} {35600#(<= ~counter~0 4)} #63#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,080 INFO L272 TraceCheckUtils]: 107: Hoare triple {35600#(<= ~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)); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,080 INFO L290 TraceCheckUtils]: 108: Hoare triple {35600#(<= ~counter~0 4)} ~cond := #in~cond; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,081 INFO L290 TraceCheckUtils]: 109: Hoare triple {35600#(<= ~counter~0 4)} assume !(0 == ~cond); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,081 INFO L290 TraceCheckUtils]: 110: Hoare triple {35600#(<= ~counter~0 4)} assume true; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,081 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {35600#(<= ~counter~0 4)} {35600#(<= ~counter~0 4)} #65#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,082 INFO L272 TraceCheckUtils]: 112: Hoare triple {35600#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,082 INFO L290 TraceCheckUtils]: 113: Hoare triple {35600#(<= ~counter~0 4)} ~cond := #in~cond; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,083 INFO L290 TraceCheckUtils]: 114: Hoare triple {35600#(<= ~counter~0 4)} assume !(0 == ~cond); {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,083 INFO L290 TraceCheckUtils]: 115: Hoare triple {35600#(<= ~counter~0 4)} assume true; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,084 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {35600#(<= ~counter~0 4)} {35600#(<= ~counter~0 4)} #67#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,084 INFO L290 TraceCheckUtils]: 117: Hoare triple {35600#(<= ~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; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:47,085 INFO L290 TraceCheckUtils]: 118: Hoare triple {35600#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,085 INFO L290 TraceCheckUtils]: 119: Hoare triple {35685#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,086 INFO L272 TraceCheckUtils]: 120: Hoare triple {35685#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,086 INFO L290 TraceCheckUtils]: 121: Hoare triple {35685#(<= ~counter~0 5)} ~cond := #in~cond; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,086 INFO L290 TraceCheckUtils]: 122: Hoare triple {35685#(<= ~counter~0 5)} assume !(0 == ~cond); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,087 INFO L290 TraceCheckUtils]: 123: Hoare triple {35685#(<= ~counter~0 5)} assume true; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,087 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {35685#(<= ~counter~0 5)} {35685#(<= ~counter~0 5)} #59#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,088 INFO L272 TraceCheckUtils]: 125: Hoare triple {35685#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,088 INFO L290 TraceCheckUtils]: 126: Hoare triple {35685#(<= ~counter~0 5)} ~cond := #in~cond; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,088 INFO L290 TraceCheckUtils]: 127: Hoare triple {35685#(<= ~counter~0 5)} assume !(0 == ~cond); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,089 INFO L290 TraceCheckUtils]: 128: Hoare triple {35685#(<= ~counter~0 5)} assume true; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,089 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {35685#(<= ~counter~0 5)} {35685#(<= ~counter~0 5)} #61#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,090 INFO L272 TraceCheckUtils]: 130: Hoare triple {35685#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,090 INFO L290 TraceCheckUtils]: 131: Hoare triple {35685#(<= ~counter~0 5)} ~cond := #in~cond; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,090 INFO L290 TraceCheckUtils]: 132: Hoare triple {35685#(<= ~counter~0 5)} assume !(0 == ~cond); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,091 INFO L290 TraceCheckUtils]: 133: Hoare triple {35685#(<= ~counter~0 5)} assume true; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,091 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {35685#(<= ~counter~0 5)} {35685#(<= ~counter~0 5)} #63#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,092 INFO L272 TraceCheckUtils]: 135: Hoare triple {35685#(<= ~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)); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,092 INFO L290 TraceCheckUtils]: 136: Hoare triple {35685#(<= ~counter~0 5)} ~cond := #in~cond; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,093 INFO L290 TraceCheckUtils]: 137: Hoare triple {35685#(<= ~counter~0 5)} assume !(0 == ~cond); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,093 INFO L290 TraceCheckUtils]: 138: Hoare triple {35685#(<= ~counter~0 5)} assume true; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,094 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {35685#(<= ~counter~0 5)} {35685#(<= ~counter~0 5)} #65#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,094 INFO L272 TraceCheckUtils]: 140: Hoare triple {35685#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,095 INFO L290 TraceCheckUtils]: 141: Hoare triple {35685#(<= ~counter~0 5)} ~cond := #in~cond; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,095 INFO L290 TraceCheckUtils]: 142: Hoare triple {35685#(<= ~counter~0 5)} assume !(0 == ~cond); {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,095 INFO L290 TraceCheckUtils]: 143: Hoare triple {35685#(<= ~counter~0 5)} assume true; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,096 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {35685#(<= ~counter~0 5)} {35685#(<= ~counter~0 5)} #67#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,096 INFO L290 TraceCheckUtils]: 145: Hoare triple {35685#(<= ~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; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:47,097 INFO L290 TraceCheckUtils]: 146: Hoare triple {35685#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,098 INFO L290 TraceCheckUtils]: 147: Hoare triple {35770#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,099 INFO L272 TraceCheckUtils]: 148: Hoare triple {35770#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,099 INFO L290 TraceCheckUtils]: 149: Hoare triple {35770#(<= ~counter~0 6)} ~cond := #in~cond; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,099 INFO L290 TraceCheckUtils]: 150: Hoare triple {35770#(<= ~counter~0 6)} assume !(0 == ~cond); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,100 INFO L290 TraceCheckUtils]: 151: Hoare triple {35770#(<= ~counter~0 6)} assume true; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,100 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {35770#(<= ~counter~0 6)} {35770#(<= ~counter~0 6)} #59#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,101 INFO L272 TraceCheckUtils]: 153: Hoare triple {35770#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,101 INFO L290 TraceCheckUtils]: 154: Hoare triple {35770#(<= ~counter~0 6)} ~cond := #in~cond; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,102 INFO L290 TraceCheckUtils]: 155: Hoare triple {35770#(<= ~counter~0 6)} assume !(0 == ~cond); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,102 INFO L290 TraceCheckUtils]: 156: Hoare triple {35770#(<= ~counter~0 6)} assume true; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,103 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {35770#(<= ~counter~0 6)} {35770#(<= ~counter~0 6)} #61#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,103 INFO L272 TraceCheckUtils]: 158: Hoare triple {35770#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,104 INFO L290 TraceCheckUtils]: 159: Hoare triple {35770#(<= ~counter~0 6)} ~cond := #in~cond; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,104 INFO L290 TraceCheckUtils]: 160: Hoare triple {35770#(<= ~counter~0 6)} assume !(0 == ~cond); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,104 INFO L290 TraceCheckUtils]: 161: Hoare triple {35770#(<= ~counter~0 6)} assume true; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,105 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {35770#(<= ~counter~0 6)} {35770#(<= ~counter~0 6)} #63#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,106 INFO L272 TraceCheckUtils]: 163: Hoare triple {35770#(<= ~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)); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,106 INFO L290 TraceCheckUtils]: 164: Hoare triple {35770#(<= ~counter~0 6)} ~cond := #in~cond; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,106 INFO L290 TraceCheckUtils]: 165: Hoare triple {35770#(<= ~counter~0 6)} assume !(0 == ~cond); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,107 INFO L290 TraceCheckUtils]: 166: Hoare triple {35770#(<= ~counter~0 6)} assume true; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,107 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {35770#(<= ~counter~0 6)} {35770#(<= ~counter~0 6)} #65#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,108 INFO L272 TraceCheckUtils]: 168: Hoare triple {35770#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,108 INFO L290 TraceCheckUtils]: 169: Hoare triple {35770#(<= ~counter~0 6)} ~cond := #in~cond; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,109 INFO L290 TraceCheckUtils]: 170: Hoare triple {35770#(<= ~counter~0 6)} assume !(0 == ~cond); {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,109 INFO L290 TraceCheckUtils]: 171: Hoare triple {35770#(<= ~counter~0 6)} assume true; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,110 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {35770#(<= ~counter~0 6)} {35770#(<= ~counter~0 6)} #67#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,110 INFO L290 TraceCheckUtils]: 173: Hoare triple {35770#(<= ~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; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:47,111 INFO L290 TraceCheckUtils]: 174: Hoare triple {35770#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,112 INFO L290 TraceCheckUtils]: 175: Hoare triple {35855#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,112 INFO L272 TraceCheckUtils]: 176: Hoare triple {35855#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,113 INFO L290 TraceCheckUtils]: 177: Hoare triple {35855#(<= ~counter~0 7)} ~cond := #in~cond; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,113 INFO L290 TraceCheckUtils]: 178: Hoare triple {35855#(<= ~counter~0 7)} assume !(0 == ~cond); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,113 INFO L290 TraceCheckUtils]: 179: Hoare triple {35855#(<= ~counter~0 7)} assume true; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,114 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {35855#(<= ~counter~0 7)} {35855#(<= ~counter~0 7)} #59#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,114 INFO L272 TraceCheckUtils]: 181: Hoare triple {35855#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,115 INFO L290 TraceCheckUtils]: 182: Hoare triple {35855#(<= ~counter~0 7)} ~cond := #in~cond; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,115 INFO L290 TraceCheckUtils]: 183: Hoare triple {35855#(<= ~counter~0 7)} assume !(0 == ~cond); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,116 INFO L290 TraceCheckUtils]: 184: Hoare triple {35855#(<= ~counter~0 7)} assume true; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,116 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {35855#(<= ~counter~0 7)} {35855#(<= ~counter~0 7)} #61#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,117 INFO L272 TraceCheckUtils]: 186: Hoare triple {35855#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,117 INFO L290 TraceCheckUtils]: 187: Hoare triple {35855#(<= ~counter~0 7)} ~cond := #in~cond; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,117 INFO L290 TraceCheckUtils]: 188: Hoare triple {35855#(<= ~counter~0 7)} assume !(0 == ~cond); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,118 INFO L290 TraceCheckUtils]: 189: Hoare triple {35855#(<= ~counter~0 7)} assume true; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,118 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {35855#(<= ~counter~0 7)} {35855#(<= ~counter~0 7)} #63#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,119 INFO L272 TraceCheckUtils]: 191: Hoare triple {35855#(<= ~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)); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,119 INFO L290 TraceCheckUtils]: 192: Hoare triple {35855#(<= ~counter~0 7)} ~cond := #in~cond; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,119 INFO L290 TraceCheckUtils]: 193: Hoare triple {35855#(<= ~counter~0 7)} assume !(0 == ~cond); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,120 INFO L290 TraceCheckUtils]: 194: Hoare triple {35855#(<= ~counter~0 7)} assume true; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,120 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {35855#(<= ~counter~0 7)} {35855#(<= ~counter~0 7)} #65#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,121 INFO L272 TraceCheckUtils]: 196: Hoare triple {35855#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,121 INFO L290 TraceCheckUtils]: 197: Hoare triple {35855#(<= ~counter~0 7)} ~cond := #in~cond; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,122 INFO L290 TraceCheckUtils]: 198: Hoare triple {35855#(<= ~counter~0 7)} assume !(0 == ~cond); {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,122 INFO L290 TraceCheckUtils]: 199: Hoare triple {35855#(<= ~counter~0 7)} assume true; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,123 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {35855#(<= ~counter~0 7)} {35855#(<= ~counter~0 7)} #67#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,123 INFO L290 TraceCheckUtils]: 201: Hoare triple {35855#(<= ~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; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:47,124 INFO L290 TraceCheckUtils]: 202: Hoare triple {35855#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,125 INFO L290 TraceCheckUtils]: 203: Hoare triple {35940#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,125 INFO L272 TraceCheckUtils]: 204: Hoare triple {35940#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,126 INFO L290 TraceCheckUtils]: 205: Hoare triple {35940#(<= ~counter~0 8)} ~cond := #in~cond; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,126 INFO L290 TraceCheckUtils]: 206: Hoare triple {35940#(<= ~counter~0 8)} assume !(0 == ~cond); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,126 INFO L290 TraceCheckUtils]: 207: Hoare triple {35940#(<= ~counter~0 8)} assume true; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,127 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {35940#(<= ~counter~0 8)} {35940#(<= ~counter~0 8)} #59#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,127 INFO L272 TraceCheckUtils]: 209: Hoare triple {35940#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,128 INFO L290 TraceCheckUtils]: 210: Hoare triple {35940#(<= ~counter~0 8)} ~cond := #in~cond; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,128 INFO L290 TraceCheckUtils]: 211: Hoare triple {35940#(<= ~counter~0 8)} assume !(0 == ~cond); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,128 INFO L290 TraceCheckUtils]: 212: Hoare triple {35940#(<= ~counter~0 8)} assume true; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,129 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {35940#(<= ~counter~0 8)} {35940#(<= ~counter~0 8)} #61#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,129 INFO L272 TraceCheckUtils]: 214: Hoare triple {35940#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,130 INFO L290 TraceCheckUtils]: 215: Hoare triple {35940#(<= ~counter~0 8)} ~cond := #in~cond; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,130 INFO L290 TraceCheckUtils]: 216: Hoare triple {35940#(<= ~counter~0 8)} assume !(0 == ~cond); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,130 INFO L290 TraceCheckUtils]: 217: Hoare triple {35940#(<= ~counter~0 8)} assume true; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,131 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {35940#(<= ~counter~0 8)} {35940#(<= ~counter~0 8)} #63#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,132 INFO L272 TraceCheckUtils]: 219: Hoare triple {35940#(<= ~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)); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,132 INFO L290 TraceCheckUtils]: 220: Hoare triple {35940#(<= ~counter~0 8)} ~cond := #in~cond; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,132 INFO L290 TraceCheckUtils]: 221: Hoare triple {35940#(<= ~counter~0 8)} assume !(0 == ~cond); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,132 INFO L290 TraceCheckUtils]: 222: Hoare triple {35940#(<= ~counter~0 8)} assume true; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,133 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {35940#(<= ~counter~0 8)} {35940#(<= ~counter~0 8)} #65#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,134 INFO L272 TraceCheckUtils]: 224: Hoare triple {35940#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,134 INFO L290 TraceCheckUtils]: 225: Hoare triple {35940#(<= ~counter~0 8)} ~cond := #in~cond; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,134 INFO L290 TraceCheckUtils]: 226: Hoare triple {35940#(<= ~counter~0 8)} assume !(0 == ~cond); {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,135 INFO L290 TraceCheckUtils]: 227: Hoare triple {35940#(<= ~counter~0 8)} assume true; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,135 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {35940#(<= ~counter~0 8)} {35940#(<= ~counter~0 8)} #67#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,136 INFO L290 TraceCheckUtils]: 229: Hoare triple {35940#(<= ~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; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:47,137 INFO L290 TraceCheckUtils]: 230: Hoare triple {35940#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,137 INFO L290 TraceCheckUtils]: 231: Hoare triple {36025#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,138 INFO L272 TraceCheckUtils]: 232: Hoare triple {36025#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,138 INFO L290 TraceCheckUtils]: 233: Hoare triple {36025#(<= ~counter~0 9)} ~cond := #in~cond; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,138 INFO L290 TraceCheckUtils]: 234: Hoare triple {36025#(<= ~counter~0 9)} assume !(0 == ~cond); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,139 INFO L290 TraceCheckUtils]: 235: Hoare triple {36025#(<= ~counter~0 9)} assume true; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,139 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {36025#(<= ~counter~0 9)} {36025#(<= ~counter~0 9)} #59#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,140 INFO L272 TraceCheckUtils]: 237: Hoare triple {36025#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,140 INFO L290 TraceCheckUtils]: 238: Hoare triple {36025#(<= ~counter~0 9)} ~cond := #in~cond; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,140 INFO L290 TraceCheckUtils]: 239: Hoare triple {36025#(<= ~counter~0 9)} assume !(0 == ~cond); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,141 INFO L290 TraceCheckUtils]: 240: Hoare triple {36025#(<= ~counter~0 9)} assume true; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,141 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {36025#(<= ~counter~0 9)} {36025#(<= ~counter~0 9)} #61#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,142 INFO L272 TraceCheckUtils]: 242: Hoare triple {36025#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,142 INFO L290 TraceCheckUtils]: 243: Hoare triple {36025#(<= ~counter~0 9)} ~cond := #in~cond; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,143 INFO L290 TraceCheckUtils]: 244: Hoare triple {36025#(<= ~counter~0 9)} assume !(0 == ~cond); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,143 INFO L290 TraceCheckUtils]: 245: Hoare triple {36025#(<= ~counter~0 9)} assume true; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,144 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {36025#(<= ~counter~0 9)} {36025#(<= ~counter~0 9)} #63#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,144 INFO L272 TraceCheckUtils]: 247: Hoare triple {36025#(<= ~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)); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,144 INFO L290 TraceCheckUtils]: 248: Hoare triple {36025#(<= ~counter~0 9)} ~cond := #in~cond; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,145 INFO L290 TraceCheckUtils]: 249: Hoare triple {36025#(<= ~counter~0 9)} assume !(0 == ~cond); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,145 INFO L290 TraceCheckUtils]: 250: Hoare triple {36025#(<= ~counter~0 9)} assume true; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,146 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {36025#(<= ~counter~0 9)} {36025#(<= ~counter~0 9)} #65#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,146 INFO L272 TraceCheckUtils]: 252: Hoare triple {36025#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,147 INFO L290 TraceCheckUtils]: 253: Hoare triple {36025#(<= ~counter~0 9)} ~cond := #in~cond; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,147 INFO L290 TraceCheckUtils]: 254: Hoare triple {36025#(<= ~counter~0 9)} assume !(0 == ~cond); {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,147 INFO L290 TraceCheckUtils]: 255: Hoare triple {36025#(<= ~counter~0 9)} assume true; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,148 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {36025#(<= ~counter~0 9)} {36025#(<= ~counter~0 9)} #67#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,148 INFO L290 TraceCheckUtils]: 257: Hoare triple {36025#(<= ~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; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:47,149 INFO L290 TraceCheckUtils]: 258: Hoare triple {36025#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,150 INFO L290 TraceCheckUtils]: 259: Hoare triple {36110#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,150 INFO L272 TraceCheckUtils]: 260: Hoare triple {36110#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,151 INFO L290 TraceCheckUtils]: 261: Hoare triple {36110#(<= ~counter~0 10)} ~cond := #in~cond; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,151 INFO L290 TraceCheckUtils]: 262: Hoare triple {36110#(<= ~counter~0 10)} assume !(0 == ~cond); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,151 INFO L290 TraceCheckUtils]: 263: Hoare triple {36110#(<= ~counter~0 10)} assume true; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,152 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {36110#(<= ~counter~0 10)} {36110#(<= ~counter~0 10)} #59#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,152 INFO L272 TraceCheckUtils]: 265: Hoare triple {36110#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,153 INFO L290 TraceCheckUtils]: 266: Hoare triple {36110#(<= ~counter~0 10)} ~cond := #in~cond; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,153 INFO L290 TraceCheckUtils]: 267: Hoare triple {36110#(<= ~counter~0 10)} assume !(0 == ~cond); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,153 INFO L290 TraceCheckUtils]: 268: Hoare triple {36110#(<= ~counter~0 10)} assume true; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,154 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {36110#(<= ~counter~0 10)} {36110#(<= ~counter~0 10)} #61#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,154 INFO L272 TraceCheckUtils]: 270: Hoare triple {36110#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,154 INFO L290 TraceCheckUtils]: 271: Hoare triple {36110#(<= ~counter~0 10)} ~cond := #in~cond; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,155 INFO L290 TraceCheckUtils]: 272: Hoare triple {36110#(<= ~counter~0 10)} assume !(0 == ~cond); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,155 INFO L290 TraceCheckUtils]: 273: Hoare triple {36110#(<= ~counter~0 10)} assume true; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,156 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {36110#(<= ~counter~0 10)} {36110#(<= ~counter~0 10)} #63#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,156 INFO L272 TraceCheckUtils]: 275: Hoare triple {36110#(<= ~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)); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,156 INFO L290 TraceCheckUtils]: 276: Hoare triple {36110#(<= ~counter~0 10)} ~cond := #in~cond; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,157 INFO L290 TraceCheckUtils]: 277: Hoare triple {36110#(<= ~counter~0 10)} assume !(0 == ~cond); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,157 INFO L290 TraceCheckUtils]: 278: Hoare triple {36110#(<= ~counter~0 10)} assume true; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,157 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {36110#(<= ~counter~0 10)} {36110#(<= ~counter~0 10)} #65#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,158 INFO L272 TraceCheckUtils]: 280: Hoare triple {36110#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,158 INFO L290 TraceCheckUtils]: 281: Hoare triple {36110#(<= ~counter~0 10)} ~cond := #in~cond; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,158 INFO L290 TraceCheckUtils]: 282: Hoare triple {36110#(<= ~counter~0 10)} assume !(0 == ~cond); {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,159 INFO L290 TraceCheckUtils]: 283: Hoare triple {36110#(<= ~counter~0 10)} assume true; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,159 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {36110#(<= ~counter~0 10)} {36110#(<= ~counter~0 10)} #67#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,159 INFO L290 TraceCheckUtils]: 285: Hoare triple {36110#(<= ~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; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:47,161 INFO L290 TraceCheckUtils]: 286: Hoare triple {36110#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,161 INFO L290 TraceCheckUtils]: 287: Hoare triple {36195#(<= ~counter~0 11)} assume !!(#t~post5 < 50);havoc #t~post5; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,161 INFO L272 TraceCheckUtils]: 288: Hoare triple {36195#(<= ~counter~0 11)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,162 INFO L290 TraceCheckUtils]: 289: Hoare triple {36195#(<= ~counter~0 11)} ~cond := #in~cond; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,162 INFO L290 TraceCheckUtils]: 290: Hoare triple {36195#(<= ~counter~0 11)} assume !(0 == ~cond); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,162 INFO L290 TraceCheckUtils]: 291: Hoare triple {36195#(<= ~counter~0 11)} assume true; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,163 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {36195#(<= ~counter~0 11)} {36195#(<= ~counter~0 11)} #59#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,163 INFO L272 TraceCheckUtils]: 293: Hoare triple {36195#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,163 INFO L290 TraceCheckUtils]: 294: Hoare triple {36195#(<= ~counter~0 11)} ~cond := #in~cond; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,164 INFO L290 TraceCheckUtils]: 295: Hoare triple {36195#(<= ~counter~0 11)} assume !(0 == ~cond); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,164 INFO L290 TraceCheckUtils]: 296: Hoare triple {36195#(<= ~counter~0 11)} assume true; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,164 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {36195#(<= ~counter~0 11)} {36195#(<= ~counter~0 11)} #61#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,165 INFO L272 TraceCheckUtils]: 298: Hoare triple {36195#(<= ~counter~0 11)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,165 INFO L290 TraceCheckUtils]: 299: Hoare triple {36195#(<= ~counter~0 11)} ~cond := #in~cond; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,166 INFO L290 TraceCheckUtils]: 300: Hoare triple {36195#(<= ~counter~0 11)} assume !(0 == ~cond); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,166 INFO L290 TraceCheckUtils]: 301: Hoare triple {36195#(<= ~counter~0 11)} assume true; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,166 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {36195#(<= ~counter~0 11)} {36195#(<= ~counter~0 11)} #63#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,167 INFO L272 TraceCheckUtils]: 303: Hoare triple {36195#(<= ~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)); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,167 INFO L290 TraceCheckUtils]: 304: Hoare triple {36195#(<= ~counter~0 11)} ~cond := #in~cond; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,167 INFO L290 TraceCheckUtils]: 305: Hoare triple {36195#(<= ~counter~0 11)} assume !(0 == ~cond); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,168 INFO L290 TraceCheckUtils]: 306: Hoare triple {36195#(<= ~counter~0 11)} assume true; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,168 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {36195#(<= ~counter~0 11)} {36195#(<= ~counter~0 11)} #65#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,169 INFO L272 TraceCheckUtils]: 308: Hoare triple {36195#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,169 INFO L290 TraceCheckUtils]: 309: Hoare triple {36195#(<= ~counter~0 11)} ~cond := #in~cond; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,169 INFO L290 TraceCheckUtils]: 310: Hoare triple {36195#(<= ~counter~0 11)} assume !(0 == ~cond); {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,170 INFO L290 TraceCheckUtils]: 311: Hoare triple {36195#(<= ~counter~0 11)} assume true; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,170 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {36195#(<= ~counter~0 11)} {36195#(<= ~counter~0 11)} #67#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,170 INFO L290 TraceCheckUtils]: 313: Hoare triple {36195#(<= ~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; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:47,171 INFO L290 TraceCheckUtils]: 314: Hoare triple {36195#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,172 INFO L290 TraceCheckUtils]: 315: Hoare triple {36280#(<= ~counter~0 12)} assume !!(#t~post5 < 50);havoc #t~post5; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,172 INFO L272 TraceCheckUtils]: 316: Hoare triple {36280#(<= ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,173 INFO L290 TraceCheckUtils]: 317: Hoare triple {36280#(<= ~counter~0 12)} ~cond := #in~cond; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,173 INFO L290 TraceCheckUtils]: 318: Hoare triple {36280#(<= ~counter~0 12)} assume !(0 == ~cond); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,173 INFO L290 TraceCheckUtils]: 319: Hoare triple {36280#(<= ~counter~0 12)} assume true; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,174 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {36280#(<= ~counter~0 12)} {36280#(<= ~counter~0 12)} #59#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,174 INFO L272 TraceCheckUtils]: 321: Hoare triple {36280#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,174 INFO L290 TraceCheckUtils]: 322: Hoare triple {36280#(<= ~counter~0 12)} ~cond := #in~cond; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,175 INFO L290 TraceCheckUtils]: 323: Hoare triple {36280#(<= ~counter~0 12)} assume !(0 == ~cond); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,175 INFO L290 TraceCheckUtils]: 324: Hoare triple {36280#(<= ~counter~0 12)} assume true; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,175 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {36280#(<= ~counter~0 12)} {36280#(<= ~counter~0 12)} #61#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,176 INFO L272 TraceCheckUtils]: 326: Hoare triple {36280#(<= ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,176 INFO L290 TraceCheckUtils]: 327: Hoare triple {36280#(<= ~counter~0 12)} ~cond := #in~cond; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,177 INFO L290 TraceCheckUtils]: 328: Hoare triple {36280#(<= ~counter~0 12)} assume !(0 == ~cond); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,177 INFO L290 TraceCheckUtils]: 329: Hoare triple {36280#(<= ~counter~0 12)} assume true; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,177 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {36280#(<= ~counter~0 12)} {36280#(<= ~counter~0 12)} #63#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,178 INFO L272 TraceCheckUtils]: 331: Hoare triple {36280#(<= ~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)); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,178 INFO L290 TraceCheckUtils]: 332: Hoare triple {36280#(<= ~counter~0 12)} ~cond := #in~cond; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,178 INFO L290 TraceCheckUtils]: 333: Hoare triple {36280#(<= ~counter~0 12)} assume !(0 == ~cond); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,179 INFO L290 TraceCheckUtils]: 334: Hoare triple {36280#(<= ~counter~0 12)} assume true; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,184 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {36280#(<= ~counter~0 12)} {36280#(<= ~counter~0 12)} #65#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,184 INFO L272 TraceCheckUtils]: 336: Hoare triple {36280#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,184 INFO L290 TraceCheckUtils]: 337: Hoare triple {36280#(<= ~counter~0 12)} ~cond := #in~cond; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,185 INFO L290 TraceCheckUtils]: 338: Hoare triple {36280#(<= ~counter~0 12)} assume !(0 == ~cond); {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,185 INFO L290 TraceCheckUtils]: 339: Hoare triple {36280#(<= ~counter~0 12)} assume true; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,186 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {36280#(<= ~counter~0 12)} {36280#(<= ~counter~0 12)} #67#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,186 INFO L290 TraceCheckUtils]: 341: Hoare triple {36280#(<= ~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; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:47,187 INFO L290 TraceCheckUtils]: 342: Hoare triple {36280#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,187 INFO L290 TraceCheckUtils]: 343: Hoare triple {36365#(<= ~counter~0 13)} assume !!(#t~post5 < 50);havoc #t~post5; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,188 INFO L272 TraceCheckUtils]: 344: Hoare triple {36365#(<= ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,188 INFO L290 TraceCheckUtils]: 345: Hoare triple {36365#(<= ~counter~0 13)} ~cond := #in~cond; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,188 INFO L290 TraceCheckUtils]: 346: Hoare triple {36365#(<= ~counter~0 13)} assume !(0 == ~cond); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,189 INFO L290 TraceCheckUtils]: 347: Hoare triple {36365#(<= ~counter~0 13)} assume true; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,189 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {36365#(<= ~counter~0 13)} {36365#(<= ~counter~0 13)} #59#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,190 INFO L272 TraceCheckUtils]: 349: Hoare triple {36365#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,190 INFO L290 TraceCheckUtils]: 350: Hoare triple {36365#(<= ~counter~0 13)} ~cond := #in~cond; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,190 INFO L290 TraceCheckUtils]: 351: Hoare triple {36365#(<= ~counter~0 13)} assume !(0 == ~cond); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,191 INFO L290 TraceCheckUtils]: 352: Hoare triple {36365#(<= ~counter~0 13)} assume true; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,191 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {36365#(<= ~counter~0 13)} {36365#(<= ~counter~0 13)} #61#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,191 INFO L272 TraceCheckUtils]: 354: Hoare triple {36365#(<= ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,192 INFO L290 TraceCheckUtils]: 355: Hoare triple {36365#(<= ~counter~0 13)} ~cond := #in~cond; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,192 INFO L290 TraceCheckUtils]: 356: Hoare triple {36365#(<= ~counter~0 13)} assume !(0 == ~cond); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,192 INFO L290 TraceCheckUtils]: 357: Hoare triple {36365#(<= ~counter~0 13)} assume true; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,193 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {36365#(<= ~counter~0 13)} {36365#(<= ~counter~0 13)} #63#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,193 INFO L272 TraceCheckUtils]: 359: Hoare triple {36365#(<= ~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)); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,194 INFO L290 TraceCheckUtils]: 360: Hoare triple {36365#(<= ~counter~0 13)} ~cond := #in~cond; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,194 INFO L290 TraceCheckUtils]: 361: Hoare triple {36365#(<= ~counter~0 13)} assume !(0 == ~cond); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,194 INFO L290 TraceCheckUtils]: 362: Hoare triple {36365#(<= ~counter~0 13)} assume true; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,195 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {36365#(<= ~counter~0 13)} {36365#(<= ~counter~0 13)} #65#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,195 INFO L272 TraceCheckUtils]: 364: Hoare triple {36365#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,195 INFO L290 TraceCheckUtils]: 365: Hoare triple {36365#(<= ~counter~0 13)} ~cond := #in~cond; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,196 INFO L290 TraceCheckUtils]: 366: Hoare triple {36365#(<= ~counter~0 13)} assume !(0 == ~cond); {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,196 INFO L290 TraceCheckUtils]: 367: Hoare triple {36365#(<= ~counter~0 13)} assume true; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,196 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {36365#(<= ~counter~0 13)} {36365#(<= ~counter~0 13)} #67#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,197 INFO L290 TraceCheckUtils]: 369: Hoare triple {36365#(<= ~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; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:47,198 INFO L290 TraceCheckUtils]: 370: Hoare triple {36365#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,198 INFO L290 TraceCheckUtils]: 371: Hoare triple {36450#(<= ~counter~0 14)} assume !!(#t~post5 < 50);havoc #t~post5; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,199 INFO L272 TraceCheckUtils]: 372: Hoare triple {36450#(<= ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,199 INFO L290 TraceCheckUtils]: 373: Hoare triple {36450#(<= ~counter~0 14)} ~cond := #in~cond; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,199 INFO L290 TraceCheckUtils]: 374: Hoare triple {36450#(<= ~counter~0 14)} assume !(0 == ~cond); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,200 INFO L290 TraceCheckUtils]: 375: Hoare triple {36450#(<= ~counter~0 14)} assume true; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,200 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {36450#(<= ~counter~0 14)} {36450#(<= ~counter~0 14)} #59#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,201 INFO L272 TraceCheckUtils]: 377: Hoare triple {36450#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,201 INFO L290 TraceCheckUtils]: 378: Hoare triple {36450#(<= ~counter~0 14)} ~cond := #in~cond; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,201 INFO L290 TraceCheckUtils]: 379: Hoare triple {36450#(<= ~counter~0 14)} assume !(0 == ~cond); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,201 INFO L290 TraceCheckUtils]: 380: Hoare triple {36450#(<= ~counter~0 14)} assume true; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,202 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {36450#(<= ~counter~0 14)} {36450#(<= ~counter~0 14)} #61#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,202 INFO L272 TraceCheckUtils]: 382: Hoare triple {36450#(<= ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,203 INFO L290 TraceCheckUtils]: 383: Hoare triple {36450#(<= ~counter~0 14)} ~cond := #in~cond; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,203 INFO L290 TraceCheckUtils]: 384: Hoare triple {36450#(<= ~counter~0 14)} assume !(0 == ~cond); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,203 INFO L290 TraceCheckUtils]: 385: Hoare triple {36450#(<= ~counter~0 14)} assume true; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,204 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {36450#(<= ~counter~0 14)} {36450#(<= ~counter~0 14)} #63#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,204 INFO L272 TraceCheckUtils]: 387: Hoare triple {36450#(<= ~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)); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,205 INFO L290 TraceCheckUtils]: 388: Hoare triple {36450#(<= ~counter~0 14)} ~cond := #in~cond; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,205 INFO L290 TraceCheckUtils]: 389: Hoare triple {36450#(<= ~counter~0 14)} assume !(0 == ~cond); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,205 INFO L290 TraceCheckUtils]: 390: Hoare triple {36450#(<= ~counter~0 14)} assume true; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,206 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {36450#(<= ~counter~0 14)} {36450#(<= ~counter~0 14)} #65#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,206 INFO L272 TraceCheckUtils]: 392: Hoare triple {36450#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,206 INFO L290 TraceCheckUtils]: 393: Hoare triple {36450#(<= ~counter~0 14)} ~cond := #in~cond; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,207 INFO L290 TraceCheckUtils]: 394: Hoare triple {36450#(<= ~counter~0 14)} assume !(0 == ~cond); {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,207 INFO L290 TraceCheckUtils]: 395: Hoare triple {36450#(<= ~counter~0 14)} assume true; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,207 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {36450#(<= ~counter~0 14)} {36450#(<= ~counter~0 14)} #67#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,208 INFO L290 TraceCheckUtils]: 397: Hoare triple {36450#(<= ~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; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:47,209 INFO L290 TraceCheckUtils]: 398: Hoare triple {36450#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,209 INFO L290 TraceCheckUtils]: 399: Hoare triple {36535#(<= ~counter~0 15)} assume !!(#t~post5 < 50);havoc #t~post5; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,210 INFO L272 TraceCheckUtils]: 400: Hoare triple {36535#(<= ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,210 INFO L290 TraceCheckUtils]: 401: Hoare triple {36535#(<= ~counter~0 15)} ~cond := #in~cond; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,210 INFO L290 TraceCheckUtils]: 402: Hoare triple {36535#(<= ~counter~0 15)} assume !(0 == ~cond); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,211 INFO L290 TraceCheckUtils]: 403: Hoare triple {36535#(<= ~counter~0 15)} assume true; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,211 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {36535#(<= ~counter~0 15)} {36535#(<= ~counter~0 15)} #59#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,212 INFO L272 TraceCheckUtils]: 405: Hoare triple {36535#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,212 INFO L290 TraceCheckUtils]: 406: Hoare triple {36535#(<= ~counter~0 15)} ~cond := #in~cond; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,212 INFO L290 TraceCheckUtils]: 407: Hoare triple {36535#(<= ~counter~0 15)} assume !(0 == ~cond); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,212 INFO L290 TraceCheckUtils]: 408: Hoare triple {36535#(<= ~counter~0 15)} assume true; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,213 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {36535#(<= ~counter~0 15)} {36535#(<= ~counter~0 15)} #61#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,213 INFO L272 TraceCheckUtils]: 410: Hoare triple {36535#(<= ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,214 INFO L290 TraceCheckUtils]: 411: Hoare triple {36535#(<= ~counter~0 15)} ~cond := #in~cond; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,214 INFO L290 TraceCheckUtils]: 412: Hoare triple {36535#(<= ~counter~0 15)} assume !(0 == ~cond); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,214 INFO L290 TraceCheckUtils]: 413: Hoare triple {36535#(<= ~counter~0 15)} assume true; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,215 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {36535#(<= ~counter~0 15)} {36535#(<= ~counter~0 15)} #63#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,215 INFO L272 TraceCheckUtils]: 415: Hoare triple {36535#(<= ~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)); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,216 INFO L290 TraceCheckUtils]: 416: Hoare triple {36535#(<= ~counter~0 15)} ~cond := #in~cond; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,216 INFO L290 TraceCheckUtils]: 417: Hoare triple {36535#(<= ~counter~0 15)} assume !(0 == ~cond); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,216 INFO L290 TraceCheckUtils]: 418: Hoare triple {36535#(<= ~counter~0 15)} assume true; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,217 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {36535#(<= ~counter~0 15)} {36535#(<= ~counter~0 15)} #65#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,217 INFO L272 TraceCheckUtils]: 420: Hoare triple {36535#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,217 INFO L290 TraceCheckUtils]: 421: Hoare triple {36535#(<= ~counter~0 15)} ~cond := #in~cond; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,218 INFO L290 TraceCheckUtils]: 422: Hoare triple {36535#(<= ~counter~0 15)} assume !(0 == ~cond); {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,218 INFO L290 TraceCheckUtils]: 423: Hoare triple {36535#(<= ~counter~0 15)} assume true; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,218 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {36535#(<= ~counter~0 15)} {36535#(<= ~counter~0 15)} #67#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,219 INFO L290 TraceCheckUtils]: 425: Hoare triple {36535#(<= ~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; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:47,220 INFO L290 TraceCheckUtils]: 426: Hoare triple {36535#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,220 INFO L290 TraceCheckUtils]: 427: Hoare triple {36620#(<= ~counter~0 16)} assume !!(#t~post5 < 50);havoc #t~post5; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,221 INFO L272 TraceCheckUtils]: 428: Hoare triple {36620#(<= ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,221 INFO L290 TraceCheckUtils]: 429: Hoare triple {36620#(<= ~counter~0 16)} ~cond := #in~cond; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,221 INFO L290 TraceCheckUtils]: 430: Hoare triple {36620#(<= ~counter~0 16)} assume !(0 == ~cond); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,221 INFO L290 TraceCheckUtils]: 431: Hoare triple {36620#(<= ~counter~0 16)} assume true; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,222 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {36620#(<= ~counter~0 16)} {36620#(<= ~counter~0 16)} #59#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,222 INFO L272 TraceCheckUtils]: 433: Hoare triple {36620#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,223 INFO L290 TraceCheckUtils]: 434: Hoare triple {36620#(<= ~counter~0 16)} ~cond := #in~cond; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,223 INFO L290 TraceCheckUtils]: 435: Hoare triple {36620#(<= ~counter~0 16)} assume !(0 == ~cond); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,223 INFO L290 TraceCheckUtils]: 436: Hoare triple {36620#(<= ~counter~0 16)} assume true; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,224 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {36620#(<= ~counter~0 16)} {36620#(<= ~counter~0 16)} #61#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,224 INFO L272 TraceCheckUtils]: 438: Hoare triple {36620#(<= ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,225 INFO L290 TraceCheckUtils]: 439: Hoare triple {36620#(<= ~counter~0 16)} ~cond := #in~cond; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,225 INFO L290 TraceCheckUtils]: 440: Hoare triple {36620#(<= ~counter~0 16)} assume !(0 == ~cond); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,225 INFO L290 TraceCheckUtils]: 441: Hoare triple {36620#(<= ~counter~0 16)} assume true; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,226 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {36620#(<= ~counter~0 16)} {36620#(<= ~counter~0 16)} #63#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,226 INFO L272 TraceCheckUtils]: 443: Hoare triple {36620#(<= ~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)); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,227 INFO L290 TraceCheckUtils]: 444: Hoare triple {36620#(<= ~counter~0 16)} ~cond := #in~cond; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,227 INFO L290 TraceCheckUtils]: 445: Hoare triple {36620#(<= ~counter~0 16)} assume !(0 == ~cond); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,227 INFO L290 TraceCheckUtils]: 446: Hoare triple {36620#(<= ~counter~0 16)} assume true; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,228 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {36620#(<= ~counter~0 16)} {36620#(<= ~counter~0 16)} #65#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,228 INFO L272 TraceCheckUtils]: 448: Hoare triple {36620#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,229 INFO L290 TraceCheckUtils]: 449: Hoare triple {36620#(<= ~counter~0 16)} ~cond := #in~cond; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,229 INFO L290 TraceCheckUtils]: 450: Hoare triple {36620#(<= ~counter~0 16)} assume !(0 == ~cond); {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,229 INFO L290 TraceCheckUtils]: 451: Hoare triple {36620#(<= ~counter~0 16)} assume true; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,230 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {36620#(<= ~counter~0 16)} {36620#(<= ~counter~0 16)} #67#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,230 INFO L290 TraceCheckUtils]: 453: Hoare triple {36620#(<= ~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; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:47,231 INFO L290 TraceCheckUtils]: 454: Hoare triple {36620#(<= ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,231 INFO L290 TraceCheckUtils]: 455: Hoare triple {36705#(<= ~counter~0 17)} assume !!(#t~post5 < 50);havoc #t~post5; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,232 INFO L272 TraceCheckUtils]: 456: Hoare triple {36705#(<= ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,232 INFO L290 TraceCheckUtils]: 457: Hoare triple {36705#(<= ~counter~0 17)} ~cond := #in~cond; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,233 INFO L290 TraceCheckUtils]: 458: Hoare triple {36705#(<= ~counter~0 17)} assume !(0 == ~cond); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,233 INFO L290 TraceCheckUtils]: 459: Hoare triple {36705#(<= ~counter~0 17)} assume true; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,233 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {36705#(<= ~counter~0 17)} {36705#(<= ~counter~0 17)} #59#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,234 INFO L272 TraceCheckUtils]: 461: Hoare triple {36705#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,234 INFO L290 TraceCheckUtils]: 462: Hoare triple {36705#(<= ~counter~0 17)} ~cond := #in~cond; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,234 INFO L290 TraceCheckUtils]: 463: Hoare triple {36705#(<= ~counter~0 17)} assume !(0 == ~cond); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,235 INFO L290 TraceCheckUtils]: 464: Hoare triple {36705#(<= ~counter~0 17)} assume true; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,235 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {36705#(<= ~counter~0 17)} {36705#(<= ~counter~0 17)} #61#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,236 INFO L272 TraceCheckUtils]: 466: Hoare triple {36705#(<= ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,236 INFO L290 TraceCheckUtils]: 467: Hoare triple {36705#(<= ~counter~0 17)} ~cond := #in~cond; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,236 INFO L290 TraceCheckUtils]: 468: Hoare triple {36705#(<= ~counter~0 17)} assume !(0 == ~cond); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,237 INFO L290 TraceCheckUtils]: 469: Hoare triple {36705#(<= ~counter~0 17)} assume true; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,237 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {36705#(<= ~counter~0 17)} {36705#(<= ~counter~0 17)} #63#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,238 INFO L272 TraceCheckUtils]: 471: Hoare triple {36705#(<= ~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)); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,238 INFO L290 TraceCheckUtils]: 472: Hoare triple {36705#(<= ~counter~0 17)} ~cond := #in~cond; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,238 INFO L290 TraceCheckUtils]: 473: Hoare triple {36705#(<= ~counter~0 17)} assume !(0 == ~cond); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,238 INFO L290 TraceCheckUtils]: 474: Hoare triple {36705#(<= ~counter~0 17)} assume true; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,239 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {36705#(<= ~counter~0 17)} {36705#(<= ~counter~0 17)} #65#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,239 INFO L272 TraceCheckUtils]: 476: Hoare triple {36705#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,240 INFO L290 TraceCheckUtils]: 477: Hoare triple {36705#(<= ~counter~0 17)} ~cond := #in~cond; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,240 INFO L290 TraceCheckUtils]: 478: Hoare triple {36705#(<= ~counter~0 17)} assume !(0 == ~cond); {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,240 INFO L290 TraceCheckUtils]: 479: Hoare triple {36705#(<= ~counter~0 17)} assume true; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,241 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {36705#(<= ~counter~0 17)} {36705#(<= ~counter~0 17)} #67#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,241 INFO L290 TraceCheckUtils]: 481: Hoare triple {36705#(<= ~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; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:47,242 INFO L290 TraceCheckUtils]: 482: Hoare triple {36705#(<= ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,242 INFO L290 TraceCheckUtils]: 483: Hoare triple {36790#(<= ~counter~0 18)} assume !!(#t~post5 < 50);havoc #t~post5; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,243 INFO L272 TraceCheckUtils]: 484: Hoare triple {36790#(<= ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,243 INFO L290 TraceCheckUtils]: 485: Hoare triple {36790#(<= ~counter~0 18)} ~cond := #in~cond; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,243 INFO L290 TraceCheckUtils]: 486: Hoare triple {36790#(<= ~counter~0 18)} assume !(0 == ~cond); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,244 INFO L290 TraceCheckUtils]: 487: Hoare triple {36790#(<= ~counter~0 18)} assume true; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,244 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {36790#(<= ~counter~0 18)} {36790#(<= ~counter~0 18)} #59#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,244 INFO L272 TraceCheckUtils]: 489: Hoare triple {36790#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,245 INFO L290 TraceCheckUtils]: 490: Hoare triple {36790#(<= ~counter~0 18)} ~cond := #in~cond; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,245 INFO L290 TraceCheckUtils]: 491: Hoare triple {36790#(<= ~counter~0 18)} assume !(0 == ~cond); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,245 INFO L290 TraceCheckUtils]: 492: Hoare triple {36790#(<= ~counter~0 18)} assume true; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,246 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {36790#(<= ~counter~0 18)} {36790#(<= ~counter~0 18)} #61#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,246 INFO L272 TraceCheckUtils]: 494: Hoare triple {36790#(<= ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,246 INFO L290 TraceCheckUtils]: 495: Hoare triple {36790#(<= ~counter~0 18)} ~cond := #in~cond; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,247 INFO L290 TraceCheckUtils]: 496: Hoare triple {36790#(<= ~counter~0 18)} assume !(0 == ~cond); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,247 INFO L290 TraceCheckUtils]: 497: Hoare triple {36790#(<= ~counter~0 18)} assume true; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,247 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {36790#(<= ~counter~0 18)} {36790#(<= ~counter~0 18)} #63#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,248 INFO L272 TraceCheckUtils]: 499: Hoare triple {36790#(<= ~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)); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,248 INFO L290 TraceCheckUtils]: 500: Hoare triple {36790#(<= ~counter~0 18)} ~cond := #in~cond; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,248 INFO L290 TraceCheckUtils]: 501: Hoare triple {36790#(<= ~counter~0 18)} assume !(0 == ~cond); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,248 INFO L290 TraceCheckUtils]: 502: Hoare triple {36790#(<= ~counter~0 18)} assume true; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,249 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {36790#(<= ~counter~0 18)} {36790#(<= ~counter~0 18)} #65#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,249 INFO L272 TraceCheckUtils]: 504: Hoare triple {36790#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,250 INFO L290 TraceCheckUtils]: 505: Hoare triple {36790#(<= ~counter~0 18)} ~cond := #in~cond; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,250 INFO L290 TraceCheckUtils]: 506: Hoare triple {36790#(<= ~counter~0 18)} assume !(0 == ~cond); {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,250 INFO L290 TraceCheckUtils]: 507: Hoare triple {36790#(<= ~counter~0 18)} assume true; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,251 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {36790#(<= ~counter~0 18)} {36790#(<= ~counter~0 18)} #67#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,251 INFO L290 TraceCheckUtils]: 509: Hoare triple {36790#(<= ~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; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:47,252 INFO L290 TraceCheckUtils]: 510: Hoare triple {36790#(<= ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,252 INFO L290 TraceCheckUtils]: 511: Hoare triple {36875#(<= ~counter~0 19)} assume !!(#t~post5 < 50);havoc #t~post5; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,253 INFO L272 TraceCheckUtils]: 512: Hoare triple {36875#(<= ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,253 INFO L290 TraceCheckUtils]: 513: Hoare triple {36875#(<= ~counter~0 19)} ~cond := #in~cond; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,253 INFO L290 TraceCheckUtils]: 514: Hoare triple {36875#(<= ~counter~0 19)} assume !(0 == ~cond); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,253 INFO L290 TraceCheckUtils]: 515: Hoare triple {36875#(<= ~counter~0 19)} assume true; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,254 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {36875#(<= ~counter~0 19)} {36875#(<= ~counter~0 19)} #59#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,254 INFO L272 TraceCheckUtils]: 517: Hoare triple {36875#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,255 INFO L290 TraceCheckUtils]: 518: Hoare triple {36875#(<= ~counter~0 19)} ~cond := #in~cond; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,255 INFO L290 TraceCheckUtils]: 519: Hoare triple {36875#(<= ~counter~0 19)} assume !(0 == ~cond); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,255 INFO L290 TraceCheckUtils]: 520: Hoare triple {36875#(<= ~counter~0 19)} assume true; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,255 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {36875#(<= ~counter~0 19)} {36875#(<= ~counter~0 19)} #61#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,256 INFO L272 TraceCheckUtils]: 522: Hoare triple {36875#(<= ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,256 INFO L290 TraceCheckUtils]: 523: Hoare triple {36875#(<= ~counter~0 19)} ~cond := #in~cond; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,256 INFO L290 TraceCheckUtils]: 524: Hoare triple {36875#(<= ~counter~0 19)} assume !(0 == ~cond); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,257 INFO L290 TraceCheckUtils]: 525: Hoare triple {36875#(<= ~counter~0 19)} assume true; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,257 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {36875#(<= ~counter~0 19)} {36875#(<= ~counter~0 19)} #63#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,258 INFO L272 TraceCheckUtils]: 527: Hoare triple {36875#(<= ~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)); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,258 INFO L290 TraceCheckUtils]: 528: Hoare triple {36875#(<= ~counter~0 19)} ~cond := #in~cond; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,258 INFO L290 TraceCheckUtils]: 529: Hoare triple {36875#(<= ~counter~0 19)} assume !(0 == ~cond); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,258 INFO L290 TraceCheckUtils]: 530: Hoare triple {36875#(<= ~counter~0 19)} assume true; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,259 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {36875#(<= ~counter~0 19)} {36875#(<= ~counter~0 19)} #65#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,259 INFO L272 TraceCheckUtils]: 532: Hoare triple {36875#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,260 INFO L290 TraceCheckUtils]: 533: Hoare triple {36875#(<= ~counter~0 19)} ~cond := #in~cond; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,260 INFO L290 TraceCheckUtils]: 534: Hoare triple {36875#(<= ~counter~0 19)} assume !(0 == ~cond); {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,260 INFO L290 TraceCheckUtils]: 535: Hoare triple {36875#(<= ~counter~0 19)} assume true; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,260 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {36875#(<= ~counter~0 19)} {36875#(<= ~counter~0 19)} #67#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,261 INFO L290 TraceCheckUtils]: 537: Hoare triple {36875#(<= ~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; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:47,262 INFO L290 TraceCheckUtils]: 538: Hoare triple {36875#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,262 INFO L290 TraceCheckUtils]: 539: Hoare triple {36960#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,262 INFO L272 TraceCheckUtils]: 540: Hoare triple {36960#(<= ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,263 INFO L290 TraceCheckUtils]: 541: Hoare triple {36960#(<= ~counter~0 20)} ~cond := #in~cond; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,263 INFO L290 TraceCheckUtils]: 542: Hoare triple {36960#(<= ~counter~0 20)} assume !(0 == ~cond); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,263 INFO L290 TraceCheckUtils]: 543: Hoare triple {36960#(<= ~counter~0 20)} assume true; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,264 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {36960#(<= ~counter~0 20)} {36960#(<= ~counter~0 20)} #59#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,264 INFO L272 TraceCheckUtils]: 545: Hoare triple {36960#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,264 INFO L290 TraceCheckUtils]: 546: Hoare triple {36960#(<= ~counter~0 20)} ~cond := #in~cond; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,265 INFO L290 TraceCheckUtils]: 547: Hoare triple {36960#(<= ~counter~0 20)} assume !(0 == ~cond); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,265 INFO L290 TraceCheckUtils]: 548: Hoare triple {36960#(<= ~counter~0 20)} assume true; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,265 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {36960#(<= ~counter~0 20)} {36960#(<= ~counter~0 20)} #61#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,267 INFO L272 TraceCheckUtils]: 550: Hoare triple {36960#(<= ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,268 INFO L290 TraceCheckUtils]: 551: Hoare triple {36960#(<= ~counter~0 20)} ~cond := #in~cond; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,268 INFO L290 TraceCheckUtils]: 552: Hoare triple {36960#(<= ~counter~0 20)} assume !(0 == ~cond); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,269 INFO L290 TraceCheckUtils]: 553: Hoare triple {36960#(<= ~counter~0 20)} assume true; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,269 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {36960#(<= ~counter~0 20)} {36960#(<= ~counter~0 20)} #63#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,270 INFO L272 TraceCheckUtils]: 555: Hoare triple {36960#(<= ~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)); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,270 INFO L290 TraceCheckUtils]: 556: Hoare triple {36960#(<= ~counter~0 20)} ~cond := #in~cond; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,271 INFO L290 TraceCheckUtils]: 557: Hoare triple {36960#(<= ~counter~0 20)} assume !(0 == ~cond); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,271 INFO L290 TraceCheckUtils]: 558: Hoare triple {36960#(<= ~counter~0 20)} assume true; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,272 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {36960#(<= ~counter~0 20)} {36960#(<= ~counter~0 20)} #65#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,273 INFO L272 TraceCheckUtils]: 560: Hoare triple {36960#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,273 INFO L290 TraceCheckUtils]: 561: Hoare triple {36960#(<= ~counter~0 20)} ~cond := #in~cond; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,273 INFO L290 TraceCheckUtils]: 562: Hoare triple {36960#(<= ~counter~0 20)} assume !(0 == ~cond); {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,274 INFO L290 TraceCheckUtils]: 563: Hoare triple {36960#(<= ~counter~0 20)} assume true; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,274 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {36960#(<= ~counter~0 20)} {36960#(<= ~counter~0 20)} #67#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,275 INFO L290 TraceCheckUtils]: 565: Hoare triple {36960#(<= ~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; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:47,276 INFO L290 TraceCheckUtils]: 566: Hoare triple {36960#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,276 INFO L290 TraceCheckUtils]: 567: Hoare triple {37045#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,277 INFO L272 TraceCheckUtils]: 568: Hoare triple {37045#(<= ~counter~0 21)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,277 INFO L290 TraceCheckUtils]: 569: Hoare triple {37045#(<= ~counter~0 21)} ~cond := #in~cond; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,278 INFO L290 TraceCheckUtils]: 570: Hoare triple {37045#(<= ~counter~0 21)} assume !(0 == ~cond); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,278 INFO L290 TraceCheckUtils]: 571: Hoare triple {37045#(<= ~counter~0 21)} assume true; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,278 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {37045#(<= ~counter~0 21)} {37045#(<= ~counter~0 21)} #59#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,279 INFO L272 TraceCheckUtils]: 573: Hoare triple {37045#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,279 INFO L290 TraceCheckUtils]: 574: Hoare triple {37045#(<= ~counter~0 21)} ~cond := #in~cond; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,280 INFO L290 TraceCheckUtils]: 575: Hoare triple {37045#(<= ~counter~0 21)} assume !(0 == ~cond); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,280 INFO L290 TraceCheckUtils]: 576: Hoare triple {37045#(<= ~counter~0 21)} assume true; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,281 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {37045#(<= ~counter~0 21)} {37045#(<= ~counter~0 21)} #61#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,281 INFO L272 TraceCheckUtils]: 578: Hoare triple {37045#(<= ~counter~0 21)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,282 INFO L290 TraceCheckUtils]: 579: Hoare triple {37045#(<= ~counter~0 21)} ~cond := #in~cond; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,282 INFO L290 TraceCheckUtils]: 580: Hoare triple {37045#(<= ~counter~0 21)} assume !(0 == ~cond); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,282 INFO L290 TraceCheckUtils]: 581: Hoare triple {37045#(<= ~counter~0 21)} assume true; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,283 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {37045#(<= ~counter~0 21)} {37045#(<= ~counter~0 21)} #63#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,283 INFO L272 TraceCheckUtils]: 583: Hoare triple {37045#(<= ~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)); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,283 INFO L290 TraceCheckUtils]: 584: Hoare triple {37045#(<= ~counter~0 21)} ~cond := #in~cond; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,284 INFO L290 TraceCheckUtils]: 585: Hoare triple {37045#(<= ~counter~0 21)} assume !(0 == ~cond); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,284 INFO L290 TraceCheckUtils]: 586: Hoare triple {37045#(<= ~counter~0 21)} assume true; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,284 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {37045#(<= ~counter~0 21)} {37045#(<= ~counter~0 21)} #65#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,285 INFO L272 TraceCheckUtils]: 588: Hoare triple {37045#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,285 INFO L290 TraceCheckUtils]: 589: Hoare triple {37045#(<= ~counter~0 21)} ~cond := #in~cond; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,285 INFO L290 TraceCheckUtils]: 590: Hoare triple {37045#(<= ~counter~0 21)} assume !(0 == ~cond); {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,285 INFO L290 TraceCheckUtils]: 591: Hoare triple {37045#(<= ~counter~0 21)} assume true; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,286 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {37045#(<= ~counter~0 21)} {37045#(<= ~counter~0 21)} #67#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,286 INFO L290 TraceCheckUtils]: 593: Hoare triple {37045#(<= ~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; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:47,287 INFO L290 TraceCheckUtils]: 594: Hoare triple {37045#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,287 INFO L290 TraceCheckUtils]: 595: Hoare triple {37130#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,288 INFO L272 TraceCheckUtils]: 596: Hoare triple {37130#(<= ~counter~0 22)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,288 INFO L290 TraceCheckUtils]: 597: Hoare triple {37130#(<= ~counter~0 22)} ~cond := #in~cond; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,288 INFO L290 TraceCheckUtils]: 598: Hoare triple {37130#(<= ~counter~0 22)} assume !(0 == ~cond); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,289 INFO L290 TraceCheckUtils]: 599: Hoare triple {37130#(<= ~counter~0 22)} assume true; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,289 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {37130#(<= ~counter~0 22)} {37130#(<= ~counter~0 22)} #59#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,290 INFO L272 TraceCheckUtils]: 601: Hoare triple {37130#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,290 INFO L290 TraceCheckUtils]: 602: Hoare triple {37130#(<= ~counter~0 22)} ~cond := #in~cond; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,290 INFO L290 TraceCheckUtils]: 603: Hoare triple {37130#(<= ~counter~0 22)} assume !(0 == ~cond); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,290 INFO L290 TraceCheckUtils]: 604: Hoare triple {37130#(<= ~counter~0 22)} assume true; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,291 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {37130#(<= ~counter~0 22)} {37130#(<= ~counter~0 22)} #61#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,291 INFO L272 TraceCheckUtils]: 606: Hoare triple {37130#(<= ~counter~0 22)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,292 INFO L290 TraceCheckUtils]: 607: Hoare triple {37130#(<= ~counter~0 22)} ~cond := #in~cond; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,292 INFO L290 TraceCheckUtils]: 608: Hoare triple {37130#(<= ~counter~0 22)} assume !(0 == ~cond); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,292 INFO L290 TraceCheckUtils]: 609: Hoare triple {37130#(<= ~counter~0 22)} assume true; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,293 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {37130#(<= ~counter~0 22)} {37130#(<= ~counter~0 22)} #63#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,293 INFO L272 TraceCheckUtils]: 611: Hoare triple {37130#(<= ~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)); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,293 INFO L290 TraceCheckUtils]: 612: Hoare triple {37130#(<= ~counter~0 22)} ~cond := #in~cond; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,294 INFO L290 TraceCheckUtils]: 613: Hoare triple {37130#(<= ~counter~0 22)} assume !(0 == ~cond); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,294 INFO L290 TraceCheckUtils]: 614: Hoare triple {37130#(<= ~counter~0 22)} assume true; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,294 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {37130#(<= ~counter~0 22)} {37130#(<= ~counter~0 22)} #65#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,295 INFO L272 TraceCheckUtils]: 616: Hoare triple {37130#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,295 INFO L290 TraceCheckUtils]: 617: Hoare triple {37130#(<= ~counter~0 22)} ~cond := #in~cond; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,295 INFO L290 TraceCheckUtils]: 618: Hoare triple {37130#(<= ~counter~0 22)} assume !(0 == ~cond); {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,295 INFO L290 TraceCheckUtils]: 619: Hoare triple {37130#(<= ~counter~0 22)} assume true; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,296 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {37130#(<= ~counter~0 22)} {37130#(<= ~counter~0 22)} #67#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,296 INFO L290 TraceCheckUtils]: 621: Hoare triple {37130#(<= ~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; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:47,297 INFO L290 TraceCheckUtils]: 622: Hoare triple {37130#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,297 INFO L290 TraceCheckUtils]: 623: Hoare triple {37215#(<= ~counter~0 23)} assume !!(#t~post5 < 50);havoc #t~post5; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,298 INFO L272 TraceCheckUtils]: 624: Hoare triple {37215#(<= ~counter~0 23)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,298 INFO L290 TraceCheckUtils]: 625: Hoare triple {37215#(<= ~counter~0 23)} ~cond := #in~cond; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,298 INFO L290 TraceCheckUtils]: 626: Hoare triple {37215#(<= ~counter~0 23)} assume !(0 == ~cond); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,299 INFO L290 TraceCheckUtils]: 627: Hoare triple {37215#(<= ~counter~0 23)} assume true; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,299 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {37215#(<= ~counter~0 23)} {37215#(<= ~counter~0 23)} #59#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,300 INFO L272 TraceCheckUtils]: 629: Hoare triple {37215#(<= ~counter~0 23)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,300 INFO L290 TraceCheckUtils]: 630: Hoare triple {37215#(<= ~counter~0 23)} ~cond := #in~cond; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,300 INFO L290 TraceCheckUtils]: 631: Hoare triple {37215#(<= ~counter~0 23)} assume !(0 == ~cond); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,300 INFO L290 TraceCheckUtils]: 632: Hoare triple {37215#(<= ~counter~0 23)} assume true; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,301 INFO L284 TraceCheckUtils]: 633: Hoare quadruple {37215#(<= ~counter~0 23)} {37215#(<= ~counter~0 23)} #61#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,301 INFO L272 TraceCheckUtils]: 634: Hoare triple {37215#(<= ~counter~0 23)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,301 INFO L290 TraceCheckUtils]: 635: Hoare triple {37215#(<= ~counter~0 23)} ~cond := #in~cond; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,302 INFO L290 TraceCheckUtils]: 636: Hoare triple {37215#(<= ~counter~0 23)} assume !(0 == ~cond); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,302 INFO L290 TraceCheckUtils]: 637: Hoare triple {37215#(<= ~counter~0 23)} assume true; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,302 INFO L284 TraceCheckUtils]: 638: Hoare quadruple {37215#(<= ~counter~0 23)} {37215#(<= ~counter~0 23)} #63#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,303 INFO L272 TraceCheckUtils]: 639: Hoare triple {37215#(<= ~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)); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,303 INFO L290 TraceCheckUtils]: 640: Hoare triple {37215#(<= ~counter~0 23)} ~cond := #in~cond; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,303 INFO L290 TraceCheckUtils]: 641: Hoare triple {37215#(<= ~counter~0 23)} assume !(0 == ~cond); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,304 INFO L290 TraceCheckUtils]: 642: Hoare triple {37215#(<= ~counter~0 23)} assume true; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,304 INFO L284 TraceCheckUtils]: 643: Hoare quadruple {37215#(<= ~counter~0 23)} {37215#(<= ~counter~0 23)} #65#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,305 INFO L272 TraceCheckUtils]: 644: Hoare triple {37215#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,305 INFO L290 TraceCheckUtils]: 645: Hoare triple {37215#(<= ~counter~0 23)} ~cond := #in~cond; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,305 INFO L290 TraceCheckUtils]: 646: Hoare triple {37215#(<= ~counter~0 23)} assume !(0 == ~cond); {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,305 INFO L290 TraceCheckUtils]: 647: Hoare triple {37215#(<= ~counter~0 23)} assume true; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,306 INFO L284 TraceCheckUtils]: 648: Hoare quadruple {37215#(<= ~counter~0 23)} {37215#(<= ~counter~0 23)} #67#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,306 INFO L290 TraceCheckUtils]: 649: Hoare triple {37215#(<= ~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; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:47,307 INFO L290 TraceCheckUtils]: 650: Hoare triple {37215#(<= ~counter~0 23)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,307 INFO L290 TraceCheckUtils]: 651: Hoare triple {37300#(<= ~counter~0 24)} assume !!(#t~post5 < 50);havoc #t~post5; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,308 INFO L272 TraceCheckUtils]: 652: Hoare triple {37300#(<= ~counter~0 24)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,308 INFO L290 TraceCheckUtils]: 653: Hoare triple {37300#(<= ~counter~0 24)} ~cond := #in~cond; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,308 INFO L290 TraceCheckUtils]: 654: Hoare triple {37300#(<= ~counter~0 24)} assume !(0 == ~cond); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,309 INFO L290 TraceCheckUtils]: 655: Hoare triple {37300#(<= ~counter~0 24)} assume true; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,309 INFO L284 TraceCheckUtils]: 656: Hoare quadruple {37300#(<= ~counter~0 24)} {37300#(<= ~counter~0 24)} #59#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,309 INFO L272 TraceCheckUtils]: 657: Hoare triple {37300#(<= ~counter~0 24)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,310 INFO L290 TraceCheckUtils]: 658: Hoare triple {37300#(<= ~counter~0 24)} ~cond := #in~cond; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,310 INFO L290 TraceCheckUtils]: 659: Hoare triple {37300#(<= ~counter~0 24)} assume !(0 == ~cond); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,310 INFO L290 TraceCheckUtils]: 660: Hoare triple {37300#(<= ~counter~0 24)} assume true; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,311 INFO L284 TraceCheckUtils]: 661: Hoare quadruple {37300#(<= ~counter~0 24)} {37300#(<= ~counter~0 24)} #61#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,311 INFO L272 TraceCheckUtils]: 662: Hoare triple {37300#(<= ~counter~0 24)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,311 INFO L290 TraceCheckUtils]: 663: Hoare triple {37300#(<= ~counter~0 24)} ~cond := #in~cond; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,312 INFO L290 TraceCheckUtils]: 664: Hoare triple {37300#(<= ~counter~0 24)} assume !(0 == ~cond); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,312 INFO L290 TraceCheckUtils]: 665: Hoare triple {37300#(<= ~counter~0 24)} assume true; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,312 INFO L284 TraceCheckUtils]: 666: Hoare quadruple {37300#(<= ~counter~0 24)} {37300#(<= ~counter~0 24)} #63#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,313 INFO L272 TraceCheckUtils]: 667: Hoare triple {37300#(<= ~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)); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,313 INFO L290 TraceCheckUtils]: 668: Hoare triple {37300#(<= ~counter~0 24)} ~cond := #in~cond; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,313 INFO L290 TraceCheckUtils]: 669: Hoare triple {37300#(<= ~counter~0 24)} assume !(0 == ~cond); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,314 INFO L290 TraceCheckUtils]: 670: Hoare triple {37300#(<= ~counter~0 24)} assume true; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,314 INFO L284 TraceCheckUtils]: 671: Hoare quadruple {37300#(<= ~counter~0 24)} {37300#(<= ~counter~0 24)} #65#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,315 INFO L272 TraceCheckUtils]: 672: Hoare triple {37300#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,315 INFO L290 TraceCheckUtils]: 673: Hoare triple {37300#(<= ~counter~0 24)} ~cond := #in~cond; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,315 INFO L290 TraceCheckUtils]: 674: Hoare triple {37300#(<= ~counter~0 24)} assume !(0 == ~cond); {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,315 INFO L290 TraceCheckUtils]: 675: Hoare triple {37300#(<= ~counter~0 24)} assume true; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,316 INFO L284 TraceCheckUtils]: 676: Hoare quadruple {37300#(<= ~counter~0 24)} {37300#(<= ~counter~0 24)} #67#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,316 INFO L290 TraceCheckUtils]: 677: Hoare triple {37300#(<= ~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; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:47,317 INFO L290 TraceCheckUtils]: 678: Hoare triple {37300#(<= ~counter~0 24)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,317 INFO L290 TraceCheckUtils]: 679: Hoare triple {37385#(<= ~counter~0 25)} assume !!(#t~post5 < 50);havoc #t~post5; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,318 INFO L272 TraceCheckUtils]: 680: Hoare triple {37385#(<= ~counter~0 25)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,318 INFO L290 TraceCheckUtils]: 681: Hoare triple {37385#(<= ~counter~0 25)} ~cond := #in~cond; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,318 INFO L290 TraceCheckUtils]: 682: Hoare triple {37385#(<= ~counter~0 25)} assume !(0 == ~cond); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,319 INFO L290 TraceCheckUtils]: 683: Hoare triple {37385#(<= ~counter~0 25)} assume true; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,319 INFO L284 TraceCheckUtils]: 684: Hoare quadruple {37385#(<= ~counter~0 25)} {37385#(<= ~counter~0 25)} #59#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,319 INFO L272 TraceCheckUtils]: 685: Hoare triple {37385#(<= ~counter~0 25)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,320 INFO L290 TraceCheckUtils]: 686: Hoare triple {37385#(<= ~counter~0 25)} ~cond := #in~cond; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,320 INFO L290 TraceCheckUtils]: 687: Hoare triple {37385#(<= ~counter~0 25)} assume !(0 == ~cond); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,320 INFO L290 TraceCheckUtils]: 688: Hoare triple {37385#(<= ~counter~0 25)} assume true; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,321 INFO L284 TraceCheckUtils]: 689: Hoare quadruple {37385#(<= ~counter~0 25)} {37385#(<= ~counter~0 25)} #61#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,321 INFO L272 TraceCheckUtils]: 690: Hoare triple {37385#(<= ~counter~0 25)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,321 INFO L290 TraceCheckUtils]: 691: Hoare triple {37385#(<= ~counter~0 25)} ~cond := #in~cond; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,322 INFO L290 TraceCheckUtils]: 692: Hoare triple {37385#(<= ~counter~0 25)} assume !(0 == ~cond); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,322 INFO L290 TraceCheckUtils]: 693: Hoare triple {37385#(<= ~counter~0 25)} assume true; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,322 INFO L284 TraceCheckUtils]: 694: Hoare quadruple {37385#(<= ~counter~0 25)} {37385#(<= ~counter~0 25)} #63#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,323 INFO L272 TraceCheckUtils]: 695: Hoare triple {37385#(<= ~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)); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,323 INFO L290 TraceCheckUtils]: 696: Hoare triple {37385#(<= ~counter~0 25)} ~cond := #in~cond; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,323 INFO L290 TraceCheckUtils]: 697: Hoare triple {37385#(<= ~counter~0 25)} assume !(0 == ~cond); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,324 INFO L290 TraceCheckUtils]: 698: Hoare triple {37385#(<= ~counter~0 25)} assume true; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,324 INFO L284 TraceCheckUtils]: 699: Hoare quadruple {37385#(<= ~counter~0 25)} {37385#(<= ~counter~0 25)} #65#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,324 INFO L272 TraceCheckUtils]: 700: Hoare triple {37385#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,325 INFO L290 TraceCheckUtils]: 701: Hoare triple {37385#(<= ~counter~0 25)} ~cond := #in~cond; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,325 INFO L290 TraceCheckUtils]: 702: Hoare triple {37385#(<= ~counter~0 25)} assume !(0 == ~cond); {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,325 INFO L290 TraceCheckUtils]: 703: Hoare triple {37385#(<= ~counter~0 25)} assume true; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,326 INFO L284 TraceCheckUtils]: 704: Hoare quadruple {37385#(<= ~counter~0 25)} {37385#(<= ~counter~0 25)} #67#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,326 INFO L290 TraceCheckUtils]: 705: Hoare triple {37385#(<= ~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; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:47,327 INFO L290 TraceCheckUtils]: 706: Hoare triple {37385#(<= ~counter~0 25)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,327 INFO L290 TraceCheckUtils]: 707: Hoare triple {37470#(<= ~counter~0 26)} assume !!(#t~post5 < 50);havoc #t~post5; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,328 INFO L272 TraceCheckUtils]: 708: Hoare triple {37470#(<= ~counter~0 26)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,328 INFO L290 TraceCheckUtils]: 709: Hoare triple {37470#(<= ~counter~0 26)} ~cond := #in~cond; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,328 INFO L290 TraceCheckUtils]: 710: Hoare triple {37470#(<= ~counter~0 26)} assume !(0 == ~cond); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,329 INFO L290 TraceCheckUtils]: 711: Hoare triple {37470#(<= ~counter~0 26)} assume true; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,329 INFO L284 TraceCheckUtils]: 712: Hoare quadruple {37470#(<= ~counter~0 26)} {37470#(<= ~counter~0 26)} #59#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,330 INFO L272 TraceCheckUtils]: 713: Hoare triple {37470#(<= ~counter~0 26)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,330 INFO L290 TraceCheckUtils]: 714: Hoare triple {37470#(<= ~counter~0 26)} ~cond := #in~cond; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,330 INFO L290 TraceCheckUtils]: 715: Hoare triple {37470#(<= ~counter~0 26)} assume !(0 == ~cond); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,330 INFO L290 TraceCheckUtils]: 716: Hoare triple {37470#(<= ~counter~0 26)} assume true; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,331 INFO L284 TraceCheckUtils]: 717: Hoare quadruple {37470#(<= ~counter~0 26)} {37470#(<= ~counter~0 26)} #61#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,331 INFO L272 TraceCheckUtils]: 718: Hoare triple {37470#(<= ~counter~0 26)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,332 INFO L290 TraceCheckUtils]: 719: Hoare triple {37470#(<= ~counter~0 26)} ~cond := #in~cond; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,332 INFO L290 TraceCheckUtils]: 720: Hoare triple {37470#(<= ~counter~0 26)} assume !(0 == ~cond); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,332 INFO L290 TraceCheckUtils]: 721: Hoare triple {37470#(<= ~counter~0 26)} assume true; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,332 INFO L284 TraceCheckUtils]: 722: Hoare quadruple {37470#(<= ~counter~0 26)} {37470#(<= ~counter~0 26)} #63#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,333 INFO L272 TraceCheckUtils]: 723: Hoare triple {37470#(<= ~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)); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,333 INFO L290 TraceCheckUtils]: 724: Hoare triple {37470#(<= ~counter~0 26)} ~cond := #in~cond; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,333 INFO L290 TraceCheckUtils]: 725: Hoare triple {37470#(<= ~counter~0 26)} assume !(0 == ~cond); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,334 INFO L290 TraceCheckUtils]: 726: Hoare triple {37470#(<= ~counter~0 26)} assume true; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,334 INFO L284 TraceCheckUtils]: 727: Hoare quadruple {37470#(<= ~counter~0 26)} {37470#(<= ~counter~0 26)} #65#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,335 INFO L272 TraceCheckUtils]: 728: Hoare triple {37470#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,335 INFO L290 TraceCheckUtils]: 729: Hoare triple {37470#(<= ~counter~0 26)} ~cond := #in~cond; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,335 INFO L290 TraceCheckUtils]: 730: Hoare triple {37470#(<= ~counter~0 26)} assume !(0 == ~cond); {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,335 INFO L290 TraceCheckUtils]: 731: Hoare triple {37470#(<= ~counter~0 26)} assume true; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,336 INFO L284 TraceCheckUtils]: 732: Hoare quadruple {37470#(<= ~counter~0 26)} {37470#(<= ~counter~0 26)} #67#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,336 INFO L290 TraceCheckUtils]: 733: Hoare triple {37470#(<= ~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; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:47,337 INFO L290 TraceCheckUtils]: 734: Hoare triple {37470#(<= ~counter~0 26)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,337 INFO L290 TraceCheckUtils]: 735: Hoare triple {37555#(<= ~counter~0 27)} assume !!(#t~post5 < 50);havoc #t~post5; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,338 INFO L272 TraceCheckUtils]: 736: Hoare triple {37555#(<= ~counter~0 27)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,338 INFO L290 TraceCheckUtils]: 737: Hoare triple {37555#(<= ~counter~0 27)} ~cond := #in~cond; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,338 INFO L290 TraceCheckUtils]: 738: Hoare triple {37555#(<= ~counter~0 27)} assume !(0 == ~cond); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,339 INFO L290 TraceCheckUtils]: 739: Hoare triple {37555#(<= ~counter~0 27)} assume true; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,339 INFO L284 TraceCheckUtils]: 740: Hoare quadruple {37555#(<= ~counter~0 27)} {37555#(<= ~counter~0 27)} #59#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,340 INFO L272 TraceCheckUtils]: 741: Hoare triple {37555#(<= ~counter~0 27)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,340 INFO L290 TraceCheckUtils]: 742: Hoare triple {37555#(<= ~counter~0 27)} ~cond := #in~cond; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,340 INFO L290 TraceCheckUtils]: 743: Hoare triple {37555#(<= ~counter~0 27)} assume !(0 == ~cond); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,340 INFO L290 TraceCheckUtils]: 744: Hoare triple {37555#(<= ~counter~0 27)} assume true; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,341 INFO L284 TraceCheckUtils]: 745: Hoare quadruple {37555#(<= ~counter~0 27)} {37555#(<= ~counter~0 27)} #61#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,341 INFO L272 TraceCheckUtils]: 746: Hoare triple {37555#(<= ~counter~0 27)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,341 INFO L290 TraceCheckUtils]: 747: Hoare triple {37555#(<= ~counter~0 27)} ~cond := #in~cond; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,342 INFO L290 TraceCheckUtils]: 748: Hoare triple {37555#(<= ~counter~0 27)} assume !(0 == ~cond); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,342 INFO L290 TraceCheckUtils]: 749: Hoare triple {37555#(<= ~counter~0 27)} assume true; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,342 INFO L284 TraceCheckUtils]: 750: Hoare quadruple {37555#(<= ~counter~0 27)} {37555#(<= ~counter~0 27)} #63#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,343 INFO L272 TraceCheckUtils]: 751: Hoare triple {37555#(<= ~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)); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,343 INFO L290 TraceCheckUtils]: 752: Hoare triple {37555#(<= ~counter~0 27)} ~cond := #in~cond; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,343 INFO L290 TraceCheckUtils]: 753: Hoare triple {37555#(<= ~counter~0 27)} assume !(0 == ~cond); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,344 INFO L290 TraceCheckUtils]: 754: Hoare triple {37555#(<= ~counter~0 27)} assume true; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,344 INFO L284 TraceCheckUtils]: 755: Hoare quadruple {37555#(<= ~counter~0 27)} {37555#(<= ~counter~0 27)} #65#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,345 INFO L272 TraceCheckUtils]: 756: Hoare triple {37555#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,345 INFO L290 TraceCheckUtils]: 757: Hoare triple {37555#(<= ~counter~0 27)} ~cond := #in~cond; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,345 INFO L290 TraceCheckUtils]: 758: Hoare triple {37555#(<= ~counter~0 27)} assume !(0 == ~cond); {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,345 INFO L290 TraceCheckUtils]: 759: Hoare triple {37555#(<= ~counter~0 27)} assume true; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,346 INFO L284 TraceCheckUtils]: 760: Hoare quadruple {37555#(<= ~counter~0 27)} {37555#(<= ~counter~0 27)} #67#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,346 INFO L290 TraceCheckUtils]: 761: Hoare triple {37555#(<= ~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; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:47,347 INFO L290 TraceCheckUtils]: 762: Hoare triple {37555#(<= ~counter~0 27)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,347 INFO L290 TraceCheckUtils]: 763: Hoare triple {37640#(<= ~counter~0 28)} assume !!(#t~post5 < 50);havoc #t~post5; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,348 INFO L272 TraceCheckUtils]: 764: Hoare triple {37640#(<= ~counter~0 28)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,348 INFO L290 TraceCheckUtils]: 765: Hoare triple {37640#(<= ~counter~0 28)} ~cond := #in~cond; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,348 INFO L290 TraceCheckUtils]: 766: Hoare triple {37640#(<= ~counter~0 28)} assume !(0 == ~cond); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,349 INFO L290 TraceCheckUtils]: 767: Hoare triple {37640#(<= ~counter~0 28)} assume true; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,349 INFO L284 TraceCheckUtils]: 768: Hoare quadruple {37640#(<= ~counter~0 28)} {37640#(<= ~counter~0 28)} #59#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,350 INFO L272 TraceCheckUtils]: 769: Hoare triple {37640#(<= ~counter~0 28)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,364 INFO L290 TraceCheckUtils]: 770: Hoare triple {37640#(<= ~counter~0 28)} ~cond := #in~cond; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,365 INFO L290 TraceCheckUtils]: 771: Hoare triple {37640#(<= ~counter~0 28)} assume !(0 == ~cond); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,365 INFO L290 TraceCheckUtils]: 772: Hoare triple {37640#(<= ~counter~0 28)} assume true; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,365 INFO L284 TraceCheckUtils]: 773: Hoare quadruple {37640#(<= ~counter~0 28)} {37640#(<= ~counter~0 28)} #61#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,366 INFO L272 TraceCheckUtils]: 774: Hoare triple {37640#(<= ~counter~0 28)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,366 INFO L290 TraceCheckUtils]: 775: Hoare triple {37640#(<= ~counter~0 28)} ~cond := #in~cond; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,366 INFO L290 TraceCheckUtils]: 776: Hoare triple {37640#(<= ~counter~0 28)} assume !(0 == ~cond); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,367 INFO L290 TraceCheckUtils]: 777: Hoare triple {37640#(<= ~counter~0 28)} assume true; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,367 INFO L284 TraceCheckUtils]: 778: Hoare quadruple {37640#(<= ~counter~0 28)} {37640#(<= ~counter~0 28)} #63#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,367 INFO L272 TraceCheckUtils]: 779: Hoare triple {37640#(<= ~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)); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,368 INFO L290 TraceCheckUtils]: 780: Hoare triple {37640#(<= ~counter~0 28)} ~cond := #in~cond; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,368 INFO L290 TraceCheckUtils]: 781: Hoare triple {37640#(<= ~counter~0 28)} assume !(0 == ~cond); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,368 INFO L290 TraceCheckUtils]: 782: Hoare triple {37640#(<= ~counter~0 28)} assume true; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,369 INFO L284 TraceCheckUtils]: 783: Hoare quadruple {37640#(<= ~counter~0 28)} {37640#(<= ~counter~0 28)} #65#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,369 INFO L272 TraceCheckUtils]: 784: Hoare triple {37640#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,369 INFO L290 TraceCheckUtils]: 785: Hoare triple {37640#(<= ~counter~0 28)} ~cond := #in~cond; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,370 INFO L290 TraceCheckUtils]: 786: Hoare triple {37640#(<= ~counter~0 28)} assume !(0 == ~cond); {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,370 INFO L290 TraceCheckUtils]: 787: Hoare triple {37640#(<= ~counter~0 28)} assume true; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,370 INFO L284 TraceCheckUtils]: 788: Hoare quadruple {37640#(<= ~counter~0 28)} {37640#(<= ~counter~0 28)} #67#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,371 INFO L290 TraceCheckUtils]: 789: Hoare triple {37640#(<= ~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; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:47,372 INFO L290 TraceCheckUtils]: 790: Hoare triple {37640#(<= ~counter~0 28)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,372 INFO L290 TraceCheckUtils]: 791: Hoare triple {37725#(<= ~counter~0 29)} assume !!(#t~post5 < 50);havoc #t~post5; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,372 INFO L272 TraceCheckUtils]: 792: Hoare triple {37725#(<= ~counter~0 29)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,373 INFO L290 TraceCheckUtils]: 793: Hoare triple {37725#(<= ~counter~0 29)} ~cond := #in~cond; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,373 INFO L290 TraceCheckUtils]: 794: Hoare triple {37725#(<= ~counter~0 29)} assume !(0 == ~cond); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,373 INFO L290 TraceCheckUtils]: 795: Hoare triple {37725#(<= ~counter~0 29)} assume true; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,373 INFO L284 TraceCheckUtils]: 796: Hoare quadruple {37725#(<= ~counter~0 29)} {37725#(<= ~counter~0 29)} #59#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,374 INFO L272 TraceCheckUtils]: 797: Hoare triple {37725#(<= ~counter~0 29)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,374 INFO L290 TraceCheckUtils]: 798: Hoare triple {37725#(<= ~counter~0 29)} ~cond := #in~cond; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,374 INFO L290 TraceCheckUtils]: 799: Hoare triple {37725#(<= ~counter~0 29)} assume !(0 == ~cond); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,375 INFO L290 TraceCheckUtils]: 800: Hoare triple {37725#(<= ~counter~0 29)} assume true; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,375 INFO L284 TraceCheckUtils]: 801: Hoare quadruple {37725#(<= ~counter~0 29)} {37725#(<= ~counter~0 29)} #61#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,375 INFO L272 TraceCheckUtils]: 802: Hoare triple {37725#(<= ~counter~0 29)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,376 INFO L290 TraceCheckUtils]: 803: Hoare triple {37725#(<= ~counter~0 29)} ~cond := #in~cond; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,376 INFO L290 TraceCheckUtils]: 804: Hoare triple {37725#(<= ~counter~0 29)} assume !(0 == ~cond); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,376 INFO L290 TraceCheckUtils]: 805: Hoare triple {37725#(<= ~counter~0 29)} assume true; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,377 INFO L284 TraceCheckUtils]: 806: Hoare quadruple {37725#(<= ~counter~0 29)} {37725#(<= ~counter~0 29)} #63#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,377 INFO L272 TraceCheckUtils]: 807: Hoare triple {37725#(<= ~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)); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,377 INFO L290 TraceCheckUtils]: 808: Hoare triple {37725#(<= ~counter~0 29)} ~cond := #in~cond; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,378 INFO L290 TraceCheckUtils]: 809: Hoare triple {37725#(<= ~counter~0 29)} assume !(0 == ~cond); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,378 INFO L290 TraceCheckUtils]: 810: Hoare triple {37725#(<= ~counter~0 29)} assume true; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,378 INFO L284 TraceCheckUtils]: 811: Hoare quadruple {37725#(<= ~counter~0 29)} {37725#(<= ~counter~0 29)} #65#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,379 INFO L272 TraceCheckUtils]: 812: Hoare triple {37725#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,379 INFO L290 TraceCheckUtils]: 813: Hoare triple {37725#(<= ~counter~0 29)} ~cond := #in~cond; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,379 INFO L290 TraceCheckUtils]: 814: Hoare triple {37725#(<= ~counter~0 29)} assume !(0 == ~cond); {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,379 INFO L290 TraceCheckUtils]: 815: Hoare triple {37725#(<= ~counter~0 29)} assume true; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,380 INFO L284 TraceCheckUtils]: 816: Hoare quadruple {37725#(<= ~counter~0 29)} {37725#(<= ~counter~0 29)} #67#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,380 INFO L290 TraceCheckUtils]: 817: Hoare triple {37725#(<= ~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; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:47,381 INFO L290 TraceCheckUtils]: 818: Hoare triple {37725#(<= ~counter~0 29)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,381 INFO L290 TraceCheckUtils]: 819: Hoare triple {37810#(<= ~counter~0 30)} assume !!(#t~post5 < 50);havoc #t~post5; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,382 INFO L272 TraceCheckUtils]: 820: Hoare triple {37810#(<= ~counter~0 30)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,382 INFO L290 TraceCheckUtils]: 821: Hoare triple {37810#(<= ~counter~0 30)} ~cond := #in~cond; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,382 INFO L290 TraceCheckUtils]: 822: Hoare triple {37810#(<= ~counter~0 30)} assume !(0 == ~cond); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,383 INFO L290 TraceCheckUtils]: 823: Hoare triple {37810#(<= ~counter~0 30)} assume true; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,383 INFO L284 TraceCheckUtils]: 824: Hoare quadruple {37810#(<= ~counter~0 30)} {37810#(<= ~counter~0 30)} #59#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,383 INFO L272 TraceCheckUtils]: 825: Hoare triple {37810#(<= ~counter~0 30)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,384 INFO L290 TraceCheckUtils]: 826: Hoare triple {37810#(<= ~counter~0 30)} ~cond := #in~cond; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,384 INFO L290 TraceCheckUtils]: 827: Hoare triple {37810#(<= ~counter~0 30)} assume !(0 == ~cond); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,384 INFO L290 TraceCheckUtils]: 828: Hoare triple {37810#(<= ~counter~0 30)} assume true; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,385 INFO L284 TraceCheckUtils]: 829: Hoare quadruple {37810#(<= ~counter~0 30)} {37810#(<= ~counter~0 30)} #61#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,385 INFO L272 TraceCheckUtils]: 830: Hoare triple {37810#(<= ~counter~0 30)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,385 INFO L290 TraceCheckUtils]: 831: Hoare triple {37810#(<= ~counter~0 30)} ~cond := #in~cond; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,385 INFO L290 TraceCheckUtils]: 832: Hoare triple {37810#(<= ~counter~0 30)} assume !(0 == ~cond); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,386 INFO L290 TraceCheckUtils]: 833: Hoare triple {37810#(<= ~counter~0 30)} assume true; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,386 INFO L284 TraceCheckUtils]: 834: Hoare quadruple {37810#(<= ~counter~0 30)} {37810#(<= ~counter~0 30)} #63#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,387 INFO L272 TraceCheckUtils]: 835: Hoare triple {37810#(<= ~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)); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,387 INFO L290 TraceCheckUtils]: 836: Hoare triple {37810#(<= ~counter~0 30)} ~cond := #in~cond; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,387 INFO L290 TraceCheckUtils]: 837: Hoare triple {37810#(<= ~counter~0 30)} assume !(0 == ~cond); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,387 INFO L290 TraceCheckUtils]: 838: Hoare triple {37810#(<= ~counter~0 30)} assume true; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,388 INFO L284 TraceCheckUtils]: 839: Hoare quadruple {37810#(<= ~counter~0 30)} {37810#(<= ~counter~0 30)} #65#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,388 INFO L272 TraceCheckUtils]: 840: Hoare triple {37810#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,388 INFO L290 TraceCheckUtils]: 841: Hoare triple {37810#(<= ~counter~0 30)} ~cond := #in~cond; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,389 INFO L290 TraceCheckUtils]: 842: Hoare triple {37810#(<= ~counter~0 30)} assume !(0 == ~cond); {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,389 INFO L290 TraceCheckUtils]: 843: Hoare triple {37810#(<= ~counter~0 30)} assume true; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,389 INFO L284 TraceCheckUtils]: 844: Hoare quadruple {37810#(<= ~counter~0 30)} {37810#(<= ~counter~0 30)} #67#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,390 INFO L290 TraceCheckUtils]: 845: Hoare triple {37810#(<= ~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; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:47,391 INFO L290 TraceCheckUtils]: 846: Hoare triple {37810#(<= ~counter~0 30)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,391 INFO L290 TraceCheckUtils]: 847: Hoare triple {37895#(<= ~counter~0 31)} assume !!(#t~post5 < 50);havoc #t~post5; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,391 INFO L272 TraceCheckUtils]: 848: Hoare triple {37895#(<= ~counter~0 31)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,392 INFO L290 TraceCheckUtils]: 849: Hoare triple {37895#(<= ~counter~0 31)} ~cond := #in~cond; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,392 INFO L290 TraceCheckUtils]: 850: Hoare triple {37895#(<= ~counter~0 31)} assume !(0 == ~cond); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,392 INFO L290 TraceCheckUtils]: 851: Hoare triple {37895#(<= ~counter~0 31)} assume true; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,393 INFO L284 TraceCheckUtils]: 852: Hoare quadruple {37895#(<= ~counter~0 31)} {37895#(<= ~counter~0 31)} #59#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,393 INFO L272 TraceCheckUtils]: 853: Hoare triple {37895#(<= ~counter~0 31)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,393 INFO L290 TraceCheckUtils]: 854: Hoare triple {37895#(<= ~counter~0 31)} ~cond := #in~cond; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,393 INFO L290 TraceCheckUtils]: 855: Hoare triple {37895#(<= ~counter~0 31)} assume !(0 == ~cond); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,394 INFO L290 TraceCheckUtils]: 856: Hoare triple {37895#(<= ~counter~0 31)} assume true; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,394 INFO L284 TraceCheckUtils]: 857: Hoare quadruple {37895#(<= ~counter~0 31)} {37895#(<= ~counter~0 31)} #61#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,395 INFO L272 TraceCheckUtils]: 858: Hoare triple {37895#(<= ~counter~0 31)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,395 INFO L290 TraceCheckUtils]: 859: Hoare triple {37895#(<= ~counter~0 31)} ~cond := #in~cond; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,395 INFO L290 TraceCheckUtils]: 860: Hoare triple {37895#(<= ~counter~0 31)} assume !(0 == ~cond); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,395 INFO L290 TraceCheckUtils]: 861: Hoare triple {37895#(<= ~counter~0 31)} assume true; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,396 INFO L284 TraceCheckUtils]: 862: Hoare quadruple {37895#(<= ~counter~0 31)} {37895#(<= ~counter~0 31)} #63#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,396 INFO L272 TraceCheckUtils]: 863: Hoare triple {37895#(<= ~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)); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,396 INFO L290 TraceCheckUtils]: 864: Hoare triple {37895#(<= ~counter~0 31)} ~cond := #in~cond; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,397 INFO L290 TraceCheckUtils]: 865: Hoare triple {37895#(<= ~counter~0 31)} assume !(0 == ~cond); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,397 INFO L290 TraceCheckUtils]: 866: Hoare triple {37895#(<= ~counter~0 31)} assume true; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,397 INFO L284 TraceCheckUtils]: 867: Hoare quadruple {37895#(<= ~counter~0 31)} {37895#(<= ~counter~0 31)} #65#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,398 INFO L272 TraceCheckUtils]: 868: Hoare triple {37895#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,398 INFO L290 TraceCheckUtils]: 869: Hoare triple {37895#(<= ~counter~0 31)} ~cond := #in~cond; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,398 INFO L290 TraceCheckUtils]: 870: Hoare triple {37895#(<= ~counter~0 31)} assume !(0 == ~cond); {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,399 INFO L290 TraceCheckUtils]: 871: Hoare triple {37895#(<= ~counter~0 31)} assume true; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,399 INFO L284 TraceCheckUtils]: 872: Hoare quadruple {37895#(<= ~counter~0 31)} {37895#(<= ~counter~0 31)} #67#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,399 INFO L290 TraceCheckUtils]: 873: Hoare triple {37895#(<= ~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; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:47,400 INFO L290 TraceCheckUtils]: 874: Hoare triple {37895#(<= ~counter~0 31)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,400 INFO L290 TraceCheckUtils]: 875: Hoare triple {37980#(<= ~counter~0 32)} assume !!(#t~post5 < 50);havoc #t~post5; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,401 INFO L272 TraceCheckUtils]: 876: Hoare triple {37980#(<= ~counter~0 32)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,401 INFO L290 TraceCheckUtils]: 877: Hoare triple {37980#(<= ~counter~0 32)} ~cond := #in~cond; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,401 INFO L290 TraceCheckUtils]: 878: Hoare triple {37980#(<= ~counter~0 32)} assume !(0 == ~cond); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,402 INFO L290 TraceCheckUtils]: 879: Hoare triple {37980#(<= ~counter~0 32)} assume true; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,402 INFO L284 TraceCheckUtils]: 880: Hoare quadruple {37980#(<= ~counter~0 32)} {37980#(<= ~counter~0 32)} #59#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,402 INFO L272 TraceCheckUtils]: 881: Hoare triple {37980#(<= ~counter~0 32)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,403 INFO L290 TraceCheckUtils]: 882: Hoare triple {37980#(<= ~counter~0 32)} ~cond := #in~cond; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,403 INFO L290 TraceCheckUtils]: 883: Hoare triple {37980#(<= ~counter~0 32)} assume !(0 == ~cond); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,403 INFO L290 TraceCheckUtils]: 884: Hoare triple {37980#(<= ~counter~0 32)} assume true; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,404 INFO L284 TraceCheckUtils]: 885: Hoare quadruple {37980#(<= ~counter~0 32)} {37980#(<= ~counter~0 32)} #61#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,404 INFO L272 TraceCheckUtils]: 886: Hoare triple {37980#(<= ~counter~0 32)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,404 INFO L290 TraceCheckUtils]: 887: Hoare triple {37980#(<= ~counter~0 32)} ~cond := #in~cond; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,405 INFO L290 TraceCheckUtils]: 888: Hoare triple {37980#(<= ~counter~0 32)} assume !(0 == ~cond); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,405 INFO L290 TraceCheckUtils]: 889: Hoare triple {37980#(<= ~counter~0 32)} assume true; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,405 INFO L284 TraceCheckUtils]: 890: Hoare quadruple {37980#(<= ~counter~0 32)} {37980#(<= ~counter~0 32)} #63#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,406 INFO L272 TraceCheckUtils]: 891: Hoare triple {37980#(<= ~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)); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,406 INFO L290 TraceCheckUtils]: 892: Hoare triple {37980#(<= ~counter~0 32)} ~cond := #in~cond; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,406 INFO L290 TraceCheckUtils]: 893: Hoare triple {37980#(<= ~counter~0 32)} assume !(0 == ~cond); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,406 INFO L290 TraceCheckUtils]: 894: Hoare triple {37980#(<= ~counter~0 32)} assume true; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,407 INFO L284 TraceCheckUtils]: 895: Hoare quadruple {37980#(<= ~counter~0 32)} {37980#(<= ~counter~0 32)} #65#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,407 INFO L272 TraceCheckUtils]: 896: Hoare triple {37980#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,408 INFO L290 TraceCheckUtils]: 897: Hoare triple {37980#(<= ~counter~0 32)} ~cond := #in~cond; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,408 INFO L290 TraceCheckUtils]: 898: Hoare triple {37980#(<= ~counter~0 32)} assume !(0 == ~cond); {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,408 INFO L290 TraceCheckUtils]: 899: Hoare triple {37980#(<= ~counter~0 32)} assume true; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,408 INFO L284 TraceCheckUtils]: 900: Hoare quadruple {37980#(<= ~counter~0 32)} {37980#(<= ~counter~0 32)} #67#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,409 INFO L290 TraceCheckUtils]: 901: Hoare triple {37980#(<= ~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; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:47,410 INFO L290 TraceCheckUtils]: 902: Hoare triple {37980#(<= ~counter~0 32)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,410 INFO L290 TraceCheckUtils]: 903: Hoare triple {38065#(<= ~counter~0 33)} assume !!(#t~post5 < 50);havoc #t~post5; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,410 INFO L272 TraceCheckUtils]: 904: Hoare triple {38065#(<= ~counter~0 33)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,411 INFO L290 TraceCheckUtils]: 905: Hoare triple {38065#(<= ~counter~0 33)} ~cond := #in~cond; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,411 INFO L290 TraceCheckUtils]: 906: Hoare triple {38065#(<= ~counter~0 33)} assume !(0 == ~cond); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,411 INFO L290 TraceCheckUtils]: 907: Hoare triple {38065#(<= ~counter~0 33)} assume true; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,412 INFO L284 TraceCheckUtils]: 908: Hoare quadruple {38065#(<= ~counter~0 33)} {38065#(<= ~counter~0 33)} #59#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,412 INFO L272 TraceCheckUtils]: 909: Hoare triple {38065#(<= ~counter~0 33)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,412 INFO L290 TraceCheckUtils]: 910: Hoare triple {38065#(<= ~counter~0 33)} ~cond := #in~cond; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,413 INFO L290 TraceCheckUtils]: 911: Hoare triple {38065#(<= ~counter~0 33)} assume !(0 == ~cond); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,413 INFO L290 TraceCheckUtils]: 912: Hoare triple {38065#(<= ~counter~0 33)} assume true; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,413 INFO L284 TraceCheckUtils]: 913: Hoare quadruple {38065#(<= ~counter~0 33)} {38065#(<= ~counter~0 33)} #61#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,414 INFO L272 TraceCheckUtils]: 914: Hoare triple {38065#(<= ~counter~0 33)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,414 INFO L290 TraceCheckUtils]: 915: Hoare triple {38065#(<= ~counter~0 33)} ~cond := #in~cond; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,414 INFO L290 TraceCheckUtils]: 916: Hoare triple {38065#(<= ~counter~0 33)} assume !(0 == ~cond); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,414 INFO L290 TraceCheckUtils]: 917: Hoare triple {38065#(<= ~counter~0 33)} assume true; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,415 INFO L284 TraceCheckUtils]: 918: Hoare quadruple {38065#(<= ~counter~0 33)} {38065#(<= ~counter~0 33)} #63#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,415 INFO L272 TraceCheckUtils]: 919: Hoare triple {38065#(<= ~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)); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,416 INFO L290 TraceCheckUtils]: 920: Hoare triple {38065#(<= ~counter~0 33)} ~cond := #in~cond; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,416 INFO L290 TraceCheckUtils]: 921: Hoare triple {38065#(<= ~counter~0 33)} assume !(0 == ~cond); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,416 INFO L290 TraceCheckUtils]: 922: Hoare triple {38065#(<= ~counter~0 33)} assume true; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,417 INFO L284 TraceCheckUtils]: 923: Hoare quadruple {38065#(<= ~counter~0 33)} {38065#(<= ~counter~0 33)} #65#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,417 INFO L272 TraceCheckUtils]: 924: Hoare triple {38065#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,417 INFO L290 TraceCheckUtils]: 925: Hoare triple {38065#(<= ~counter~0 33)} ~cond := #in~cond; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,417 INFO L290 TraceCheckUtils]: 926: Hoare triple {38065#(<= ~counter~0 33)} assume !(0 == ~cond); {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,418 INFO L290 TraceCheckUtils]: 927: Hoare triple {38065#(<= ~counter~0 33)} assume true; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,418 INFO L284 TraceCheckUtils]: 928: Hoare quadruple {38065#(<= ~counter~0 33)} {38065#(<= ~counter~0 33)} #67#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,418 INFO L290 TraceCheckUtils]: 929: Hoare triple {38065#(<= ~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; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:47,424 INFO L290 TraceCheckUtils]: 930: Hoare triple {38065#(<= ~counter~0 33)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,425 INFO L290 TraceCheckUtils]: 931: Hoare triple {38150#(<= ~counter~0 34)} assume !!(#t~post5 < 50);havoc #t~post5; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,425 INFO L272 TraceCheckUtils]: 932: Hoare triple {38150#(<= ~counter~0 34)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,425 INFO L290 TraceCheckUtils]: 933: Hoare triple {38150#(<= ~counter~0 34)} ~cond := #in~cond; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,426 INFO L290 TraceCheckUtils]: 934: Hoare triple {38150#(<= ~counter~0 34)} assume !(0 == ~cond); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,426 INFO L290 TraceCheckUtils]: 935: Hoare triple {38150#(<= ~counter~0 34)} assume true; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,427 INFO L284 TraceCheckUtils]: 936: Hoare quadruple {38150#(<= ~counter~0 34)} {38150#(<= ~counter~0 34)} #59#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,427 INFO L272 TraceCheckUtils]: 937: Hoare triple {38150#(<= ~counter~0 34)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,428 INFO L290 TraceCheckUtils]: 938: Hoare triple {38150#(<= ~counter~0 34)} ~cond := #in~cond; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,428 INFO L290 TraceCheckUtils]: 939: Hoare triple {38150#(<= ~counter~0 34)} assume !(0 == ~cond); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,428 INFO L290 TraceCheckUtils]: 940: Hoare triple {38150#(<= ~counter~0 34)} assume true; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,429 INFO L284 TraceCheckUtils]: 941: Hoare quadruple {38150#(<= ~counter~0 34)} {38150#(<= ~counter~0 34)} #61#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,430 INFO L272 TraceCheckUtils]: 942: Hoare triple {38150#(<= ~counter~0 34)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,430 INFO L290 TraceCheckUtils]: 943: Hoare triple {38150#(<= ~counter~0 34)} ~cond := #in~cond; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,430 INFO L290 TraceCheckUtils]: 944: Hoare triple {38150#(<= ~counter~0 34)} assume !(0 == ~cond); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,431 INFO L290 TraceCheckUtils]: 945: Hoare triple {38150#(<= ~counter~0 34)} assume true; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,431 INFO L284 TraceCheckUtils]: 946: Hoare quadruple {38150#(<= ~counter~0 34)} {38150#(<= ~counter~0 34)} #63#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,432 INFO L272 TraceCheckUtils]: 947: Hoare triple {38150#(<= ~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)); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,432 INFO L290 TraceCheckUtils]: 948: Hoare triple {38150#(<= ~counter~0 34)} ~cond := #in~cond; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,433 INFO L290 TraceCheckUtils]: 949: Hoare triple {38150#(<= ~counter~0 34)} assume !(0 == ~cond); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,433 INFO L290 TraceCheckUtils]: 950: Hoare triple {38150#(<= ~counter~0 34)} assume true; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,434 INFO L284 TraceCheckUtils]: 951: Hoare quadruple {38150#(<= ~counter~0 34)} {38150#(<= ~counter~0 34)} #65#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,434 INFO L272 TraceCheckUtils]: 952: Hoare triple {38150#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,435 INFO L290 TraceCheckUtils]: 953: Hoare triple {38150#(<= ~counter~0 34)} ~cond := #in~cond; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,435 INFO L290 TraceCheckUtils]: 954: Hoare triple {38150#(<= ~counter~0 34)} assume !(0 == ~cond); {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,435 INFO L290 TraceCheckUtils]: 955: Hoare triple {38150#(<= ~counter~0 34)} assume true; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,436 INFO L284 TraceCheckUtils]: 956: Hoare quadruple {38150#(<= ~counter~0 34)} {38150#(<= ~counter~0 34)} #67#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,436 INFO L290 TraceCheckUtils]: 957: Hoare triple {38150#(<= ~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; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:47,438 INFO L290 TraceCheckUtils]: 958: Hoare triple {38150#(<= ~counter~0 34)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,438 INFO L290 TraceCheckUtils]: 959: Hoare triple {38235#(<= ~counter~0 35)} assume !!(#t~post5 < 50);havoc #t~post5; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,439 INFO L272 TraceCheckUtils]: 960: Hoare triple {38235#(<= ~counter~0 35)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,439 INFO L290 TraceCheckUtils]: 961: Hoare triple {38235#(<= ~counter~0 35)} ~cond := #in~cond; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,439 INFO L290 TraceCheckUtils]: 962: Hoare triple {38235#(<= ~counter~0 35)} assume !(0 == ~cond); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,440 INFO L290 TraceCheckUtils]: 963: Hoare triple {38235#(<= ~counter~0 35)} assume true; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,440 INFO L284 TraceCheckUtils]: 964: Hoare quadruple {38235#(<= ~counter~0 35)} {38235#(<= ~counter~0 35)} #59#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,441 INFO L272 TraceCheckUtils]: 965: Hoare triple {38235#(<= ~counter~0 35)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,441 INFO L290 TraceCheckUtils]: 966: Hoare triple {38235#(<= ~counter~0 35)} ~cond := #in~cond; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,442 INFO L290 TraceCheckUtils]: 967: Hoare triple {38235#(<= ~counter~0 35)} assume !(0 == ~cond); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,442 INFO L290 TraceCheckUtils]: 968: Hoare triple {38235#(<= ~counter~0 35)} assume true; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,443 INFO L284 TraceCheckUtils]: 969: Hoare quadruple {38235#(<= ~counter~0 35)} {38235#(<= ~counter~0 35)} #61#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,443 INFO L272 TraceCheckUtils]: 970: Hoare triple {38235#(<= ~counter~0 35)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,444 INFO L290 TraceCheckUtils]: 971: Hoare triple {38235#(<= ~counter~0 35)} ~cond := #in~cond; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,444 INFO L290 TraceCheckUtils]: 972: Hoare triple {38235#(<= ~counter~0 35)} assume !(0 == ~cond); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,444 INFO L290 TraceCheckUtils]: 973: Hoare triple {38235#(<= ~counter~0 35)} assume true; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,445 INFO L284 TraceCheckUtils]: 974: Hoare quadruple {38235#(<= ~counter~0 35)} {38235#(<= ~counter~0 35)} #63#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,446 INFO L272 TraceCheckUtils]: 975: Hoare triple {38235#(<= ~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)); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,446 INFO L290 TraceCheckUtils]: 976: Hoare triple {38235#(<= ~counter~0 35)} ~cond := #in~cond; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,446 INFO L290 TraceCheckUtils]: 977: Hoare triple {38235#(<= ~counter~0 35)} assume !(0 == ~cond); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,447 INFO L290 TraceCheckUtils]: 978: Hoare triple {38235#(<= ~counter~0 35)} assume true; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,447 INFO L284 TraceCheckUtils]: 979: Hoare quadruple {38235#(<= ~counter~0 35)} {38235#(<= ~counter~0 35)} #65#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,448 INFO L272 TraceCheckUtils]: 980: Hoare triple {38235#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,448 INFO L290 TraceCheckUtils]: 981: Hoare triple {38235#(<= ~counter~0 35)} ~cond := #in~cond; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,448 INFO L290 TraceCheckUtils]: 982: Hoare triple {38235#(<= ~counter~0 35)} assume !(0 == ~cond); {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,449 INFO L290 TraceCheckUtils]: 983: Hoare triple {38235#(<= ~counter~0 35)} assume true; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,449 INFO L284 TraceCheckUtils]: 984: Hoare quadruple {38235#(<= ~counter~0 35)} {38235#(<= ~counter~0 35)} #67#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,450 INFO L290 TraceCheckUtils]: 985: Hoare triple {38235#(<= ~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; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:47,451 INFO L290 TraceCheckUtils]: 986: Hoare triple {38235#(<= ~counter~0 35)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,451 INFO L290 TraceCheckUtils]: 987: Hoare triple {38320#(<= ~counter~0 36)} assume !!(#t~post5 < 50);havoc #t~post5; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,452 INFO L272 TraceCheckUtils]: 988: Hoare triple {38320#(<= ~counter~0 36)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,452 INFO L290 TraceCheckUtils]: 989: Hoare triple {38320#(<= ~counter~0 36)} ~cond := #in~cond; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,452 INFO L290 TraceCheckUtils]: 990: Hoare triple {38320#(<= ~counter~0 36)} assume !(0 == ~cond); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,453 INFO L290 TraceCheckUtils]: 991: Hoare triple {38320#(<= ~counter~0 36)} assume true; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,453 INFO L284 TraceCheckUtils]: 992: Hoare quadruple {38320#(<= ~counter~0 36)} {38320#(<= ~counter~0 36)} #59#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,454 INFO L272 TraceCheckUtils]: 993: Hoare triple {38320#(<= ~counter~0 36)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,454 INFO L290 TraceCheckUtils]: 994: Hoare triple {38320#(<= ~counter~0 36)} ~cond := #in~cond; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,454 INFO L290 TraceCheckUtils]: 995: Hoare triple {38320#(<= ~counter~0 36)} assume !(0 == ~cond); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,455 INFO L290 TraceCheckUtils]: 996: Hoare triple {38320#(<= ~counter~0 36)} assume true; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,455 INFO L284 TraceCheckUtils]: 997: Hoare quadruple {38320#(<= ~counter~0 36)} {38320#(<= ~counter~0 36)} #61#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,456 INFO L272 TraceCheckUtils]: 998: Hoare triple {38320#(<= ~counter~0 36)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,456 INFO L290 TraceCheckUtils]: 999: Hoare triple {38320#(<= ~counter~0 36)} ~cond := #in~cond; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,457 INFO L290 TraceCheckUtils]: 1,000: Hoare triple {38320#(<= ~counter~0 36)} assume !(0 == ~cond); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,457 INFO L290 TraceCheckUtils]: 1,001: Hoare triple {38320#(<= ~counter~0 36)} assume true; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,457 INFO L284 TraceCheckUtils]: 1,002: Hoare quadruple {38320#(<= ~counter~0 36)} {38320#(<= ~counter~0 36)} #63#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,458 INFO L272 TraceCheckUtils]: 1,003: Hoare triple {38320#(<= ~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)); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,458 INFO L290 TraceCheckUtils]: 1,004: Hoare triple {38320#(<= ~counter~0 36)} ~cond := #in~cond; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,459 INFO L290 TraceCheckUtils]: 1,005: Hoare triple {38320#(<= ~counter~0 36)} assume !(0 == ~cond); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,459 INFO L290 TraceCheckUtils]: 1,006: Hoare triple {38320#(<= ~counter~0 36)} assume true; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,460 INFO L284 TraceCheckUtils]: 1,007: Hoare quadruple {38320#(<= ~counter~0 36)} {38320#(<= ~counter~0 36)} #65#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,460 INFO L272 TraceCheckUtils]: 1,008: Hoare triple {38320#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,460 INFO L290 TraceCheckUtils]: 1,009: Hoare triple {38320#(<= ~counter~0 36)} ~cond := #in~cond; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,461 INFO L290 TraceCheckUtils]: 1,010: Hoare triple {38320#(<= ~counter~0 36)} assume !(0 == ~cond); {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,461 INFO L290 TraceCheckUtils]: 1,011: Hoare triple {38320#(<= ~counter~0 36)} assume true; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,462 INFO L284 TraceCheckUtils]: 1,012: Hoare quadruple {38320#(<= ~counter~0 36)} {38320#(<= ~counter~0 36)} #67#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,462 INFO L290 TraceCheckUtils]: 1,013: Hoare triple {38320#(<= ~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; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:47,463 INFO L290 TraceCheckUtils]: 1,014: Hoare triple {38320#(<= ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,463 INFO L290 TraceCheckUtils]: 1,015: Hoare triple {38405#(<= ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,464 INFO L272 TraceCheckUtils]: 1,016: Hoare triple {38405#(<= ~counter~0 37)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,464 INFO L290 TraceCheckUtils]: 1,017: Hoare triple {38405#(<= ~counter~0 37)} ~cond := #in~cond; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,465 INFO L290 TraceCheckUtils]: 1,018: Hoare triple {38405#(<= ~counter~0 37)} assume !(0 == ~cond); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,465 INFO L290 TraceCheckUtils]: 1,019: Hoare triple {38405#(<= ~counter~0 37)} assume true; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,466 INFO L284 TraceCheckUtils]: 1,020: Hoare quadruple {38405#(<= ~counter~0 37)} {38405#(<= ~counter~0 37)} #59#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,466 INFO L272 TraceCheckUtils]: 1,021: Hoare triple {38405#(<= ~counter~0 37)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,466 INFO L290 TraceCheckUtils]: 1,022: Hoare triple {38405#(<= ~counter~0 37)} ~cond := #in~cond; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,467 INFO L290 TraceCheckUtils]: 1,023: Hoare triple {38405#(<= ~counter~0 37)} assume !(0 == ~cond); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,467 INFO L290 TraceCheckUtils]: 1,024: Hoare triple {38405#(<= ~counter~0 37)} assume true; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,468 INFO L284 TraceCheckUtils]: 1,025: Hoare quadruple {38405#(<= ~counter~0 37)} {38405#(<= ~counter~0 37)} #61#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,468 INFO L272 TraceCheckUtils]: 1,026: Hoare triple {38405#(<= ~counter~0 37)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,468 INFO L290 TraceCheckUtils]: 1,027: Hoare triple {38405#(<= ~counter~0 37)} ~cond := #in~cond; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,469 INFO L290 TraceCheckUtils]: 1,028: Hoare triple {38405#(<= ~counter~0 37)} assume !(0 == ~cond); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,469 INFO L290 TraceCheckUtils]: 1,029: Hoare triple {38405#(<= ~counter~0 37)} assume true; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,470 INFO L284 TraceCheckUtils]: 1,030: Hoare quadruple {38405#(<= ~counter~0 37)} {38405#(<= ~counter~0 37)} #63#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,470 INFO L272 TraceCheckUtils]: 1,031: Hoare triple {38405#(<= ~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)); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,471 INFO L290 TraceCheckUtils]: 1,032: Hoare triple {38405#(<= ~counter~0 37)} ~cond := #in~cond; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,471 INFO L290 TraceCheckUtils]: 1,033: Hoare triple {38405#(<= ~counter~0 37)} assume !(0 == ~cond); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,471 INFO L290 TraceCheckUtils]: 1,034: Hoare triple {38405#(<= ~counter~0 37)} assume true; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,472 INFO L284 TraceCheckUtils]: 1,035: Hoare quadruple {38405#(<= ~counter~0 37)} {38405#(<= ~counter~0 37)} #65#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,472 INFO L272 TraceCheckUtils]: 1,036: Hoare triple {38405#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,473 INFO L290 TraceCheckUtils]: 1,037: Hoare triple {38405#(<= ~counter~0 37)} ~cond := #in~cond; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,473 INFO L290 TraceCheckUtils]: 1,038: Hoare triple {38405#(<= ~counter~0 37)} assume !(0 == ~cond); {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,473 INFO L290 TraceCheckUtils]: 1,039: Hoare triple {38405#(<= ~counter~0 37)} assume true; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,474 INFO L284 TraceCheckUtils]: 1,040: Hoare quadruple {38405#(<= ~counter~0 37)} {38405#(<= ~counter~0 37)} #67#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,474 INFO L290 TraceCheckUtils]: 1,041: Hoare triple {38405#(<= ~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; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:47,475 INFO L290 TraceCheckUtils]: 1,042: Hoare triple {38405#(<= ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,476 INFO L290 TraceCheckUtils]: 1,043: Hoare triple {38490#(<= ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,476 INFO L272 TraceCheckUtils]: 1,044: Hoare triple {38490#(<= ~counter~0 38)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,477 INFO L290 TraceCheckUtils]: 1,045: Hoare triple {38490#(<= ~counter~0 38)} ~cond := #in~cond; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,477 INFO L290 TraceCheckUtils]: 1,046: Hoare triple {38490#(<= ~counter~0 38)} assume !(0 == ~cond); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,477 INFO L290 TraceCheckUtils]: 1,047: Hoare triple {38490#(<= ~counter~0 38)} assume true; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,478 INFO L284 TraceCheckUtils]: 1,048: Hoare quadruple {38490#(<= ~counter~0 38)} {38490#(<= ~counter~0 38)} #59#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,478 INFO L272 TraceCheckUtils]: 1,049: Hoare triple {38490#(<= ~counter~0 38)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,479 INFO L290 TraceCheckUtils]: 1,050: Hoare triple {38490#(<= ~counter~0 38)} ~cond := #in~cond; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,479 INFO L290 TraceCheckUtils]: 1,051: Hoare triple {38490#(<= ~counter~0 38)} assume !(0 == ~cond); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,479 INFO L290 TraceCheckUtils]: 1,052: Hoare triple {38490#(<= ~counter~0 38)} assume true; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,480 INFO L284 TraceCheckUtils]: 1,053: Hoare quadruple {38490#(<= ~counter~0 38)} {38490#(<= ~counter~0 38)} #61#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,480 INFO L272 TraceCheckUtils]: 1,054: Hoare triple {38490#(<= ~counter~0 38)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,481 INFO L290 TraceCheckUtils]: 1,055: Hoare triple {38490#(<= ~counter~0 38)} ~cond := #in~cond; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,481 INFO L290 TraceCheckUtils]: 1,056: Hoare triple {38490#(<= ~counter~0 38)} assume !(0 == ~cond); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,481 INFO L290 TraceCheckUtils]: 1,057: Hoare triple {38490#(<= ~counter~0 38)} assume true; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,482 INFO L284 TraceCheckUtils]: 1,058: Hoare quadruple {38490#(<= ~counter~0 38)} {38490#(<= ~counter~0 38)} #63#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,482 INFO L272 TraceCheckUtils]: 1,059: Hoare triple {38490#(<= ~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)); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,483 INFO L290 TraceCheckUtils]: 1,060: Hoare triple {38490#(<= ~counter~0 38)} ~cond := #in~cond; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,483 INFO L290 TraceCheckUtils]: 1,061: Hoare triple {38490#(<= ~counter~0 38)} assume !(0 == ~cond); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,483 INFO L290 TraceCheckUtils]: 1,062: Hoare triple {38490#(<= ~counter~0 38)} assume true; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,484 INFO L284 TraceCheckUtils]: 1,063: Hoare quadruple {38490#(<= ~counter~0 38)} {38490#(<= ~counter~0 38)} #65#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,484 INFO L272 TraceCheckUtils]: 1,064: Hoare triple {38490#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,485 INFO L290 TraceCheckUtils]: 1,065: Hoare triple {38490#(<= ~counter~0 38)} ~cond := #in~cond; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,485 INFO L290 TraceCheckUtils]: 1,066: Hoare triple {38490#(<= ~counter~0 38)} assume !(0 == ~cond); {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,485 INFO L290 TraceCheckUtils]: 1,067: Hoare triple {38490#(<= ~counter~0 38)} assume true; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,486 INFO L284 TraceCheckUtils]: 1,068: Hoare quadruple {38490#(<= ~counter~0 38)} {38490#(<= ~counter~0 38)} #67#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,486 INFO L290 TraceCheckUtils]: 1,069: Hoare triple {38490#(<= ~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; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:47,487 INFO L290 TraceCheckUtils]: 1,070: Hoare triple {38490#(<= ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,488 INFO L290 TraceCheckUtils]: 1,071: Hoare triple {38575#(<= ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,488 INFO L272 TraceCheckUtils]: 1,072: Hoare triple {38575#(<= ~counter~0 39)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,488 INFO L290 TraceCheckUtils]: 1,073: Hoare triple {38575#(<= ~counter~0 39)} ~cond := #in~cond; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,489 INFO L290 TraceCheckUtils]: 1,074: Hoare triple {38575#(<= ~counter~0 39)} assume !(0 == ~cond); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,489 INFO L290 TraceCheckUtils]: 1,075: Hoare triple {38575#(<= ~counter~0 39)} assume true; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,490 INFO L284 TraceCheckUtils]: 1,076: Hoare quadruple {38575#(<= ~counter~0 39)} {38575#(<= ~counter~0 39)} #59#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,490 INFO L272 TraceCheckUtils]: 1,077: Hoare triple {38575#(<= ~counter~0 39)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,490 INFO L290 TraceCheckUtils]: 1,078: Hoare triple {38575#(<= ~counter~0 39)} ~cond := #in~cond; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,491 INFO L290 TraceCheckUtils]: 1,079: Hoare triple {38575#(<= ~counter~0 39)} assume !(0 == ~cond); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,491 INFO L290 TraceCheckUtils]: 1,080: Hoare triple {38575#(<= ~counter~0 39)} assume true; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,491 INFO L284 TraceCheckUtils]: 1,081: Hoare quadruple {38575#(<= ~counter~0 39)} {38575#(<= ~counter~0 39)} #61#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,492 INFO L272 TraceCheckUtils]: 1,082: Hoare triple {38575#(<= ~counter~0 39)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,492 INFO L290 TraceCheckUtils]: 1,083: Hoare triple {38575#(<= ~counter~0 39)} ~cond := #in~cond; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,493 INFO L290 TraceCheckUtils]: 1,084: Hoare triple {38575#(<= ~counter~0 39)} assume !(0 == ~cond); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,493 INFO L290 TraceCheckUtils]: 1,085: Hoare triple {38575#(<= ~counter~0 39)} assume true; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,493 INFO L284 TraceCheckUtils]: 1,086: Hoare quadruple {38575#(<= ~counter~0 39)} {38575#(<= ~counter~0 39)} #63#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,494 INFO L272 TraceCheckUtils]: 1,087: Hoare triple {38575#(<= ~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)); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,494 INFO L290 TraceCheckUtils]: 1,088: Hoare triple {38575#(<= ~counter~0 39)} ~cond := #in~cond; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,494 INFO L290 TraceCheckUtils]: 1,089: Hoare triple {38575#(<= ~counter~0 39)} assume !(0 == ~cond); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,495 INFO L290 TraceCheckUtils]: 1,090: Hoare triple {38575#(<= ~counter~0 39)} assume true; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,495 INFO L284 TraceCheckUtils]: 1,091: Hoare quadruple {38575#(<= ~counter~0 39)} {38575#(<= ~counter~0 39)} #65#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,496 INFO L272 TraceCheckUtils]: 1,092: Hoare triple {38575#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,496 INFO L290 TraceCheckUtils]: 1,093: Hoare triple {38575#(<= ~counter~0 39)} ~cond := #in~cond; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,496 INFO L290 TraceCheckUtils]: 1,094: Hoare triple {38575#(<= ~counter~0 39)} assume !(0 == ~cond); {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,497 INFO L290 TraceCheckUtils]: 1,095: Hoare triple {38575#(<= ~counter~0 39)} assume true; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,497 INFO L284 TraceCheckUtils]: 1,096: Hoare quadruple {38575#(<= ~counter~0 39)} {38575#(<= ~counter~0 39)} #67#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,497 INFO L290 TraceCheckUtils]: 1,097: Hoare triple {38575#(<= ~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; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:47,499 INFO L290 TraceCheckUtils]: 1,098: Hoare triple {38575#(<= ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,499 INFO L290 TraceCheckUtils]: 1,099: Hoare triple {38660#(<= ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,499 INFO L272 TraceCheckUtils]: 1,100: Hoare triple {38660#(<= ~counter~0 40)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,500 INFO L290 TraceCheckUtils]: 1,101: Hoare triple {38660#(<= ~counter~0 40)} ~cond := #in~cond; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,500 INFO L290 TraceCheckUtils]: 1,102: Hoare triple {38660#(<= ~counter~0 40)} assume !(0 == ~cond); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,500 INFO L290 TraceCheckUtils]: 1,103: Hoare triple {38660#(<= ~counter~0 40)} assume true; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,501 INFO L284 TraceCheckUtils]: 1,104: Hoare quadruple {38660#(<= ~counter~0 40)} {38660#(<= ~counter~0 40)} #59#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,501 INFO L272 TraceCheckUtils]: 1,105: Hoare triple {38660#(<= ~counter~0 40)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,502 INFO L290 TraceCheckUtils]: 1,106: Hoare triple {38660#(<= ~counter~0 40)} ~cond := #in~cond; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,502 INFO L290 TraceCheckUtils]: 1,107: Hoare triple {38660#(<= ~counter~0 40)} assume !(0 == ~cond); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,502 INFO L290 TraceCheckUtils]: 1,108: Hoare triple {38660#(<= ~counter~0 40)} assume true; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,503 INFO L284 TraceCheckUtils]: 1,109: Hoare quadruple {38660#(<= ~counter~0 40)} {38660#(<= ~counter~0 40)} #61#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,503 INFO L272 TraceCheckUtils]: 1,110: Hoare triple {38660#(<= ~counter~0 40)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,503 INFO L290 TraceCheckUtils]: 1,111: Hoare triple {38660#(<= ~counter~0 40)} ~cond := #in~cond; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,504 INFO L290 TraceCheckUtils]: 1,112: Hoare triple {38660#(<= ~counter~0 40)} assume !(0 == ~cond); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,504 INFO L290 TraceCheckUtils]: 1,113: Hoare triple {38660#(<= ~counter~0 40)} assume true; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,505 INFO L284 TraceCheckUtils]: 1,114: Hoare quadruple {38660#(<= ~counter~0 40)} {38660#(<= ~counter~0 40)} #63#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,505 INFO L272 TraceCheckUtils]: 1,115: Hoare triple {38660#(<= ~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)); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,505 INFO L290 TraceCheckUtils]: 1,116: Hoare triple {38660#(<= ~counter~0 40)} ~cond := #in~cond; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,506 INFO L290 TraceCheckUtils]: 1,117: Hoare triple {38660#(<= ~counter~0 40)} assume !(0 == ~cond); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,506 INFO L290 TraceCheckUtils]: 1,118: Hoare triple {38660#(<= ~counter~0 40)} assume true; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,507 INFO L284 TraceCheckUtils]: 1,119: Hoare quadruple {38660#(<= ~counter~0 40)} {38660#(<= ~counter~0 40)} #65#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,507 INFO L272 TraceCheckUtils]: 1,120: Hoare triple {38660#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,507 INFO L290 TraceCheckUtils]: 1,121: Hoare triple {38660#(<= ~counter~0 40)} ~cond := #in~cond; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,508 INFO L290 TraceCheckUtils]: 1,122: Hoare triple {38660#(<= ~counter~0 40)} assume !(0 == ~cond); {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,508 INFO L290 TraceCheckUtils]: 1,123: Hoare triple {38660#(<= ~counter~0 40)} assume true; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,508 INFO L284 TraceCheckUtils]: 1,124: Hoare quadruple {38660#(<= ~counter~0 40)} {38660#(<= ~counter~0 40)} #67#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,508 INFO L290 TraceCheckUtils]: 1,125: Hoare triple {38660#(<= ~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; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:47,509 INFO L290 TraceCheckUtils]: 1,126: Hoare triple {38660#(<= ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,510 INFO L290 TraceCheckUtils]: 1,127: Hoare triple {38745#(<= ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,510 INFO L272 TraceCheckUtils]: 1,128: Hoare triple {38745#(<= ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,510 INFO L290 TraceCheckUtils]: 1,129: Hoare triple {38745#(<= ~counter~0 41)} ~cond := #in~cond; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,511 INFO L290 TraceCheckUtils]: 1,130: Hoare triple {38745#(<= ~counter~0 41)} assume !(0 == ~cond); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,511 INFO L290 TraceCheckUtils]: 1,131: Hoare triple {38745#(<= ~counter~0 41)} assume true; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,511 INFO L284 TraceCheckUtils]: 1,132: Hoare quadruple {38745#(<= ~counter~0 41)} {38745#(<= ~counter~0 41)} #59#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,512 INFO L272 TraceCheckUtils]: 1,133: Hoare triple {38745#(<= ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,512 INFO L290 TraceCheckUtils]: 1,134: Hoare triple {38745#(<= ~counter~0 41)} ~cond := #in~cond; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,512 INFO L290 TraceCheckUtils]: 1,135: Hoare triple {38745#(<= ~counter~0 41)} assume !(0 == ~cond); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,513 INFO L290 TraceCheckUtils]: 1,136: Hoare triple {38745#(<= ~counter~0 41)} assume true; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,513 INFO L284 TraceCheckUtils]: 1,137: Hoare quadruple {38745#(<= ~counter~0 41)} {38745#(<= ~counter~0 41)} #61#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,514 INFO L272 TraceCheckUtils]: 1,138: Hoare triple {38745#(<= ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,514 INFO L290 TraceCheckUtils]: 1,139: Hoare triple {38745#(<= ~counter~0 41)} ~cond := #in~cond; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,514 INFO L290 TraceCheckUtils]: 1,140: Hoare triple {38745#(<= ~counter~0 41)} assume !(0 == ~cond); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,514 INFO L290 TraceCheckUtils]: 1,141: Hoare triple {38745#(<= ~counter~0 41)} assume true; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,515 INFO L284 TraceCheckUtils]: 1,142: Hoare quadruple {38745#(<= ~counter~0 41)} {38745#(<= ~counter~0 41)} #63#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,515 INFO L272 TraceCheckUtils]: 1,143: Hoare triple {38745#(<= ~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)); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,515 INFO L290 TraceCheckUtils]: 1,144: Hoare triple {38745#(<= ~counter~0 41)} ~cond := #in~cond; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,516 INFO L290 TraceCheckUtils]: 1,145: Hoare triple {38745#(<= ~counter~0 41)} assume !(0 == ~cond); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,516 INFO L290 TraceCheckUtils]: 1,146: Hoare triple {38745#(<= ~counter~0 41)} assume true; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,517 INFO L284 TraceCheckUtils]: 1,147: Hoare quadruple {38745#(<= ~counter~0 41)} {38745#(<= ~counter~0 41)} #65#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,517 INFO L272 TraceCheckUtils]: 1,148: Hoare triple {38745#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,517 INFO L290 TraceCheckUtils]: 1,149: Hoare triple {38745#(<= ~counter~0 41)} ~cond := #in~cond; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,518 INFO L290 TraceCheckUtils]: 1,150: Hoare triple {38745#(<= ~counter~0 41)} assume !(0 == ~cond); {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,518 INFO L290 TraceCheckUtils]: 1,151: Hoare triple {38745#(<= ~counter~0 41)} assume true; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,518 INFO L284 TraceCheckUtils]: 1,152: Hoare quadruple {38745#(<= ~counter~0 41)} {38745#(<= ~counter~0 41)} #67#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,519 INFO L290 TraceCheckUtils]: 1,153: Hoare triple {38745#(<= ~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; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:47,520 INFO L290 TraceCheckUtils]: 1,154: Hoare triple {38745#(<= ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,520 INFO L290 TraceCheckUtils]: 1,155: Hoare triple {38830#(<= ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,521 INFO L272 TraceCheckUtils]: 1,156: Hoare triple {38830#(<= ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,521 INFO L290 TraceCheckUtils]: 1,157: Hoare triple {38830#(<= ~counter~0 42)} ~cond := #in~cond; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,521 INFO L290 TraceCheckUtils]: 1,158: Hoare triple {38830#(<= ~counter~0 42)} assume !(0 == ~cond); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,522 INFO L290 TraceCheckUtils]: 1,159: Hoare triple {38830#(<= ~counter~0 42)} assume true; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,522 INFO L284 TraceCheckUtils]: 1,160: Hoare quadruple {38830#(<= ~counter~0 42)} {38830#(<= ~counter~0 42)} #59#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,522 INFO L272 TraceCheckUtils]: 1,161: Hoare triple {38830#(<= ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,523 INFO L290 TraceCheckUtils]: 1,162: Hoare triple {38830#(<= ~counter~0 42)} ~cond := #in~cond; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,523 INFO L290 TraceCheckUtils]: 1,163: Hoare triple {38830#(<= ~counter~0 42)} assume !(0 == ~cond); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,523 INFO L290 TraceCheckUtils]: 1,164: Hoare triple {38830#(<= ~counter~0 42)} assume true; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,524 INFO L284 TraceCheckUtils]: 1,165: Hoare quadruple {38830#(<= ~counter~0 42)} {38830#(<= ~counter~0 42)} #61#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,524 INFO L272 TraceCheckUtils]: 1,166: Hoare triple {38830#(<= ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,524 INFO L290 TraceCheckUtils]: 1,167: Hoare triple {38830#(<= ~counter~0 42)} ~cond := #in~cond; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,525 INFO L290 TraceCheckUtils]: 1,168: Hoare triple {38830#(<= ~counter~0 42)} assume !(0 == ~cond); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,525 INFO L290 TraceCheckUtils]: 1,169: Hoare triple {38830#(<= ~counter~0 42)} assume true; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,525 INFO L284 TraceCheckUtils]: 1,170: Hoare quadruple {38830#(<= ~counter~0 42)} {38830#(<= ~counter~0 42)} #63#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,526 INFO L272 TraceCheckUtils]: 1,171: Hoare triple {38830#(<= ~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)); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,526 INFO L290 TraceCheckUtils]: 1,172: Hoare triple {38830#(<= ~counter~0 42)} ~cond := #in~cond; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,526 INFO L290 TraceCheckUtils]: 1,173: Hoare triple {38830#(<= ~counter~0 42)} assume !(0 == ~cond); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,526 INFO L290 TraceCheckUtils]: 1,174: Hoare triple {38830#(<= ~counter~0 42)} assume true; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,527 INFO L284 TraceCheckUtils]: 1,175: Hoare quadruple {38830#(<= ~counter~0 42)} {38830#(<= ~counter~0 42)} #65#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,527 INFO L272 TraceCheckUtils]: 1,176: Hoare triple {38830#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,528 INFO L290 TraceCheckUtils]: 1,177: Hoare triple {38830#(<= ~counter~0 42)} ~cond := #in~cond; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,528 INFO L290 TraceCheckUtils]: 1,178: Hoare triple {38830#(<= ~counter~0 42)} assume !(0 == ~cond); {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,528 INFO L290 TraceCheckUtils]: 1,179: Hoare triple {38830#(<= ~counter~0 42)} assume true; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,529 INFO L284 TraceCheckUtils]: 1,180: Hoare quadruple {38830#(<= ~counter~0 42)} {38830#(<= ~counter~0 42)} #67#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,529 INFO L290 TraceCheckUtils]: 1,181: Hoare triple {38830#(<= ~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; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:47,530 INFO L290 TraceCheckUtils]: 1,182: Hoare triple {38830#(<= ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,530 INFO L290 TraceCheckUtils]: 1,183: Hoare triple {38915#(<= ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,531 INFO L272 TraceCheckUtils]: 1,184: Hoare triple {38915#(<= ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,531 INFO L290 TraceCheckUtils]: 1,185: Hoare triple {38915#(<= ~counter~0 43)} ~cond := #in~cond; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,531 INFO L290 TraceCheckUtils]: 1,186: Hoare triple {38915#(<= ~counter~0 43)} assume !(0 == ~cond); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,531 INFO L290 TraceCheckUtils]: 1,187: Hoare triple {38915#(<= ~counter~0 43)} assume true; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,532 INFO L284 TraceCheckUtils]: 1,188: Hoare quadruple {38915#(<= ~counter~0 43)} {38915#(<= ~counter~0 43)} #59#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,532 INFO L272 TraceCheckUtils]: 1,189: Hoare triple {38915#(<= ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,533 INFO L290 TraceCheckUtils]: 1,190: Hoare triple {38915#(<= ~counter~0 43)} ~cond := #in~cond; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,533 INFO L290 TraceCheckUtils]: 1,191: Hoare triple {38915#(<= ~counter~0 43)} assume !(0 == ~cond); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,533 INFO L290 TraceCheckUtils]: 1,192: Hoare triple {38915#(<= ~counter~0 43)} assume true; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,534 INFO L284 TraceCheckUtils]: 1,193: Hoare quadruple {38915#(<= ~counter~0 43)} {38915#(<= ~counter~0 43)} #61#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,534 INFO L272 TraceCheckUtils]: 1,194: Hoare triple {38915#(<= ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,535 INFO L290 TraceCheckUtils]: 1,195: Hoare triple {38915#(<= ~counter~0 43)} ~cond := #in~cond; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,535 INFO L290 TraceCheckUtils]: 1,196: Hoare triple {38915#(<= ~counter~0 43)} assume !(0 == ~cond); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,535 INFO L290 TraceCheckUtils]: 1,197: Hoare triple {38915#(<= ~counter~0 43)} assume true; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,536 INFO L284 TraceCheckUtils]: 1,198: Hoare quadruple {38915#(<= ~counter~0 43)} {38915#(<= ~counter~0 43)} #63#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,536 INFO L272 TraceCheckUtils]: 1,199: Hoare triple {38915#(<= ~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)); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,537 INFO L290 TraceCheckUtils]: 1,200: Hoare triple {38915#(<= ~counter~0 43)} ~cond := #in~cond; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,537 INFO L290 TraceCheckUtils]: 1,201: Hoare triple {38915#(<= ~counter~0 43)} assume !(0 == ~cond); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,537 INFO L290 TraceCheckUtils]: 1,202: Hoare triple {38915#(<= ~counter~0 43)} assume true; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,538 INFO L284 TraceCheckUtils]: 1,203: Hoare quadruple {38915#(<= ~counter~0 43)} {38915#(<= ~counter~0 43)} #65#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,538 INFO L272 TraceCheckUtils]: 1,204: Hoare triple {38915#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,539 INFO L290 TraceCheckUtils]: 1,205: Hoare triple {38915#(<= ~counter~0 43)} ~cond := #in~cond; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,539 INFO L290 TraceCheckUtils]: 1,206: Hoare triple {38915#(<= ~counter~0 43)} assume !(0 == ~cond); {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,539 INFO L290 TraceCheckUtils]: 1,207: Hoare triple {38915#(<= ~counter~0 43)} assume true; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,540 INFO L284 TraceCheckUtils]: 1,208: Hoare quadruple {38915#(<= ~counter~0 43)} {38915#(<= ~counter~0 43)} #67#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,540 INFO L290 TraceCheckUtils]: 1,209: Hoare triple {38915#(<= ~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; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:47,541 INFO L290 TraceCheckUtils]: 1,210: Hoare triple {38915#(<= ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,542 INFO L290 TraceCheckUtils]: 1,211: Hoare triple {39000#(<= ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,542 INFO L272 TraceCheckUtils]: 1,212: Hoare triple {39000#(<= ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,542 INFO L290 TraceCheckUtils]: 1,213: Hoare triple {39000#(<= ~counter~0 44)} ~cond := #in~cond; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,543 INFO L290 TraceCheckUtils]: 1,214: Hoare triple {39000#(<= ~counter~0 44)} assume !(0 == ~cond); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,543 INFO L290 TraceCheckUtils]: 1,215: Hoare triple {39000#(<= ~counter~0 44)} assume true; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,543 INFO L284 TraceCheckUtils]: 1,216: Hoare quadruple {39000#(<= ~counter~0 44)} {39000#(<= ~counter~0 44)} #59#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,544 INFO L272 TraceCheckUtils]: 1,217: Hoare triple {39000#(<= ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,544 INFO L290 TraceCheckUtils]: 1,218: Hoare triple {39000#(<= ~counter~0 44)} ~cond := #in~cond; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,545 INFO L290 TraceCheckUtils]: 1,219: Hoare triple {39000#(<= ~counter~0 44)} assume !(0 == ~cond); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,545 INFO L290 TraceCheckUtils]: 1,220: Hoare triple {39000#(<= ~counter~0 44)} assume true; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,545 INFO L284 TraceCheckUtils]: 1,221: Hoare quadruple {39000#(<= ~counter~0 44)} {39000#(<= ~counter~0 44)} #61#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,546 INFO L272 TraceCheckUtils]: 1,222: Hoare triple {39000#(<= ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,546 INFO L290 TraceCheckUtils]: 1,223: Hoare triple {39000#(<= ~counter~0 44)} ~cond := #in~cond; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,546 INFO L290 TraceCheckUtils]: 1,224: Hoare triple {39000#(<= ~counter~0 44)} assume !(0 == ~cond); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,547 INFO L290 TraceCheckUtils]: 1,225: Hoare triple {39000#(<= ~counter~0 44)} assume true; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,547 INFO L284 TraceCheckUtils]: 1,226: Hoare quadruple {39000#(<= ~counter~0 44)} {39000#(<= ~counter~0 44)} #63#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,548 INFO L272 TraceCheckUtils]: 1,227: Hoare triple {39000#(<= ~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)); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,548 INFO L290 TraceCheckUtils]: 1,228: Hoare triple {39000#(<= ~counter~0 44)} ~cond := #in~cond; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,548 INFO L290 TraceCheckUtils]: 1,229: Hoare triple {39000#(<= ~counter~0 44)} assume !(0 == ~cond); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,548 INFO L290 TraceCheckUtils]: 1,230: Hoare triple {39000#(<= ~counter~0 44)} assume true; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,549 INFO L284 TraceCheckUtils]: 1,231: Hoare quadruple {39000#(<= ~counter~0 44)} {39000#(<= ~counter~0 44)} #65#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,550 INFO L272 TraceCheckUtils]: 1,232: Hoare triple {39000#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,550 INFO L290 TraceCheckUtils]: 1,233: Hoare triple {39000#(<= ~counter~0 44)} ~cond := #in~cond; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,550 INFO L290 TraceCheckUtils]: 1,234: Hoare triple {39000#(<= ~counter~0 44)} assume !(0 == ~cond); {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,550 INFO L290 TraceCheckUtils]: 1,235: Hoare triple {39000#(<= ~counter~0 44)} assume true; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,551 INFO L284 TraceCheckUtils]: 1,236: Hoare quadruple {39000#(<= ~counter~0 44)} {39000#(<= ~counter~0 44)} #67#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,551 INFO L290 TraceCheckUtils]: 1,237: Hoare triple {39000#(<= ~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; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:47,552 INFO L290 TraceCheckUtils]: 1,238: Hoare triple {39000#(<= ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,553 INFO L290 TraceCheckUtils]: 1,239: Hoare triple {39085#(<= ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,553 INFO L272 TraceCheckUtils]: 1,240: Hoare triple {39085#(<= ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,553 INFO L290 TraceCheckUtils]: 1,241: Hoare triple {39085#(<= ~counter~0 45)} ~cond := #in~cond; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,554 INFO L290 TraceCheckUtils]: 1,242: Hoare triple {39085#(<= ~counter~0 45)} assume !(0 == ~cond); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,554 INFO L290 TraceCheckUtils]: 1,243: Hoare triple {39085#(<= ~counter~0 45)} assume true; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,555 INFO L284 TraceCheckUtils]: 1,244: Hoare quadruple {39085#(<= ~counter~0 45)} {39085#(<= ~counter~0 45)} #59#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,555 INFO L272 TraceCheckUtils]: 1,245: Hoare triple {39085#(<= ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,555 INFO L290 TraceCheckUtils]: 1,246: Hoare triple {39085#(<= ~counter~0 45)} ~cond := #in~cond; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,556 INFO L290 TraceCheckUtils]: 1,247: Hoare triple {39085#(<= ~counter~0 45)} assume !(0 == ~cond); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,556 INFO L290 TraceCheckUtils]: 1,248: Hoare triple {39085#(<= ~counter~0 45)} assume true; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,556 INFO L284 TraceCheckUtils]: 1,249: Hoare quadruple {39085#(<= ~counter~0 45)} {39085#(<= ~counter~0 45)} #61#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,557 INFO L272 TraceCheckUtils]: 1,250: Hoare triple {39085#(<= ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,557 INFO L290 TraceCheckUtils]: 1,251: Hoare triple {39085#(<= ~counter~0 45)} ~cond := #in~cond; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,557 INFO L290 TraceCheckUtils]: 1,252: Hoare triple {39085#(<= ~counter~0 45)} assume !(0 == ~cond); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,558 INFO L290 TraceCheckUtils]: 1,253: Hoare triple {39085#(<= ~counter~0 45)} assume true; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,558 INFO L284 TraceCheckUtils]: 1,254: Hoare quadruple {39085#(<= ~counter~0 45)} {39085#(<= ~counter~0 45)} #63#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,559 INFO L272 TraceCheckUtils]: 1,255: Hoare triple {39085#(<= ~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)); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,560 INFO L290 TraceCheckUtils]: 1,256: Hoare triple {39085#(<= ~counter~0 45)} ~cond := #in~cond; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,560 INFO L290 TraceCheckUtils]: 1,257: Hoare triple {39085#(<= ~counter~0 45)} assume !(0 == ~cond); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,560 INFO L290 TraceCheckUtils]: 1,258: Hoare triple {39085#(<= ~counter~0 45)} assume true; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,561 INFO L284 TraceCheckUtils]: 1,259: Hoare quadruple {39085#(<= ~counter~0 45)} {39085#(<= ~counter~0 45)} #65#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,561 INFO L272 TraceCheckUtils]: 1,260: Hoare triple {39085#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,562 INFO L290 TraceCheckUtils]: 1,261: Hoare triple {39085#(<= ~counter~0 45)} ~cond := #in~cond; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,562 INFO L290 TraceCheckUtils]: 1,262: Hoare triple {39085#(<= ~counter~0 45)} assume !(0 == ~cond); {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,562 INFO L290 TraceCheckUtils]: 1,263: Hoare triple {39085#(<= ~counter~0 45)} assume true; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,563 INFO L284 TraceCheckUtils]: 1,264: Hoare quadruple {39085#(<= ~counter~0 45)} {39085#(<= ~counter~0 45)} #67#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,563 INFO L290 TraceCheckUtils]: 1,265: Hoare triple {39085#(<= ~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; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:47,564 INFO L290 TraceCheckUtils]: 1,266: Hoare triple {39085#(<= ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,564 INFO L290 TraceCheckUtils]: 1,267: Hoare triple {39170#(<= ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,565 INFO L272 TraceCheckUtils]: 1,268: Hoare triple {39170#(<= ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,565 INFO L290 TraceCheckUtils]: 1,269: Hoare triple {39170#(<= ~counter~0 46)} ~cond := #in~cond; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,565 INFO L290 TraceCheckUtils]: 1,270: Hoare triple {39170#(<= ~counter~0 46)} assume !(0 == ~cond); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,566 INFO L290 TraceCheckUtils]: 1,271: Hoare triple {39170#(<= ~counter~0 46)} assume true; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,566 INFO L284 TraceCheckUtils]: 1,272: Hoare quadruple {39170#(<= ~counter~0 46)} {39170#(<= ~counter~0 46)} #59#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,567 INFO L272 TraceCheckUtils]: 1,273: Hoare triple {39170#(<= ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,567 INFO L290 TraceCheckUtils]: 1,274: Hoare triple {39170#(<= ~counter~0 46)} ~cond := #in~cond; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,567 INFO L290 TraceCheckUtils]: 1,275: Hoare triple {39170#(<= ~counter~0 46)} assume !(0 == ~cond); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,567 INFO L290 TraceCheckUtils]: 1,276: Hoare triple {39170#(<= ~counter~0 46)} assume true; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,568 INFO L284 TraceCheckUtils]: 1,277: Hoare quadruple {39170#(<= ~counter~0 46)} {39170#(<= ~counter~0 46)} #61#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,568 INFO L272 TraceCheckUtils]: 1,278: Hoare triple {39170#(<= ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,569 INFO L290 TraceCheckUtils]: 1,279: Hoare triple {39170#(<= ~counter~0 46)} ~cond := #in~cond; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,569 INFO L290 TraceCheckUtils]: 1,280: Hoare triple {39170#(<= ~counter~0 46)} assume !(0 == ~cond); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,569 INFO L290 TraceCheckUtils]: 1,281: Hoare triple {39170#(<= ~counter~0 46)} assume true; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,570 INFO L284 TraceCheckUtils]: 1,282: Hoare quadruple {39170#(<= ~counter~0 46)} {39170#(<= ~counter~0 46)} #63#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,570 INFO L272 TraceCheckUtils]: 1,283: Hoare triple {39170#(<= ~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)); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,571 INFO L290 TraceCheckUtils]: 1,284: Hoare triple {39170#(<= ~counter~0 46)} ~cond := #in~cond; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,571 INFO L290 TraceCheckUtils]: 1,285: Hoare triple {39170#(<= ~counter~0 46)} assume !(0 == ~cond); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,571 INFO L290 TraceCheckUtils]: 1,286: Hoare triple {39170#(<= ~counter~0 46)} assume true; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,572 INFO L284 TraceCheckUtils]: 1,287: Hoare quadruple {39170#(<= ~counter~0 46)} {39170#(<= ~counter~0 46)} #65#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,572 INFO L272 TraceCheckUtils]: 1,288: Hoare triple {39170#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,572 INFO L290 TraceCheckUtils]: 1,289: Hoare triple {39170#(<= ~counter~0 46)} ~cond := #in~cond; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,573 INFO L290 TraceCheckUtils]: 1,290: Hoare triple {39170#(<= ~counter~0 46)} assume !(0 == ~cond); {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,573 INFO L290 TraceCheckUtils]: 1,291: Hoare triple {39170#(<= ~counter~0 46)} assume true; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,573 INFO L284 TraceCheckUtils]: 1,292: Hoare quadruple {39170#(<= ~counter~0 46)} {39170#(<= ~counter~0 46)} #67#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,574 INFO L290 TraceCheckUtils]: 1,293: Hoare triple {39170#(<= ~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; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:47,574 INFO L290 TraceCheckUtils]: 1,294: Hoare triple {39170#(<= ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39255#(<= |main_#t~post5| 46)} is VALID [2022-04-07 13:06:47,575 INFO L290 TraceCheckUtils]: 1,295: Hoare triple {39255#(<= |main_#t~post5| 46)} assume !(#t~post5 < 50);havoc #t~post5; {35322#false} is VALID [2022-04-07 13:06:47,575 INFO L272 TraceCheckUtils]: 1,296: Hoare triple {35322#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35322#false} is VALID [2022-04-07 13:06:47,575 INFO L290 TraceCheckUtils]: 1,297: Hoare triple {35322#false} ~cond := #in~cond; {35322#false} is VALID [2022-04-07 13:06:47,575 INFO L290 TraceCheckUtils]: 1,298: Hoare triple {35322#false} assume !(0 == ~cond); {35322#false} is VALID [2022-04-07 13:06:47,575 INFO L290 TraceCheckUtils]: 1,299: Hoare triple {35322#false} assume true; {35322#false} is VALID [2022-04-07 13:06:47,575 INFO L284 TraceCheckUtils]: 1,300: Hoare quadruple {35322#false} {35322#false} #69#return; {35322#false} is VALID [2022-04-07 13:06:47,575 INFO L272 TraceCheckUtils]: 1,301: Hoare triple {35322#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {35322#false} is VALID [2022-04-07 13:06:47,575 INFO L290 TraceCheckUtils]: 1,302: Hoare triple {35322#false} ~cond := #in~cond; {35322#false} is VALID [2022-04-07 13:06:47,575 INFO L290 TraceCheckUtils]: 1,303: Hoare triple {35322#false} assume 0 == ~cond; {35322#false} is VALID [2022-04-07 13:06:47,575 INFO L290 TraceCheckUtils]: 1,304: Hoare triple {35322#false} assume !false; {35322#false} is VALID [2022-04-07 13:06:47,587 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-07 13:06:47,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:06:52,062 INFO L290 TraceCheckUtils]: 1,304: Hoare triple {35322#false} assume !false; {35322#false} is VALID [2022-04-07 13:06:52,062 INFO L290 TraceCheckUtils]: 1,303: Hoare triple {35322#false} assume 0 == ~cond; {35322#false} is VALID [2022-04-07 13:06:52,062 INFO L290 TraceCheckUtils]: 1,302: Hoare triple {35322#false} ~cond := #in~cond; {35322#false} is VALID [2022-04-07 13:06:52,062 INFO L272 TraceCheckUtils]: 1,301: Hoare triple {35322#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {35322#false} is VALID [2022-04-07 13:06:52,062 INFO L284 TraceCheckUtils]: 1,300: Hoare quadruple {35321#true} {35322#false} #69#return; {35322#false} is VALID [2022-04-07 13:06:52,063 INFO L290 TraceCheckUtils]: 1,299: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,063 INFO L290 TraceCheckUtils]: 1,298: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,063 INFO L290 TraceCheckUtils]: 1,297: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,063 INFO L272 TraceCheckUtils]: 1,296: Hoare triple {35322#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,063 INFO L290 TraceCheckUtils]: 1,295: Hoare triple {39313#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {35322#false} is VALID [2022-04-07 13:06:52,063 INFO L290 TraceCheckUtils]: 1,294: Hoare triple {39317#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39313#(< |main_#t~post5| 50)} is VALID [2022-04-07 13:06:52,064 INFO L290 TraceCheckUtils]: 1,293: Hoare triple {39317#(< ~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; {39317#(< ~counter~0 50)} is VALID [2022-04-07 13:06:52,064 INFO L284 TraceCheckUtils]: 1,292: Hoare quadruple {35321#true} {39317#(< ~counter~0 50)} #67#return; {39317#(< ~counter~0 50)} is VALID [2022-04-07 13:06:52,064 INFO L290 TraceCheckUtils]: 1,291: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,064 INFO L290 TraceCheckUtils]: 1,290: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,064 INFO L290 TraceCheckUtils]: 1,289: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,064 INFO L272 TraceCheckUtils]: 1,288: Hoare triple {39317#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,065 INFO L284 TraceCheckUtils]: 1,287: Hoare quadruple {35321#true} {39317#(< ~counter~0 50)} #65#return; {39317#(< ~counter~0 50)} is VALID [2022-04-07 13:06:52,065 INFO L290 TraceCheckUtils]: 1,286: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,065 INFO L290 TraceCheckUtils]: 1,285: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,065 INFO L290 TraceCheckUtils]: 1,284: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,065 INFO L272 TraceCheckUtils]: 1,283: Hoare triple {39317#(< ~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)); {35321#true} is VALID [2022-04-07 13:06:52,065 INFO L284 TraceCheckUtils]: 1,282: Hoare quadruple {35321#true} {39317#(< ~counter~0 50)} #63#return; {39317#(< ~counter~0 50)} is VALID [2022-04-07 13:06:52,065 INFO L290 TraceCheckUtils]: 1,281: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,065 INFO L290 TraceCheckUtils]: 1,280: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,066 INFO L290 TraceCheckUtils]: 1,279: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,066 INFO L272 TraceCheckUtils]: 1,278: Hoare triple {39317#(< ~counter~0 50)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,066 INFO L284 TraceCheckUtils]: 1,277: Hoare quadruple {35321#true} {39317#(< ~counter~0 50)} #61#return; {39317#(< ~counter~0 50)} is VALID [2022-04-07 13:06:52,066 INFO L290 TraceCheckUtils]: 1,276: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,066 INFO L290 TraceCheckUtils]: 1,275: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,066 INFO L290 TraceCheckUtils]: 1,274: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,066 INFO L272 TraceCheckUtils]: 1,273: Hoare triple {39317#(< ~counter~0 50)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,071 INFO L284 TraceCheckUtils]: 1,272: Hoare quadruple {35321#true} {39317#(< ~counter~0 50)} #59#return; {39317#(< ~counter~0 50)} is VALID [2022-04-07 13:06:52,072 INFO L290 TraceCheckUtils]: 1,271: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,072 INFO L290 TraceCheckUtils]: 1,270: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,072 INFO L290 TraceCheckUtils]: 1,269: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,072 INFO L272 TraceCheckUtils]: 1,268: Hoare triple {39317#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,072 INFO L290 TraceCheckUtils]: 1,267: Hoare triple {39317#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {39317#(< ~counter~0 50)} is VALID [2022-04-07 13:06:52,074 INFO L290 TraceCheckUtils]: 1,266: Hoare triple {39402#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39317#(< ~counter~0 50)} is VALID [2022-04-07 13:06:52,074 INFO L290 TraceCheckUtils]: 1,265: Hoare triple {39402#(< ~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; {39402#(< ~counter~0 49)} is VALID [2022-04-07 13:06:52,075 INFO L284 TraceCheckUtils]: 1,264: Hoare quadruple {35321#true} {39402#(< ~counter~0 49)} #67#return; {39402#(< ~counter~0 49)} is VALID [2022-04-07 13:06:52,075 INFO L290 TraceCheckUtils]: 1,263: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,075 INFO L290 TraceCheckUtils]: 1,262: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,075 INFO L290 TraceCheckUtils]: 1,261: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,075 INFO L272 TraceCheckUtils]: 1,260: Hoare triple {39402#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,075 INFO L284 TraceCheckUtils]: 1,259: Hoare quadruple {35321#true} {39402#(< ~counter~0 49)} #65#return; {39402#(< ~counter~0 49)} is VALID [2022-04-07 13:06:52,076 INFO L290 TraceCheckUtils]: 1,258: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,076 INFO L290 TraceCheckUtils]: 1,257: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,076 INFO L290 TraceCheckUtils]: 1,256: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,076 INFO L272 TraceCheckUtils]: 1,255: Hoare triple {39402#(< ~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)); {35321#true} is VALID [2022-04-07 13:06:52,076 INFO L284 TraceCheckUtils]: 1,254: Hoare quadruple {35321#true} {39402#(< ~counter~0 49)} #63#return; {39402#(< ~counter~0 49)} is VALID [2022-04-07 13:06:52,076 INFO L290 TraceCheckUtils]: 1,253: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,077 INFO L290 TraceCheckUtils]: 1,252: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,077 INFO L290 TraceCheckUtils]: 1,251: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,077 INFO L272 TraceCheckUtils]: 1,250: Hoare triple {39402#(< ~counter~0 49)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,077 INFO L284 TraceCheckUtils]: 1,249: Hoare quadruple {35321#true} {39402#(< ~counter~0 49)} #61#return; {39402#(< ~counter~0 49)} is VALID [2022-04-07 13:06:52,077 INFO L290 TraceCheckUtils]: 1,248: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,077 INFO L290 TraceCheckUtils]: 1,247: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,078 INFO L290 TraceCheckUtils]: 1,246: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,078 INFO L272 TraceCheckUtils]: 1,245: Hoare triple {39402#(< ~counter~0 49)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,078 INFO L284 TraceCheckUtils]: 1,244: Hoare quadruple {35321#true} {39402#(< ~counter~0 49)} #59#return; {39402#(< ~counter~0 49)} is VALID [2022-04-07 13:06:52,078 INFO L290 TraceCheckUtils]: 1,243: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,078 INFO L290 TraceCheckUtils]: 1,242: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,078 INFO L290 TraceCheckUtils]: 1,241: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,078 INFO L272 TraceCheckUtils]: 1,240: Hoare triple {39402#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,079 INFO L290 TraceCheckUtils]: 1,239: Hoare triple {39402#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {39402#(< ~counter~0 49)} is VALID [2022-04-07 13:06:52,080 INFO L290 TraceCheckUtils]: 1,238: Hoare triple {39487#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39402#(< ~counter~0 49)} is VALID [2022-04-07 13:06:52,080 INFO L290 TraceCheckUtils]: 1,237: Hoare triple {39487#(< ~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; {39487#(< ~counter~0 48)} is VALID [2022-04-07 13:06:52,081 INFO L284 TraceCheckUtils]: 1,236: Hoare quadruple {35321#true} {39487#(< ~counter~0 48)} #67#return; {39487#(< ~counter~0 48)} is VALID [2022-04-07 13:06:52,081 INFO L290 TraceCheckUtils]: 1,235: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,081 INFO L290 TraceCheckUtils]: 1,234: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,081 INFO L290 TraceCheckUtils]: 1,233: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,081 INFO L272 TraceCheckUtils]: 1,232: Hoare triple {39487#(< ~counter~0 48)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,082 INFO L284 TraceCheckUtils]: 1,231: Hoare quadruple {35321#true} {39487#(< ~counter~0 48)} #65#return; {39487#(< ~counter~0 48)} is VALID [2022-04-07 13:06:52,082 INFO L290 TraceCheckUtils]: 1,230: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,082 INFO L290 TraceCheckUtils]: 1,229: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,082 INFO L290 TraceCheckUtils]: 1,228: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,082 INFO L272 TraceCheckUtils]: 1,227: Hoare triple {39487#(< ~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)); {35321#true} is VALID [2022-04-07 13:06:52,083 INFO L284 TraceCheckUtils]: 1,226: Hoare quadruple {35321#true} {39487#(< ~counter~0 48)} #63#return; {39487#(< ~counter~0 48)} is VALID [2022-04-07 13:06:52,083 INFO L290 TraceCheckUtils]: 1,225: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,083 INFO L290 TraceCheckUtils]: 1,224: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,083 INFO L290 TraceCheckUtils]: 1,223: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,083 INFO L272 TraceCheckUtils]: 1,222: Hoare triple {39487#(< ~counter~0 48)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,084 INFO L284 TraceCheckUtils]: 1,221: Hoare quadruple {35321#true} {39487#(< ~counter~0 48)} #61#return; {39487#(< ~counter~0 48)} is VALID [2022-04-07 13:06:52,084 INFO L290 TraceCheckUtils]: 1,220: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,084 INFO L290 TraceCheckUtils]: 1,219: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,084 INFO L290 TraceCheckUtils]: 1,218: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,084 INFO L272 TraceCheckUtils]: 1,217: Hoare triple {39487#(< ~counter~0 48)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,084 INFO L284 TraceCheckUtils]: 1,216: Hoare quadruple {35321#true} {39487#(< ~counter~0 48)} #59#return; {39487#(< ~counter~0 48)} is VALID [2022-04-07 13:06:52,084 INFO L290 TraceCheckUtils]: 1,215: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,085 INFO L290 TraceCheckUtils]: 1,214: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,085 INFO L290 TraceCheckUtils]: 1,213: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,085 INFO L272 TraceCheckUtils]: 1,212: Hoare triple {39487#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,085 INFO L290 TraceCheckUtils]: 1,211: Hoare triple {39487#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {39487#(< ~counter~0 48)} is VALID [2022-04-07 13:06:52,086 INFO L290 TraceCheckUtils]: 1,210: Hoare triple {39170#(<= ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39487#(< ~counter~0 48)} is VALID [2022-04-07 13:06:52,086 INFO L290 TraceCheckUtils]: 1,209: Hoare triple {39170#(<= ~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; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:52,087 INFO L284 TraceCheckUtils]: 1,208: Hoare quadruple {35321#true} {39170#(<= ~counter~0 46)} #67#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:52,087 INFO L290 TraceCheckUtils]: 1,207: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,087 INFO L290 TraceCheckUtils]: 1,206: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,087 INFO L290 TraceCheckUtils]: 1,205: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,087 INFO L272 TraceCheckUtils]: 1,204: Hoare triple {39170#(<= ~counter~0 46)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,088 INFO L284 TraceCheckUtils]: 1,203: Hoare quadruple {35321#true} {39170#(<= ~counter~0 46)} #65#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:52,088 INFO L290 TraceCheckUtils]: 1,202: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,088 INFO L290 TraceCheckUtils]: 1,201: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,088 INFO L290 TraceCheckUtils]: 1,200: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,088 INFO L272 TraceCheckUtils]: 1,199: Hoare triple {39170#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,089 INFO L284 TraceCheckUtils]: 1,198: Hoare quadruple {35321#true} {39170#(<= ~counter~0 46)} #63#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:52,089 INFO L290 TraceCheckUtils]: 1,197: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,089 INFO L290 TraceCheckUtils]: 1,196: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,089 INFO L290 TraceCheckUtils]: 1,195: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,089 INFO L272 TraceCheckUtils]: 1,194: Hoare triple {39170#(<= ~counter~0 46)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,090 INFO L284 TraceCheckUtils]: 1,193: Hoare quadruple {35321#true} {39170#(<= ~counter~0 46)} #61#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:52,090 INFO L290 TraceCheckUtils]: 1,192: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,090 INFO L290 TraceCheckUtils]: 1,191: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,090 INFO L290 TraceCheckUtils]: 1,190: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,090 INFO L272 TraceCheckUtils]: 1,189: Hoare triple {39170#(<= ~counter~0 46)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,090 INFO L284 TraceCheckUtils]: 1,188: Hoare quadruple {35321#true} {39170#(<= ~counter~0 46)} #59#return; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:52,090 INFO L290 TraceCheckUtils]: 1,187: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,090 INFO L290 TraceCheckUtils]: 1,186: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,090 INFO L290 TraceCheckUtils]: 1,185: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,090 INFO L272 TraceCheckUtils]: 1,184: Hoare triple {39170#(<= ~counter~0 46)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,091 INFO L290 TraceCheckUtils]: 1,183: Hoare triple {39170#(<= ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:52,092 INFO L290 TraceCheckUtils]: 1,182: Hoare triple {39085#(<= ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39170#(<= ~counter~0 46)} is VALID [2022-04-07 13:06:52,092 INFO L290 TraceCheckUtils]: 1,181: Hoare triple {39085#(<= ~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; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:52,092 INFO L284 TraceCheckUtils]: 1,180: Hoare quadruple {35321#true} {39085#(<= ~counter~0 45)} #67#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:52,093 INFO L290 TraceCheckUtils]: 1,179: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,093 INFO L290 TraceCheckUtils]: 1,178: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,093 INFO L290 TraceCheckUtils]: 1,177: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,093 INFO L272 TraceCheckUtils]: 1,176: Hoare triple {39085#(<= ~counter~0 45)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,093 INFO L284 TraceCheckUtils]: 1,175: Hoare quadruple {35321#true} {39085#(<= ~counter~0 45)} #65#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:52,093 INFO L290 TraceCheckUtils]: 1,174: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,093 INFO L290 TraceCheckUtils]: 1,173: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,093 INFO L290 TraceCheckUtils]: 1,172: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,093 INFO L272 TraceCheckUtils]: 1,171: Hoare triple {39085#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,094 INFO L284 TraceCheckUtils]: 1,170: Hoare quadruple {35321#true} {39085#(<= ~counter~0 45)} #63#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:52,094 INFO L290 TraceCheckUtils]: 1,169: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,094 INFO L290 TraceCheckUtils]: 1,168: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,094 INFO L290 TraceCheckUtils]: 1,167: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,094 INFO L272 TraceCheckUtils]: 1,166: Hoare triple {39085#(<= ~counter~0 45)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,094 INFO L284 TraceCheckUtils]: 1,165: Hoare quadruple {35321#true} {39085#(<= ~counter~0 45)} #61#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:52,095 INFO L290 TraceCheckUtils]: 1,164: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,095 INFO L290 TraceCheckUtils]: 1,163: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,095 INFO L290 TraceCheckUtils]: 1,162: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,095 INFO L272 TraceCheckUtils]: 1,161: Hoare triple {39085#(<= ~counter~0 45)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,095 INFO L284 TraceCheckUtils]: 1,160: Hoare quadruple {35321#true} {39085#(<= ~counter~0 45)} #59#return; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:52,095 INFO L290 TraceCheckUtils]: 1,159: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,095 INFO L290 TraceCheckUtils]: 1,158: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,095 INFO L290 TraceCheckUtils]: 1,157: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,095 INFO L272 TraceCheckUtils]: 1,156: Hoare triple {39085#(<= ~counter~0 45)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,096 INFO L290 TraceCheckUtils]: 1,155: Hoare triple {39085#(<= ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:52,097 INFO L290 TraceCheckUtils]: 1,154: Hoare triple {39000#(<= ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39085#(<= ~counter~0 45)} is VALID [2022-04-07 13:06:52,097 INFO L290 TraceCheckUtils]: 1,153: Hoare triple {39000#(<= ~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; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:52,097 INFO L284 TraceCheckUtils]: 1,152: Hoare quadruple {35321#true} {39000#(<= ~counter~0 44)} #67#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:52,097 INFO L290 TraceCheckUtils]: 1,151: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,097 INFO L290 TraceCheckUtils]: 1,150: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,097 INFO L290 TraceCheckUtils]: 1,149: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,098 INFO L272 TraceCheckUtils]: 1,148: Hoare triple {39000#(<= ~counter~0 44)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,098 INFO L284 TraceCheckUtils]: 1,147: Hoare quadruple {35321#true} {39000#(<= ~counter~0 44)} #65#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:52,098 INFO L290 TraceCheckUtils]: 1,146: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,098 INFO L290 TraceCheckUtils]: 1,145: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,098 INFO L290 TraceCheckUtils]: 1,144: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,098 INFO L272 TraceCheckUtils]: 1,143: Hoare triple {39000#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,099 INFO L284 TraceCheckUtils]: 1,142: Hoare quadruple {35321#true} {39000#(<= ~counter~0 44)} #63#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:52,099 INFO L290 TraceCheckUtils]: 1,141: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,099 INFO L290 TraceCheckUtils]: 1,140: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,099 INFO L290 TraceCheckUtils]: 1,139: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,099 INFO L272 TraceCheckUtils]: 1,138: Hoare triple {39000#(<= ~counter~0 44)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,099 INFO L284 TraceCheckUtils]: 1,137: Hoare quadruple {35321#true} {39000#(<= ~counter~0 44)} #61#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:52,099 INFO L290 TraceCheckUtils]: 1,136: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,099 INFO L290 TraceCheckUtils]: 1,135: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,099 INFO L290 TraceCheckUtils]: 1,134: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,099 INFO L272 TraceCheckUtils]: 1,133: Hoare triple {39000#(<= ~counter~0 44)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,100 INFO L284 TraceCheckUtils]: 1,132: Hoare quadruple {35321#true} {39000#(<= ~counter~0 44)} #59#return; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:52,100 INFO L290 TraceCheckUtils]: 1,131: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,100 INFO L290 TraceCheckUtils]: 1,130: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,100 INFO L290 TraceCheckUtils]: 1,129: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,100 INFO L272 TraceCheckUtils]: 1,128: Hoare triple {39000#(<= ~counter~0 44)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,100 INFO L290 TraceCheckUtils]: 1,127: Hoare triple {39000#(<= ~counter~0 44)} assume !!(#t~post5 < 50);havoc #t~post5; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:52,101 INFO L290 TraceCheckUtils]: 1,126: Hoare triple {38915#(<= ~counter~0 43)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {39000#(<= ~counter~0 44)} is VALID [2022-04-07 13:06:52,102 INFO L290 TraceCheckUtils]: 1,125: Hoare triple {38915#(<= ~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; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:52,102 INFO L284 TraceCheckUtils]: 1,124: Hoare quadruple {35321#true} {38915#(<= ~counter~0 43)} #67#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:52,102 INFO L290 TraceCheckUtils]: 1,123: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,102 INFO L290 TraceCheckUtils]: 1,122: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,102 INFO L290 TraceCheckUtils]: 1,121: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,102 INFO L272 TraceCheckUtils]: 1,120: Hoare triple {38915#(<= ~counter~0 43)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,103 INFO L284 TraceCheckUtils]: 1,119: Hoare quadruple {35321#true} {38915#(<= ~counter~0 43)} #65#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:52,103 INFO L290 TraceCheckUtils]: 1,118: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,103 INFO L290 TraceCheckUtils]: 1,117: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,103 INFO L290 TraceCheckUtils]: 1,116: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,103 INFO L272 TraceCheckUtils]: 1,115: Hoare triple {38915#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,103 INFO L284 TraceCheckUtils]: 1,114: Hoare quadruple {35321#true} {38915#(<= ~counter~0 43)} #63#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:52,103 INFO L290 TraceCheckUtils]: 1,113: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,104 INFO L290 TraceCheckUtils]: 1,112: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,104 INFO L290 TraceCheckUtils]: 1,111: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,104 INFO L272 TraceCheckUtils]: 1,110: Hoare triple {38915#(<= ~counter~0 43)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,104 INFO L284 TraceCheckUtils]: 1,109: Hoare quadruple {35321#true} {38915#(<= ~counter~0 43)} #61#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:52,104 INFO L290 TraceCheckUtils]: 1,108: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,104 INFO L290 TraceCheckUtils]: 1,107: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,104 INFO L290 TraceCheckUtils]: 1,106: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,104 INFO L272 TraceCheckUtils]: 1,105: Hoare triple {38915#(<= ~counter~0 43)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,105 INFO L284 TraceCheckUtils]: 1,104: Hoare quadruple {35321#true} {38915#(<= ~counter~0 43)} #59#return; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:52,105 INFO L290 TraceCheckUtils]: 1,103: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,105 INFO L290 TraceCheckUtils]: 1,102: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,105 INFO L290 TraceCheckUtils]: 1,101: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,105 INFO L272 TraceCheckUtils]: 1,100: Hoare triple {38915#(<= ~counter~0 43)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,105 INFO L290 TraceCheckUtils]: 1,099: Hoare triple {38915#(<= ~counter~0 43)} assume !!(#t~post5 < 50);havoc #t~post5; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:52,106 INFO L290 TraceCheckUtils]: 1,098: Hoare triple {38830#(<= ~counter~0 42)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38915#(<= ~counter~0 43)} is VALID [2022-04-07 13:06:52,106 INFO L290 TraceCheckUtils]: 1,097: Hoare triple {38830#(<= ~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; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:52,107 INFO L284 TraceCheckUtils]: 1,096: Hoare quadruple {35321#true} {38830#(<= ~counter~0 42)} #67#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:52,107 INFO L290 TraceCheckUtils]: 1,095: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,107 INFO L290 TraceCheckUtils]: 1,094: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,107 INFO L290 TraceCheckUtils]: 1,093: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,107 INFO L272 TraceCheckUtils]: 1,092: Hoare triple {38830#(<= ~counter~0 42)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,107 INFO L284 TraceCheckUtils]: 1,091: Hoare quadruple {35321#true} {38830#(<= ~counter~0 42)} #65#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:52,107 INFO L290 TraceCheckUtils]: 1,090: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,108 INFO L290 TraceCheckUtils]: 1,089: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,108 INFO L290 TraceCheckUtils]: 1,088: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,108 INFO L272 TraceCheckUtils]: 1,087: Hoare triple {38830#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,108 INFO L284 TraceCheckUtils]: 1,086: Hoare quadruple {35321#true} {38830#(<= ~counter~0 42)} #63#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:52,108 INFO L290 TraceCheckUtils]: 1,085: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,108 INFO L290 TraceCheckUtils]: 1,084: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,108 INFO L290 TraceCheckUtils]: 1,083: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,108 INFO L272 TraceCheckUtils]: 1,082: Hoare triple {38830#(<= ~counter~0 42)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,109 INFO L284 TraceCheckUtils]: 1,081: Hoare quadruple {35321#true} {38830#(<= ~counter~0 42)} #61#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:52,109 INFO L290 TraceCheckUtils]: 1,080: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,109 INFO L290 TraceCheckUtils]: 1,079: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,109 INFO L290 TraceCheckUtils]: 1,078: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,109 INFO L272 TraceCheckUtils]: 1,077: Hoare triple {38830#(<= ~counter~0 42)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,109 INFO L284 TraceCheckUtils]: 1,076: Hoare quadruple {35321#true} {38830#(<= ~counter~0 42)} #59#return; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:52,109 INFO L290 TraceCheckUtils]: 1,075: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,109 INFO L290 TraceCheckUtils]: 1,074: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,109 INFO L290 TraceCheckUtils]: 1,073: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,110 INFO L272 TraceCheckUtils]: 1,072: Hoare triple {38830#(<= ~counter~0 42)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,110 INFO L290 TraceCheckUtils]: 1,071: Hoare triple {38830#(<= ~counter~0 42)} assume !!(#t~post5 < 50);havoc #t~post5; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:52,111 INFO L290 TraceCheckUtils]: 1,070: Hoare triple {38745#(<= ~counter~0 41)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38830#(<= ~counter~0 42)} is VALID [2022-04-07 13:06:52,111 INFO L290 TraceCheckUtils]: 1,069: Hoare triple {38745#(<= ~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; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:52,111 INFO L284 TraceCheckUtils]: 1,068: Hoare quadruple {35321#true} {38745#(<= ~counter~0 41)} #67#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:52,111 INFO L290 TraceCheckUtils]: 1,067: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,112 INFO L290 TraceCheckUtils]: 1,066: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,112 INFO L290 TraceCheckUtils]: 1,065: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,112 INFO L272 TraceCheckUtils]: 1,064: Hoare triple {38745#(<= ~counter~0 41)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,112 INFO L284 TraceCheckUtils]: 1,063: Hoare quadruple {35321#true} {38745#(<= ~counter~0 41)} #65#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:52,112 INFO L290 TraceCheckUtils]: 1,062: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,112 INFO L290 TraceCheckUtils]: 1,061: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,112 INFO L290 TraceCheckUtils]: 1,060: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,112 INFO L272 TraceCheckUtils]: 1,059: Hoare triple {38745#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,113 INFO L284 TraceCheckUtils]: 1,058: Hoare quadruple {35321#true} {38745#(<= ~counter~0 41)} #63#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:52,113 INFO L290 TraceCheckUtils]: 1,057: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,113 INFO L290 TraceCheckUtils]: 1,056: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,113 INFO L290 TraceCheckUtils]: 1,055: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,113 INFO L272 TraceCheckUtils]: 1,054: Hoare triple {38745#(<= ~counter~0 41)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,113 INFO L284 TraceCheckUtils]: 1,053: Hoare quadruple {35321#true} {38745#(<= ~counter~0 41)} #61#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:52,113 INFO L290 TraceCheckUtils]: 1,052: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,114 INFO L290 TraceCheckUtils]: 1,051: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,114 INFO L290 TraceCheckUtils]: 1,050: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,114 INFO L272 TraceCheckUtils]: 1,049: Hoare triple {38745#(<= ~counter~0 41)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,114 INFO L284 TraceCheckUtils]: 1,048: Hoare quadruple {35321#true} {38745#(<= ~counter~0 41)} #59#return; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:52,114 INFO L290 TraceCheckUtils]: 1,047: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,114 INFO L290 TraceCheckUtils]: 1,046: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,114 INFO L290 TraceCheckUtils]: 1,045: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,114 INFO L272 TraceCheckUtils]: 1,044: Hoare triple {38745#(<= ~counter~0 41)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,115 INFO L290 TraceCheckUtils]: 1,043: Hoare triple {38745#(<= ~counter~0 41)} assume !!(#t~post5 < 50);havoc #t~post5; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:52,116 INFO L290 TraceCheckUtils]: 1,042: Hoare triple {38660#(<= ~counter~0 40)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38745#(<= ~counter~0 41)} is VALID [2022-04-07 13:06:52,116 INFO L290 TraceCheckUtils]: 1,041: Hoare triple {38660#(<= ~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; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:52,116 INFO L284 TraceCheckUtils]: 1,040: Hoare quadruple {35321#true} {38660#(<= ~counter~0 40)} #67#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:52,116 INFO L290 TraceCheckUtils]: 1,039: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,116 INFO L290 TraceCheckUtils]: 1,038: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,116 INFO L290 TraceCheckUtils]: 1,037: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,116 INFO L272 TraceCheckUtils]: 1,036: Hoare triple {38660#(<= ~counter~0 40)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,117 INFO L284 TraceCheckUtils]: 1,035: Hoare quadruple {35321#true} {38660#(<= ~counter~0 40)} #65#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:52,117 INFO L290 TraceCheckUtils]: 1,034: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,117 INFO L290 TraceCheckUtils]: 1,033: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,117 INFO L290 TraceCheckUtils]: 1,032: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,117 INFO L272 TraceCheckUtils]: 1,031: Hoare triple {38660#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,118 INFO L284 TraceCheckUtils]: 1,030: Hoare quadruple {35321#true} {38660#(<= ~counter~0 40)} #63#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:52,118 INFO L290 TraceCheckUtils]: 1,029: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,118 INFO L290 TraceCheckUtils]: 1,028: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,118 INFO L290 TraceCheckUtils]: 1,027: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,118 INFO L272 TraceCheckUtils]: 1,026: Hoare triple {38660#(<= ~counter~0 40)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,118 INFO L284 TraceCheckUtils]: 1,025: Hoare quadruple {35321#true} {38660#(<= ~counter~0 40)} #61#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:52,118 INFO L290 TraceCheckUtils]: 1,024: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,118 INFO L290 TraceCheckUtils]: 1,023: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,118 INFO L290 TraceCheckUtils]: 1,022: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,118 INFO L272 TraceCheckUtils]: 1,021: Hoare triple {38660#(<= ~counter~0 40)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,119 INFO L284 TraceCheckUtils]: 1,020: Hoare quadruple {35321#true} {38660#(<= ~counter~0 40)} #59#return; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:52,119 INFO L290 TraceCheckUtils]: 1,019: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,119 INFO L290 TraceCheckUtils]: 1,018: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,119 INFO L290 TraceCheckUtils]: 1,017: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,119 INFO L272 TraceCheckUtils]: 1,016: Hoare triple {38660#(<= ~counter~0 40)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,119 INFO L290 TraceCheckUtils]: 1,015: Hoare triple {38660#(<= ~counter~0 40)} assume !!(#t~post5 < 50);havoc #t~post5; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:52,120 INFO L290 TraceCheckUtils]: 1,014: Hoare triple {38575#(<= ~counter~0 39)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38660#(<= ~counter~0 40)} is VALID [2022-04-07 13:06:52,121 INFO L290 TraceCheckUtils]: 1,013: Hoare triple {38575#(<= ~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; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:52,121 INFO L284 TraceCheckUtils]: 1,012: Hoare quadruple {35321#true} {38575#(<= ~counter~0 39)} #67#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:52,121 INFO L290 TraceCheckUtils]: 1,011: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,121 INFO L290 TraceCheckUtils]: 1,010: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,121 INFO L290 TraceCheckUtils]: 1,009: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,121 INFO L272 TraceCheckUtils]: 1,008: Hoare triple {38575#(<= ~counter~0 39)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,122 INFO L284 TraceCheckUtils]: 1,007: Hoare quadruple {35321#true} {38575#(<= ~counter~0 39)} #65#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:52,122 INFO L290 TraceCheckUtils]: 1,006: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,122 INFO L290 TraceCheckUtils]: 1,005: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,122 INFO L290 TraceCheckUtils]: 1,004: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,122 INFO L272 TraceCheckUtils]: 1,003: Hoare triple {38575#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,122 INFO L284 TraceCheckUtils]: 1,002: Hoare quadruple {35321#true} {38575#(<= ~counter~0 39)} #63#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:52,122 INFO L290 TraceCheckUtils]: 1,001: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,123 INFO L290 TraceCheckUtils]: 1,000: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,123 INFO L290 TraceCheckUtils]: 999: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,123 INFO L272 TraceCheckUtils]: 998: Hoare triple {38575#(<= ~counter~0 39)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,123 INFO L284 TraceCheckUtils]: 997: Hoare quadruple {35321#true} {38575#(<= ~counter~0 39)} #61#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:52,123 INFO L290 TraceCheckUtils]: 996: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,123 INFO L290 TraceCheckUtils]: 995: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,123 INFO L290 TraceCheckUtils]: 994: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,123 INFO L272 TraceCheckUtils]: 993: Hoare triple {38575#(<= ~counter~0 39)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,124 INFO L284 TraceCheckUtils]: 992: Hoare quadruple {35321#true} {38575#(<= ~counter~0 39)} #59#return; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:52,124 INFO L290 TraceCheckUtils]: 991: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,124 INFO L290 TraceCheckUtils]: 990: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,124 INFO L290 TraceCheckUtils]: 989: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,124 INFO L272 TraceCheckUtils]: 988: Hoare triple {38575#(<= ~counter~0 39)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,124 INFO L290 TraceCheckUtils]: 987: Hoare triple {38575#(<= ~counter~0 39)} assume !!(#t~post5 < 50);havoc #t~post5; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:52,125 INFO L290 TraceCheckUtils]: 986: Hoare triple {38490#(<= ~counter~0 38)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38575#(<= ~counter~0 39)} is VALID [2022-04-07 13:06:52,125 INFO L290 TraceCheckUtils]: 985: Hoare triple {38490#(<= ~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; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:52,126 INFO L284 TraceCheckUtils]: 984: Hoare quadruple {35321#true} {38490#(<= ~counter~0 38)} #67#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:52,126 INFO L290 TraceCheckUtils]: 983: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,126 INFO L290 TraceCheckUtils]: 982: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,126 INFO L290 TraceCheckUtils]: 981: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,126 INFO L272 TraceCheckUtils]: 980: Hoare triple {38490#(<= ~counter~0 38)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,126 INFO L284 TraceCheckUtils]: 979: Hoare quadruple {35321#true} {38490#(<= ~counter~0 38)} #65#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:52,127 INFO L290 TraceCheckUtils]: 978: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,127 INFO L290 TraceCheckUtils]: 977: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,127 INFO L290 TraceCheckUtils]: 976: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,127 INFO L272 TraceCheckUtils]: 975: Hoare triple {38490#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,127 INFO L284 TraceCheckUtils]: 974: Hoare quadruple {35321#true} {38490#(<= ~counter~0 38)} #63#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:52,127 INFO L290 TraceCheckUtils]: 973: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,127 INFO L290 TraceCheckUtils]: 972: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,127 INFO L290 TraceCheckUtils]: 971: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,127 INFO L272 TraceCheckUtils]: 970: Hoare triple {38490#(<= ~counter~0 38)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,128 INFO L284 TraceCheckUtils]: 969: Hoare quadruple {35321#true} {38490#(<= ~counter~0 38)} #61#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:52,128 INFO L290 TraceCheckUtils]: 968: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,128 INFO L290 TraceCheckUtils]: 967: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,128 INFO L290 TraceCheckUtils]: 966: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,128 INFO L272 TraceCheckUtils]: 965: Hoare triple {38490#(<= ~counter~0 38)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,128 INFO L284 TraceCheckUtils]: 964: Hoare quadruple {35321#true} {38490#(<= ~counter~0 38)} #59#return; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:52,129 INFO L290 TraceCheckUtils]: 963: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,129 INFO L290 TraceCheckUtils]: 962: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,129 INFO L290 TraceCheckUtils]: 961: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,129 INFO L272 TraceCheckUtils]: 960: Hoare triple {38490#(<= ~counter~0 38)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,129 INFO L290 TraceCheckUtils]: 959: Hoare triple {38490#(<= ~counter~0 38)} assume !!(#t~post5 < 50);havoc #t~post5; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:52,130 INFO L290 TraceCheckUtils]: 958: Hoare triple {38405#(<= ~counter~0 37)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38490#(<= ~counter~0 38)} is VALID [2022-04-07 13:06:52,130 INFO L290 TraceCheckUtils]: 957: Hoare triple {38405#(<= ~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; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:52,130 INFO L284 TraceCheckUtils]: 956: Hoare quadruple {35321#true} {38405#(<= ~counter~0 37)} #67#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:52,131 INFO L290 TraceCheckUtils]: 955: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,131 INFO L290 TraceCheckUtils]: 954: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,131 INFO L290 TraceCheckUtils]: 953: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,131 INFO L272 TraceCheckUtils]: 952: Hoare triple {38405#(<= ~counter~0 37)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,131 INFO L284 TraceCheckUtils]: 951: Hoare quadruple {35321#true} {38405#(<= ~counter~0 37)} #65#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:52,131 INFO L290 TraceCheckUtils]: 950: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,131 INFO L290 TraceCheckUtils]: 949: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,131 INFO L290 TraceCheckUtils]: 948: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,131 INFO L272 TraceCheckUtils]: 947: Hoare triple {38405#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,132 INFO L284 TraceCheckUtils]: 946: Hoare quadruple {35321#true} {38405#(<= ~counter~0 37)} #63#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:52,132 INFO L290 TraceCheckUtils]: 945: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,132 INFO L290 TraceCheckUtils]: 944: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,132 INFO L290 TraceCheckUtils]: 943: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,132 INFO L272 TraceCheckUtils]: 942: Hoare triple {38405#(<= ~counter~0 37)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,132 INFO L284 TraceCheckUtils]: 941: Hoare quadruple {35321#true} {38405#(<= ~counter~0 37)} #61#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:52,133 INFO L290 TraceCheckUtils]: 940: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,133 INFO L290 TraceCheckUtils]: 939: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,133 INFO L290 TraceCheckUtils]: 938: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,133 INFO L272 TraceCheckUtils]: 937: Hoare triple {38405#(<= ~counter~0 37)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,133 INFO L284 TraceCheckUtils]: 936: Hoare quadruple {35321#true} {38405#(<= ~counter~0 37)} #59#return; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:52,133 INFO L290 TraceCheckUtils]: 935: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,133 INFO L290 TraceCheckUtils]: 934: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,133 INFO L290 TraceCheckUtils]: 933: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,133 INFO L272 TraceCheckUtils]: 932: Hoare triple {38405#(<= ~counter~0 37)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,134 INFO L290 TraceCheckUtils]: 931: Hoare triple {38405#(<= ~counter~0 37)} assume !!(#t~post5 < 50);havoc #t~post5; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:52,134 INFO L290 TraceCheckUtils]: 930: Hoare triple {38320#(<= ~counter~0 36)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38405#(<= ~counter~0 37)} is VALID [2022-04-07 13:06:52,135 INFO L290 TraceCheckUtils]: 929: Hoare triple {38320#(<= ~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; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:52,135 INFO L284 TraceCheckUtils]: 928: Hoare quadruple {35321#true} {38320#(<= ~counter~0 36)} #67#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:52,135 INFO L290 TraceCheckUtils]: 927: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,135 INFO L290 TraceCheckUtils]: 926: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,135 INFO L290 TraceCheckUtils]: 925: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,135 INFO L272 TraceCheckUtils]: 924: Hoare triple {38320#(<= ~counter~0 36)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,136 INFO L284 TraceCheckUtils]: 923: Hoare quadruple {35321#true} {38320#(<= ~counter~0 36)} #65#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:52,136 INFO L290 TraceCheckUtils]: 922: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,136 INFO L290 TraceCheckUtils]: 921: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,136 INFO L290 TraceCheckUtils]: 920: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,136 INFO L272 TraceCheckUtils]: 919: Hoare triple {38320#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,136 INFO L284 TraceCheckUtils]: 918: Hoare quadruple {35321#true} {38320#(<= ~counter~0 36)} #63#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:52,136 INFO L290 TraceCheckUtils]: 917: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,137 INFO L290 TraceCheckUtils]: 916: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,137 INFO L290 TraceCheckUtils]: 915: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,137 INFO L272 TraceCheckUtils]: 914: Hoare triple {38320#(<= ~counter~0 36)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,137 INFO L284 TraceCheckUtils]: 913: Hoare quadruple {35321#true} {38320#(<= ~counter~0 36)} #61#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:52,137 INFO L290 TraceCheckUtils]: 912: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,137 INFO L290 TraceCheckUtils]: 911: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,137 INFO L290 TraceCheckUtils]: 910: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,137 INFO L272 TraceCheckUtils]: 909: Hoare triple {38320#(<= ~counter~0 36)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,138 INFO L284 TraceCheckUtils]: 908: Hoare quadruple {35321#true} {38320#(<= ~counter~0 36)} #59#return; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:52,138 INFO L290 TraceCheckUtils]: 907: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,138 INFO L290 TraceCheckUtils]: 906: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,138 INFO L290 TraceCheckUtils]: 905: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,138 INFO L272 TraceCheckUtils]: 904: Hoare triple {38320#(<= ~counter~0 36)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,138 INFO L290 TraceCheckUtils]: 903: Hoare triple {38320#(<= ~counter~0 36)} assume !!(#t~post5 < 50);havoc #t~post5; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:52,139 INFO L290 TraceCheckUtils]: 902: Hoare triple {38235#(<= ~counter~0 35)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38320#(<= ~counter~0 36)} is VALID [2022-04-07 13:06:52,139 INFO L290 TraceCheckUtils]: 901: Hoare triple {38235#(<= ~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; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:52,140 INFO L284 TraceCheckUtils]: 900: Hoare quadruple {35321#true} {38235#(<= ~counter~0 35)} #67#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:52,140 INFO L290 TraceCheckUtils]: 899: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,140 INFO L290 TraceCheckUtils]: 898: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,140 INFO L290 TraceCheckUtils]: 897: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,140 INFO L272 TraceCheckUtils]: 896: Hoare triple {38235#(<= ~counter~0 35)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,140 INFO L284 TraceCheckUtils]: 895: Hoare quadruple {35321#true} {38235#(<= ~counter~0 35)} #65#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:52,141 INFO L290 TraceCheckUtils]: 894: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,141 INFO L290 TraceCheckUtils]: 893: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,141 INFO L290 TraceCheckUtils]: 892: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,141 INFO L272 TraceCheckUtils]: 891: Hoare triple {38235#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,141 INFO L284 TraceCheckUtils]: 890: Hoare quadruple {35321#true} {38235#(<= ~counter~0 35)} #63#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:52,141 INFO L290 TraceCheckUtils]: 889: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,141 INFO L290 TraceCheckUtils]: 888: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,141 INFO L290 TraceCheckUtils]: 887: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,141 INFO L272 TraceCheckUtils]: 886: Hoare triple {38235#(<= ~counter~0 35)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,142 INFO L284 TraceCheckUtils]: 885: Hoare quadruple {35321#true} {38235#(<= ~counter~0 35)} #61#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:52,142 INFO L290 TraceCheckUtils]: 884: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,142 INFO L290 TraceCheckUtils]: 883: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,142 INFO L290 TraceCheckUtils]: 882: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,142 INFO L272 TraceCheckUtils]: 881: Hoare triple {38235#(<= ~counter~0 35)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,142 INFO L284 TraceCheckUtils]: 880: Hoare quadruple {35321#true} {38235#(<= ~counter~0 35)} #59#return; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:52,142 INFO L290 TraceCheckUtils]: 879: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,143 INFO L290 TraceCheckUtils]: 878: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,143 INFO L290 TraceCheckUtils]: 877: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,143 INFO L272 TraceCheckUtils]: 876: Hoare triple {38235#(<= ~counter~0 35)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,143 INFO L290 TraceCheckUtils]: 875: Hoare triple {38235#(<= ~counter~0 35)} assume !!(#t~post5 < 50);havoc #t~post5; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:52,144 INFO L290 TraceCheckUtils]: 874: Hoare triple {38150#(<= ~counter~0 34)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38235#(<= ~counter~0 35)} is VALID [2022-04-07 13:06:52,144 INFO L290 TraceCheckUtils]: 873: Hoare triple {38150#(<= ~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; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:52,145 INFO L284 TraceCheckUtils]: 872: Hoare quadruple {35321#true} {38150#(<= ~counter~0 34)} #67#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:52,145 INFO L290 TraceCheckUtils]: 871: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,145 INFO L290 TraceCheckUtils]: 870: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,145 INFO L290 TraceCheckUtils]: 869: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,145 INFO L272 TraceCheckUtils]: 868: Hoare triple {38150#(<= ~counter~0 34)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,145 INFO L284 TraceCheckUtils]: 867: Hoare quadruple {35321#true} {38150#(<= ~counter~0 34)} #65#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:52,145 INFO L290 TraceCheckUtils]: 866: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,145 INFO L290 TraceCheckUtils]: 865: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,145 INFO L290 TraceCheckUtils]: 864: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,146 INFO L272 TraceCheckUtils]: 863: Hoare triple {38150#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,146 INFO L284 TraceCheckUtils]: 862: Hoare quadruple {35321#true} {38150#(<= ~counter~0 34)} #63#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:52,146 INFO L290 TraceCheckUtils]: 861: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,146 INFO L290 TraceCheckUtils]: 860: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,146 INFO L290 TraceCheckUtils]: 859: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,146 INFO L272 TraceCheckUtils]: 858: Hoare triple {38150#(<= ~counter~0 34)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,147 INFO L284 TraceCheckUtils]: 857: Hoare quadruple {35321#true} {38150#(<= ~counter~0 34)} #61#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:52,147 INFO L290 TraceCheckUtils]: 856: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,147 INFO L290 TraceCheckUtils]: 855: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,147 INFO L290 TraceCheckUtils]: 854: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,147 INFO L272 TraceCheckUtils]: 853: Hoare triple {38150#(<= ~counter~0 34)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,147 INFO L284 TraceCheckUtils]: 852: Hoare quadruple {35321#true} {38150#(<= ~counter~0 34)} #59#return; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:52,147 INFO L290 TraceCheckUtils]: 851: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,147 INFO L290 TraceCheckUtils]: 850: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,147 INFO L290 TraceCheckUtils]: 849: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,148 INFO L272 TraceCheckUtils]: 848: Hoare triple {38150#(<= ~counter~0 34)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,148 INFO L290 TraceCheckUtils]: 847: Hoare triple {38150#(<= ~counter~0 34)} assume !!(#t~post5 < 50);havoc #t~post5; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:52,149 INFO L290 TraceCheckUtils]: 846: Hoare triple {38065#(<= ~counter~0 33)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38150#(<= ~counter~0 34)} is VALID [2022-04-07 13:06:52,149 INFO L290 TraceCheckUtils]: 845: Hoare triple {38065#(<= ~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; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:52,149 INFO L284 TraceCheckUtils]: 844: Hoare quadruple {35321#true} {38065#(<= ~counter~0 33)} #67#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:52,150 INFO L290 TraceCheckUtils]: 843: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,150 INFO L290 TraceCheckUtils]: 842: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,150 INFO L290 TraceCheckUtils]: 841: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,150 INFO L272 TraceCheckUtils]: 840: Hoare triple {38065#(<= ~counter~0 33)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,150 INFO L284 TraceCheckUtils]: 839: Hoare quadruple {35321#true} {38065#(<= ~counter~0 33)} #65#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:52,150 INFO L290 TraceCheckUtils]: 838: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,150 INFO L290 TraceCheckUtils]: 837: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,150 INFO L290 TraceCheckUtils]: 836: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,150 INFO L272 TraceCheckUtils]: 835: Hoare triple {38065#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,151 INFO L284 TraceCheckUtils]: 834: Hoare quadruple {35321#true} {38065#(<= ~counter~0 33)} #63#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:52,151 INFO L290 TraceCheckUtils]: 833: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,151 INFO L290 TraceCheckUtils]: 832: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,151 INFO L290 TraceCheckUtils]: 831: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,151 INFO L272 TraceCheckUtils]: 830: Hoare triple {38065#(<= ~counter~0 33)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,152 INFO L284 TraceCheckUtils]: 829: Hoare quadruple {35321#true} {38065#(<= ~counter~0 33)} #61#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:52,152 INFO L290 TraceCheckUtils]: 828: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,152 INFO L290 TraceCheckUtils]: 827: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,152 INFO L290 TraceCheckUtils]: 826: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,152 INFO L272 TraceCheckUtils]: 825: Hoare triple {38065#(<= ~counter~0 33)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,152 INFO L284 TraceCheckUtils]: 824: Hoare quadruple {35321#true} {38065#(<= ~counter~0 33)} #59#return; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:52,152 INFO L290 TraceCheckUtils]: 823: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,152 INFO L290 TraceCheckUtils]: 822: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,152 INFO L290 TraceCheckUtils]: 821: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,152 INFO L272 TraceCheckUtils]: 820: Hoare triple {38065#(<= ~counter~0 33)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,153 INFO L290 TraceCheckUtils]: 819: Hoare triple {38065#(<= ~counter~0 33)} assume !!(#t~post5 < 50);havoc #t~post5; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:52,154 INFO L290 TraceCheckUtils]: 818: Hoare triple {37980#(<= ~counter~0 32)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {38065#(<= ~counter~0 33)} is VALID [2022-04-07 13:06:52,154 INFO L290 TraceCheckUtils]: 817: Hoare triple {37980#(<= ~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; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:52,154 INFO L284 TraceCheckUtils]: 816: Hoare quadruple {35321#true} {37980#(<= ~counter~0 32)} #67#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:52,154 INFO L290 TraceCheckUtils]: 815: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,155 INFO L290 TraceCheckUtils]: 814: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,155 INFO L290 TraceCheckUtils]: 813: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,155 INFO L272 TraceCheckUtils]: 812: Hoare triple {37980#(<= ~counter~0 32)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,155 INFO L284 TraceCheckUtils]: 811: Hoare quadruple {35321#true} {37980#(<= ~counter~0 32)} #65#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:52,155 INFO L290 TraceCheckUtils]: 810: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,155 INFO L290 TraceCheckUtils]: 809: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,155 INFO L290 TraceCheckUtils]: 808: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,155 INFO L272 TraceCheckUtils]: 807: Hoare triple {37980#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,156 INFO L284 TraceCheckUtils]: 806: Hoare quadruple {35321#true} {37980#(<= ~counter~0 32)} #63#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:52,156 INFO L290 TraceCheckUtils]: 805: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,156 INFO L290 TraceCheckUtils]: 804: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,156 INFO L290 TraceCheckUtils]: 803: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,156 INFO L272 TraceCheckUtils]: 802: Hoare triple {37980#(<= ~counter~0 32)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,156 INFO L284 TraceCheckUtils]: 801: Hoare quadruple {35321#true} {37980#(<= ~counter~0 32)} #61#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:52,157 INFO L290 TraceCheckUtils]: 800: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,157 INFO L290 TraceCheckUtils]: 799: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,157 INFO L290 TraceCheckUtils]: 798: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,157 INFO L272 TraceCheckUtils]: 797: Hoare triple {37980#(<= ~counter~0 32)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,157 INFO L284 TraceCheckUtils]: 796: Hoare quadruple {35321#true} {37980#(<= ~counter~0 32)} #59#return; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:52,157 INFO L290 TraceCheckUtils]: 795: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,157 INFO L290 TraceCheckUtils]: 794: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,157 INFO L290 TraceCheckUtils]: 793: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,157 INFO L272 TraceCheckUtils]: 792: Hoare triple {37980#(<= ~counter~0 32)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,158 INFO L290 TraceCheckUtils]: 791: Hoare triple {37980#(<= ~counter~0 32)} assume !!(#t~post5 < 50);havoc #t~post5; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:52,159 INFO L290 TraceCheckUtils]: 790: Hoare triple {37895#(<= ~counter~0 31)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37980#(<= ~counter~0 32)} is VALID [2022-04-07 13:06:52,159 INFO L290 TraceCheckUtils]: 789: Hoare triple {37895#(<= ~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; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:52,159 INFO L284 TraceCheckUtils]: 788: Hoare quadruple {35321#true} {37895#(<= ~counter~0 31)} #67#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:52,159 INFO L290 TraceCheckUtils]: 787: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,160 INFO L290 TraceCheckUtils]: 786: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,160 INFO L290 TraceCheckUtils]: 785: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,160 INFO L272 TraceCheckUtils]: 784: Hoare triple {37895#(<= ~counter~0 31)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,160 INFO L284 TraceCheckUtils]: 783: Hoare quadruple {35321#true} {37895#(<= ~counter~0 31)} #65#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:52,160 INFO L290 TraceCheckUtils]: 782: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,160 INFO L290 TraceCheckUtils]: 781: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,160 INFO L290 TraceCheckUtils]: 780: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,160 INFO L272 TraceCheckUtils]: 779: Hoare triple {37895#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,161 INFO L284 TraceCheckUtils]: 778: Hoare quadruple {35321#true} {37895#(<= ~counter~0 31)} #63#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:52,161 INFO L290 TraceCheckUtils]: 777: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,161 INFO L290 TraceCheckUtils]: 776: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,161 INFO L290 TraceCheckUtils]: 775: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,161 INFO L272 TraceCheckUtils]: 774: Hoare triple {37895#(<= ~counter~0 31)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,161 INFO L284 TraceCheckUtils]: 773: Hoare quadruple {35321#true} {37895#(<= ~counter~0 31)} #61#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:52,161 INFO L290 TraceCheckUtils]: 772: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,162 INFO L290 TraceCheckUtils]: 771: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,162 INFO L290 TraceCheckUtils]: 770: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,162 INFO L272 TraceCheckUtils]: 769: Hoare triple {37895#(<= ~counter~0 31)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,162 INFO L284 TraceCheckUtils]: 768: Hoare quadruple {35321#true} {37895#(<= ~counter~0 31)} #59#return; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:52,162 INFO L290 TraceCheckUtils]: 767: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,162 INFO L290 TraceCheckUtils]: 766: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,162 INFO L290 TraceCheckUtils]: 765: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,162 INFO L272 TraceCheckUtils]: 764: Hoare triple {37895#(<= ~counter~0 31)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,163 INFO L290 TraceCheckUtils]: 763: Hoare triple {37895#(<= ~counter~0 31)} assume !!(#t~post5 < 50);havoc #t~post5; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:52,164 INFO L290 TraceCheckUtils]: 762: Hoare triple {37810#(<= ~counter~0 30)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37895#(<= ~counter~0 31)} is VALID [2022-04-07 13:06:52,164 INFO L290 TraceCheckUtils]: 761: Hoare triple {37810#(<= ~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; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:52,164 INFO L284 TraceCheckUtils]: 760: Hoare quadruple {35321#true} {37810#(<= ~counter~0 30)} #67#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:52,164 INFO L290 TraceCheckUtils]: 759: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,165 INFO L290 TraceCheckUtils]: 758: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,165 INFO L290 TraceCheckUtils]: 757: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,165 INFO L272 TraceCheckUtils]: 756: Hoare triple {37810#(<= ~counter~0 30)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,165 INFO L284 TraceCheckUtils]: 755: Hoare quadruple {35321#true} {37810#(<= ~counter~0 30)} #65#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:52,165 INFO L290 TraceCheckUtils]: 754: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,165 INFO L290 TraceCheckUtils]: 753: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,165 INFO L290 TraceCheckUtils]: 752: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,165 INFO L272 TraceCheckUtils]: 751: Hoare triple {37810#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,166 INFO L284 TraceCheckUtils]: 750: Hoare quadruple {35321#true} {37810#(<= ~counter~0 30)} #63#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:52,166 INFO L290 TraceCheckUtils]: 749: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,166 INFO L290 TraceCheckUtils]: 748: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,166 INFO L290 TraceCheckUtils]: 747: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,166 INFO L272 TraceCheckUtils]: 746: Hoare triple {37810#(<= ~counter~0 30)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,166 INFO L284 TraceCheckUtils]: 745: Hoare quadruple {35321#true} {37810#(<= ~counter~0 30)} #61#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:52,167 INFO L290 TraceCheckUtils]: 744: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,167 INFO L290 TraceCheckUtils]: 743: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,167 INFO L290 TraceCheckUtils]: 742: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,167 INFO L272 TraceCheckUtils]: 741: Hoare triple {37810#(<= ~counter~0 30)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,167 INFO L284 TraceCheckUtils]: 740: Hoare quadruple {35321#true} {37810#(<= ~counter~0 30)} #59#return; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:52,167 INFO L290 TraceCheckUtils]: 739: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,167 INFO L290 TraceCheckUtils]: 738: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,167 INFO L290 TraceCheckUtils]: 737: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,167 INFO L272 TraceCheckUtils]: 736: Hoare triple {37810#(<= ~counter~0 30)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,168 INFO L290 TraceCheckUtils]: 735: Hoare triple {37810#(<= ~counter~0 30)} assume !!(#t~post5 < 50);havoc #t~post5; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:52,169 INFO L290 TraceCheckUtils]: 734: Hoare triple {37725#(<= ~counter~0 29)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37810#(<= ~counter~0 30)} is VALID [2022-04-07 13:06:52,169 INFO L290 TraceCheckUtils]: 733: Hoare triple {37725#(<= ~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; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:52,169 INFO L284 TraceCheckUtils]: 732: Hoare quadruple {35321#true} {37725#(<= ~counter~0 29)} #67#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:52,169 INFO L290 TraceCheckUtils]: 731: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,170 INFO L290 TraceCheckUtils]: 730: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,170 INFO L290 TraceCheckUtils]: 729: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,170 INFO L272 TraceCheckUtils]: 728: Hoare triple {37725#(<= ~counter~0 29)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,170 INFO L284 TraceCheckUtils]: 727: Hoare quadruple {35321#true} {37725#(<= ~counter~0 29)} #65#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:52,170 INFO L290 TraceCheckUtils]: 726: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,170 INFO L290 TraceCheckUtils]: 725: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,170 INFO L290 TraceCheckUtils]: 724: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,170 INFO L272 TraceCheckUtils]: 723: Hoare triple {37725#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,171 INFO L284 TraceCheckUtils]: 722: Hoare quadruple {35321#true} {37725#(<= ~counter~0 29)} #63#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:52,171 INFO L290 TraceCheckUtils]: 721: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,171 INFO L290 TraceCheckUtils]: 720: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,171 INFO L290 TraceCheckUtils]: 719: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,171 INFO L272 TraceCheckUtils]: 718: Hoare triple {37725#(<= ~counter~0 29)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,171 INFO L284 TraceCheckUtils]: 717: Hoare quadruple {35321#true} {37725#(<= ~counter~0 29)} #61#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:52,172 INFO L290 TraceCheckUtils]: 716: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,172 INFO L290 TraceCheckUtils]: 715: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,172 INFO L290 TraceCheckUtils]: 714: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,172 INFO L272 TraceCheckUtils]: 713: Hoare triple {37725#(<= ~counter~0 29)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,172 INFO L284 TraceCheckUtils]: 712: Hoare quadruple {35321#true} {37725#(<= ~counter~0 29)} #59#return; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:52,172 INFO L290 TraceCheckUtils]: 711: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,172 INFO L290 TraceCheckUtils]: 710: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,172 INFO L290 TraceCheckUtils]: 709: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,172 INFO L272 TraceCheckUtils]: 708: Hoare triple {37725#(<= ~counter~0 29)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,173 INFO L290 TraceCheckUtils]: 707: Hoare triple {37725#(<= ~counter~0 29)} assume !!(#t~post5 < 50);havoc #t~post5; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:52,174 INFO L290 TraceCheckUtils]: 706: Hoare triple {37640#(<= ~counter~0 28)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37725#(<= ~counter~0 29)} is VALID [2022-04-07 13:06:52,174 INFO L290 TraceCheckUtils]: 705: Hoare triple {37640#(<= ~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; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:52,174 INFO L284 TraceCheckUtils]: 704: Hoare quadruple {35321#true} {37640#(<= ~counter~0 28)} #67#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:52,174 INFO L290 TraceCheckUtils]: 703: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,175 INFO L290 TraceCheckUtils]: 702: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,175 INFO L290 TraceCheckUtils]: 701: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,175 INFO L272 TraceCheckUtils]: 700: Hoare triple {37640#(<= ~counter~0 28)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,175 INFO L284 TraceCheckUtils]: 699: Hoare quadruple {35321#true} {37640#(<= ~counter~0 28)} #65#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:52,175 INFO L290 TraceCheckUtils]: 698: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,175 INFO L290 TraceCheckUtils]: 697: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,175 INFO L290 TraceCheckUtils]: 696: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,175 INFO L272 TraceCheckUtils]: 695: Hoare triple {37640#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,176 INFO L284 TraceCheckUtils]: 694: Hoare quadruple {35321#true} {37640#(<= ~counter~0 28)} #63#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:52,176 INFO L290 TraceCheckUtils]: 693: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,176 INFO L290 TraceCheckUtils]: 692: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,176 INFO L290 TraceCheckUtils]: 691: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,176 INFO L272 TraceCheckUtils]: 690: Hoare triple {37640#(<= ~counter~0 28)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,176 INFO L284 TraceCheckUtils]: 689: Hoare quadruple {35321#true} {37640#(<= ~counter~0 28)} #61#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:52,177 INFO L290 TraceCheckUtils]: 688: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,177 INFO L290 TraceCheckUtils]: 687: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,177 INFO L290 TraceCheckUtils]: 686: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,177 INFO L272 TraceCheckUtils]: 685: Hoare triple {37640#(<= ~counter~0 28)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,177 INFO L284 TraceCheckUtils]: 684: Hoare quadruple {35321#true} {37640#(<= ~counter~0 28)} #59#return; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:52,177 INFO L290 TraceCheckUtils]: 683: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,177 INFO L290 TraceCheckUtils]: 682: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,177 INFO L290 TraceCheckUtils]: 681: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,177 INFO L272 TraceCheckUtils]: 680: Hoare triple {37640#(<= ~counter~0 28)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,178 INFO L290 TraceCheckUtils]: 679: Hoare triple {37640#(<= ~counter~0 28)} assume !!(#t~post5 < 50);havoc #t~post5; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:52,178 INFO L290 TraceCheckUtils]: 678: Hoare triple {37555#(<= ~counter~0 27)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37640#(<= ~counter~0 28)} is VALID [2022-04-07 13:06:52,179 INFO L290 TraceCheckUtils]: 677: Hoare triple {37555#(<= ~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; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:52,179 INFO L284 TraceCheckUtils]: 676: Hoare quadruple {35321#true} {37555#(<= ~counter~0 27)} #67#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:52,179 INFO L290 TraceCheckUtils]: 675: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,179 INFO L290 TraceCheckUtils]: 674: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,179 INFO L290 TraceCheckUtils]: 673: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,179 INFO L272 TraceCheckUtils]: 672: Hoare triple {37555#(<= ~counter~0 27)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,180 INFO L284 TraceCheckUtils]: 671: Hoare quadruple {35321#true} {37555#(<= ~counter~0 27)} #65#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:52,180 INFO L290 TraceCheckUtils]: 670: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,180 INFO L290 TraceCheckUtils]: 669: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,180 INFO L290 TraceCheckUtils]: 668: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,180 INFO L272 TraceCheckUtils]: 667: Hoare triple {37555#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,181 INFO L284 TraceCheckUtils]: 666: Hoare quadruple {35321#true} {37555#(<= ~counter~0 27)} #63#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:52,181 INFO L290 TraceCheckUtils]: 665: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,181 INFO L290 TraceCheckUtils]: 664: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,181 INFO L290 TraceCheckUtils]: 663: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,181 INFO L272 TraceCheckUtils]: 662: Hoare triple {37555#(<= ~counter~0 27)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,181 INFO L284 TraceCheckUtils]: 661: Hoare quadruple {35321#true} {37555#(<= ~counter~0 27)} #61#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:52,181 INFO L290 TraceCheckUtils]: 660: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,181 INFO L290 TraceCheckUtils]: 659: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,181 INFO L290 TraceCheckUtils]: 658: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,182 INFO L272 TraceCheckUtils]: 657: Hoare triple {37555#(<= ~counter~0 27)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,182 INFO L284 TraceCheckUtils]: 656: Hoare quadruple {35321#true} {37555#(<= ~counter~0 27)} #59#return; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:52,182 INFO L290 TraceCheckUtils]: 655: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,182 INFO L290 TraceCheckUtils]: 654: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,182 INFO L290 TraceCheckUtils]: 653: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,182 INFO L272 TraceCheckUtils]: 652: Hoare triple {37555#(<= ~counter~0 27)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,182 INFO L290 TraceCheckUtils]: 651: Hoare triple {37555#(<= ~counter~0 27)} assume !!(#t~post5 < 50);havoc #t~post5; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:52,183 INFO L290 TraceCheckUtils]: 650: Hoare triple {37470#(<= ~counter~0 26)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37555#(<= ~counter~0 27)} is VALID [2022-04-07 13:06:52,184 INFO L290 TraceCheckUtils]: 649: Hoare triple {37470#(<= ~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; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:52,184 INFO L284 TraceCheckUtils]: 648: Hoare quadruple {35321#true} {37470#(<= ~counter~0 26)} #67#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:52,184 INFO L290 TraceCheckUtils]: 647: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,184 INFO L290 TraceCheckUtils]: 646: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,184 INFO L290 TraceCheckUtils]: 645: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,185 INFO L272 TraceCheckUtils]: 644: Hoare triple {37470#(<= ~counter~0 26)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,185 INFO L284 TraceCheckUtils]: 643: Hoare quadruple {35321#true} {37470#(<= ~counter~0 26)} #65#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:52,185 INFO L290 TraceCheckUtils]: 642: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,185 INFO L290 TraceCheckUtils]: 641: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,185 INFO L290 TraceCheckUtils]: 640: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,185 INFO L272 TraceCheckUtils]: 639: Hoare triple {37470#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,186 INFO L284 TraceCheckUtils]: 638: Hoare quadruple {35321#true} {37470#(<= ~counter~0 26)} #63#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:52,186 INFO L290 TraceCheckUtils]: 637: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,186 INFO L290 TraceCheckUtils]: 636: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,186 INFO L290 TraceCheckUtils]: 635: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,186 INFO L272 TraceCheckUtils]: 634: Hoare triple {37470#(<= ~counter~0 26)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,186 INFO L284 TraceCheckUtils]: 633: Hoare quadruple {35321#true} {37470#(<= ~counter~0 26)} #61#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:52,186 INFO L290 TraceCheckUtils]: 632: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,186 INFO L290 TraceCheckUtils]: 631: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,187 INFO L290 TraceCheckUtils]: 630: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,187 INFO L272 TraceCheckUtils]: 629: Hoare triple {37470#(<= ~counter~0 26)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,187 INFO L284 TraceCheckUtils]: 628: Hoare quadruple {35321#true} {37470#(<= ~counter~0 26)} #59#return; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:52,187 INFO L290 TraceCheckUtils]: 627: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,187 INFO L290 TraceCheckUtils]: 626: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,187 INFO L290 TraceCheckUtils]: 625: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,187 INFO L272 TraceCheckUtils]: 624: Hoare triple {37470#(<= ~counter~0 26)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,188 INFO L290 TraceCheckUtils]: 623: Hoare triple {37470#(<= ~counter~0 26)} assume !!(#t~post5 < 50);havoc #t~post5; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:52,189 INFO L290 TraceCheckUtils]: 622: Hoare triple {37385#(<= ~counter~0 25)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37470#(<= ~counter~0 26)} is VALID [2022-04-07 13:06:52,189 INFO L290 TraceCheckUtils]: 621: Hoare triple {37385#(<= ~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; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:52,189 INFO L284 TraceCheckUtils]: 620: Hoare quadruple {35321#true} {37385#(<= ~counter~0 25)} #67#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:52,189 INFO L290 TraceCheckUtils]: 619: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,189 INFO L290 TraceCheckUtils]: 618: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,189 INFO L290 TraceCheckUtils]: 617: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,190 INFO L272 TraceCheckUtils]: 616: Hoare triple {37385#(<= ~counter~0 25)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,190 INFO L284 TraceCheckUtils]: 615: Hoare quadruple {35321#true} {37385#(<= ~counter~0 25)} #65#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:52,190 INFO L290 TraceCheckUtils]: 614: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,190 INFO L290 TraceCheckUtils]: 613: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,190 INFO L290 TraceCheckUtils]: 612: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,190 INFO L272 TraceCheckUtils]: 611: Hoare triple {37385#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,191 INFO L284 TraceCheckUtils]: 610: Hoare quadruple {35321#true} {37385#(<= ~counter~0 25)} #63#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:52,191 INFO L290 TraceCheckUtils]: 609: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,191 INFO L290 TraceCheckUtils]: 608: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,191 INFO L290 TraceCheckUtils]: 607: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,191 INFO L272 TraceCheckUtils]: 606: Hoare triple {37385#(<= ~counter~0 25)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,191 INFO L284 TraceCheckUtils]: 605: Hoare quadruple {35321#true} {37385#(<= ~counter~0 25)} #61#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:52,191 INFO L290 TraceCheckUtils]: 604: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,191 INFO L290 TraceCheckUtils]: 603: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,192 INFO L290 TraceCheckUtils]: 602: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,192 INFO L272 TraceCheckUtils]: 601: Hoare triple {37385#(<= ~counter~0 25)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,192 INFO L284 TraceCheckUtils]: 600: Hoare quadruple {35321#true} {37385#(<= ~counter~0 25)} #59#return; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:52,192 INFO L290 TraceCheckUtils]: 599: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,192 INFO L290 TraceCheckUtils]: 598: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,192 INFO L290 TraceCheckUtils]: 597: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,192 INFO L272 TraceCheckUtils]: 596: Hoare triple {37385#(<= ~counter~0 25)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,192 INFO L290 TraceCheckUtils]: 595: Hoare triple {37385#(<= ~counter~0 25)} assume !!(#t~post5 < 50);havoc #t~post5; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:52,193 INFO L290 TraceCheckUtils]: 594: Hoare triple {37300#(<= ~counter~0 24)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37385#(<= ~counter~0 25)} is VALID [2022-04-07 13:06:52,194 INFO L290 TraceCheckUtils]: 593: Hoare triple {37300#(<= ~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; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:52,194 INFO L284 TraceCheckUtils]: 592: Hoare quadruple {35321#true} {37300#(<= ~counter~0 24)} #67#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:52,194 INFO L290 TraceCheckUtils]: 591: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,194 INFO L290 TraceCheckUtils]: 590: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,194 INFO L290 TraceCheckUtils]: 589: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,194 INFO L272 TraceCheckUtils]: 588: Hoare triple {37300#(<= ~counter~0 24)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,195 INFO L284 TraceCheckUtils]: 587: Hoare quadruple {35321#true} {37300#(<= ~counter~0 24)} #65#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:52,195 INFO L290 TraceCheckUtils]: 586: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,195 INFO L290 TraceCheckUtils]: 585: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,195 INFO L290 TraceCheckUtils]: 584: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,195 INFO L272 TraceCheckUtils]: 583: Hoare triple {37300#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,196 INFO L284 TraceCheckUtils]: 582: Hoare quadruple {35321#true} {37300#(<= ~counter~0 24)} #63#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:52,196 INFO L290 TraceCheckUtils]: 581: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,196 INFO L290 TraceCheckUtils]: 580: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,196 INFO L290 TraceCheckUtils]: 579: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,196 INFO L272 TraceCheckUtils]: 578: Hoare triple {37300#(<= ~counter~0 24)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,196 INFO L284 TraceCheckUtils]: 577: Hoare quadruple {35321#true} {37300#(<= ~counter~0 24)} #61#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:52,196 INFO L290 TraceCheckUtils]: 576: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,196 INFO L290 TraceCheckUtils]: 575: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,196 INFO L290 TraceCheckUtils]: 574: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,197 INFO L272 TraceCheckUtils]: 573: Hoare triple {37300#(<= ~counter~0 24)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,197 INFO L284 TraceCheckUtils]: 572: Hoare quadruple {35321#true} {37300#(<= ~counter~0 24)} #59#return; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:52,197 INFO L290 TraceCheckUtils]: 571: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,197 INFO L290 TraceCheckUtils]: 570: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,197 INFO L290 TraceCheckUtils]: 569: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,197 INFO L272 TraceCheckUtils]: 568: Hoare triple {37300#(<= ~counter~0 24)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,197 INFO L290 TraceCheckUtils]: 567: Hoare triple {37300#(<= ~counter~0 24)} assume !!(#t~post5 < 50);havoc #t~post5; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:52,198 INFO L290 TraceCheckUtils]: 566: Hoare triple {37215#(<= ~counter~0 23)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37300#(<= ~counter~0 24)} is VALID [2022-04-07 13:06:52,199 INFO L290 TraceCheckUtils]: 565: Hoare triple {37215#(<= ~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; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:52,199 INFO L284 TraceCheckUtils]: 564: Hoare quadruple {35321#true} {37215#(<= ~counter~0 23)} #67#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:52,199 INFO L290 TraceCheckUtils]: 563: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,199 INFO L290 TraceCheckUtils]: 562: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,199 INFO L290 TraceCheckUtils]: 561: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,199 INFO L272 TraceCheckUtils]: 560: Hoare triple {37215#(<= ~counter~0 23)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,200 INFO L284 TraceCheckUtils]: 559: Hoare quadruple {35321#true} {37215#(<= ~counter~0 23)} #65#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:52,200 INFO L290 TraceCheckUtils]: 558: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,200 INFO L290 TraceCheckUtils]: 557: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,200 INFO L290 TraceCheckUtils]: 556: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,200 INFO L272 TraceCheckUtils]: 555: Hoare triple {37215#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,201 INFO L284 TraceCheckUtils]: 554: Hoare quadruple {35321#true} {37215#(<= ~counter~0 23)} #63#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:52,201 INFO L290 TraceCheckUtils]: 553: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,201 INFO L290 TraceCheckUtils]: 552: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,201 INFO L290 TraceCheckUtils]: 551: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,201 INFO L272 TraceCheckUtils]: 550: Hoare triple {37215#(<= ~counter~0 23)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,201 INFO L284 TraceCheckUtils]: 549: Hoare quadruple {35321#true} {37215#(<= ~counter~0 23)} #61#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:52,201 INFO L290 TraceCheckUtils]: 548: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,201 INFO L290 TraceCheckUtils]: 547: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,201 INFO L290 TraceCheckUtils]: 546: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,201 INFO L272 TraceCheckUtils]: 545: Hoare triple {37215#(<= ~counter~0 23)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,202 INFO L284 TraceCheckUtils]: 544: Hoare quadruple {35321#true} {37215#(<= ~counter~0 23)} #59#return; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:52,202 INFO L290 TraceCheckUtils]: 543: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,202 INFO L290 TraceCheckUtils]: 542: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,202 INFO L290 TraceCheckUtils]: 541: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,202 INFO L272 TraceCheckUtils]: 540: Hoare triple {37215#(<= ~counter~0 23)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,202 INFO L290 TraceCheckUtils]: 539: Hoare triple {37215#(<= ~counter~0 23)} assume !!(#t~post5 < 50);havoc #t~post5; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:52,203 INFO L290 TraceCheckUtils]: 538: Hoare triple {37130#(<= ~counter~0 22)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37215#(<= ~counter~0 23)} is VALID [2022-04-07 13:06:52,204 INFO L290 TraceCheckUtils]: 537: Hoare triple {37130#(<= ~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; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:52,204 INFO L284 TraceCheckUtils]: 536: Hoare quadruple {35321#true} {37130#(<= ~counter~0 22)} #67#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:52,204 INFO L290 TraceCheckUtils]: 535: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,204 INFO L290 TraceCheckUtils]: 534: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,204 INFO L290 TraceCheckUtils]: 533: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,204 INFO L272 TraceCheckUtils]: 532: Hoare triple {37130#(<= ~counter~0 22)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,205 INFO L284 TraceCheckUtils]: 531: Hoare quadruple {35321#true} {37130#(<= ~counter~0 22)} #65#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:52,205 INFO L290 TraceCheckUtils]: 530: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,205 INFO L290 TraceCheckUtils]: 529: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,205 INFO L290 TraceCheckUtils]: 528: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,205 INFO L272 TraceCheckUtils]: 527: Hoare triple {37130#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,205 INFO L284 TraceCheckUtils]: 526: Hoare quadruple {35321#true} {37130#(<= ~counter~0 22)} #63#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:52,206 INFO L290 TraceCheckUtils]: 525: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,206 INFO L290 TraceCheckUtils]: 524: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,206 INFO L290 TraceCheckUtils]: 523: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,206 INFO L272 TraceCheckUtils]: 522: Hoare triple {37130#(<= ~counter~0 22)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,206 INFO L284 TraceCheckUtils]: 521: Hoare quadruple {35321#true} {37130#(<= ~counter~0 22)} #61#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:52,206 INFO L290 TraceCheckUtils]: 520: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,206 INFO L290 TraceCheckUtils]: 519: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,206 INFO L290 TraceCheckUtils]: 518: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,206 INFO L272 TraceCheckUtils]: 517: Hoare triple {37130#(<= ~counter~0 22)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,207 INFO L284 TraceCheckUtils]: 516: Hoare quadruple {35321#true} {37130#(<= ~counter~0 22)} #59#return; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:52,207 INFO L290 TraceCheckUtils]: 515: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,207 INFO L290 TraceCheckUtils]: 514: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,207 INFO L290 TraceCheckUtils]: 513: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,207 INFO L272 TraceCheckUtils]: 512: Hoare triple {37130#(<= ~counter~0 22)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,207 INFO L290 TraceCheckUtils]: 511: Hoare triple {37130#(<= ~counter~0 22)} assume !!(#t~post5 < 50);havoc #t~post5; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:52,208 INFO L290 TraceCheckUtils]: 510: Hoare triple {37045#(<= ~counter~0 21)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37130#(<= ~counter~0 22)} is VALID [2022-04-07 13:06:52,209 INFO L290 TraceCheckUtils]: 509: Hoare triple {37045#(<= ~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; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:52,209 INFO L284 TraceCheckUtils]: 508: Hoare quadruple {35321#true} {37045#(<= ~counter~0 21)} #67#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:52,209 INFO L290 TraceCheckUtils]: 507: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,209 INFO L290 TraceCheckUtils]: 506: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,209 INFO L290 TraceCheckUtils]: 505: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,209 INFO L272 TraceCheckUtils]: 504: Hoare triple {37045#(<= ~counter~0 21)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,210 INFO L284 TraceCheckUtils]: 503: Hoare quadruple {35321#true} {37045#(<= ~counter~0 21)} #65#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:52,210 INFO L290 TraceCheckUtils]: 502: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,210 INFO L290 TraceCheckUtils]: 501: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,210 INFO L290 TraceCheckUtils]: 500: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,210 INFO L272 TraceCheckUtils]: 499: Hoare triple {37045#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,210 INFO L284 TraceCheckUtils]: 498: Hoare quadruple {35321#true} {37045#(<= ~counter~0 21)} #63#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:52,210 INFO L290 TraceCheckUtils]: 497: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,211 INFO L290 TraceCheckUtils]: 496: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,211 INFO L290 TraceCheckUtils]: 495: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,211 INFO L272 TraceCheckUtils]: 494: Hoare triple {37045#(<= ~counter~0 21)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,211 INFO L284 TraceCheckUtils]: 493: Hoare quadruple {35321#true} {37045#(<= ~counter~0 21)} #61#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:52,211 INFO L290 TraceCheckUtils]: 492: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,211 INFO L290 TraceCheckUtils]: 491: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,211 INFO L290 TraceCheckUtils]: 490: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,211 INFO L272 TraceCheckUtils]: 489: Hoare triple {37045#(<= ~counter~0 21)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,212 INFO L284 TraceCheckUtils]: 488: Hoare quadruple {35321#true} {37045#(<= ~counter~0 21)} #59#return; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:52,212 INFO L290 TraceCheckUtils]: 487: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,212 INFO L290 TraceCheckUtils]: 486: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,212 INFO L290 TraceCheckUtils]: 485: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,212 INFO L272 TraceCheckUtils]: 484: Hoare triple {37045#(<= ~counter~0 21)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,212 INFO L290 TraceCheckUtils]: 483: Hoare triple {37045#(<= ~counter~0 21)} assume !!(#t~post5 < 50);havoc #t~post5; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:52,213 INFO L290 TraceCheckUtils]: 482: Hoare triple {36960#(<= ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {37045#(<= ~counter~0 21)} is VALID [2022-04-07 13:06:52,213 INFO L290 TraceCheckUtils]: 481: Hoare triple {36960#(<= ~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; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:52,214 INFO L284 TraceCheckUtils]: 480: Hoare quadruple {35321#true} {36960#(<= ~counter~0 20)} #67#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:52,214 INFO L290 TraceCheckUtils]: 479: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,214 INFO L290 TraceCheckUtils]: 478: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,214 INFO L290 TraceCheckUtils]: 477: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,214 INFO L272 TraceCheckUtils]: 476: Hoare triple {36960#(<= ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,215 INFO L284 TraceCheckUtils]: 475: Hoare quadruple {35321#true} {36960#(<= ~counter~0 20)} #65#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:52,215 INFO L290 TraceCheckUtils]: 474: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,215 INFO L290 TraceCheckUtils]: 473: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,215 INFO L290 TraceCheckUtils]: 472: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,215 INFO L272 TraceCheckUtils]: 471: Hoare triple {36960#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,215 INFO L284 TraceCheckUtils]: 470: Hoare quadruple {35321#true} {36960#(<= ~counter~0 20)} #63#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:52,215 INFO L290 TraceCheckUtils]: 469: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,215 INFO L290 TraceCheckUtils]: 468: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,216 INFO L290 TraceCheckUtils]: 467: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,216 INFO L272 TraceCheckUtils]: 466: Hoare triple {36960#(<= ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,216 INFO L284 TraceCheckUtils]: 465: Hoare quadruple {35321#true} {36960#(<= ~counter~0 20)} #61#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:52,216 INFO L290 TraceCheckUtils]: 464: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,216 INFO L290 TraceCheckUtils]: 463: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,216 INFO L290 TraceCheckUtils]: 462: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,216 INFO L272 TraceCheckUtils]: 461: Hoare triple {36960#(<= ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,217 INFO L284 TraceCheckUtils]: 460: Hoare quadruple {35321#true} {36960#(<= ~counter~0 20)} #59#return; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:52,217 INFO L290 TraceCheckUtils]: 459: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,217 INFO L290 TraceCheckUtils]: 458: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,217 INFO L290 TraceCheckUtils]: 457: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,217 INFO L272 TraceCheckUtils]: 456: Hoare triple {36960#(<= ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,217 INFO L290 TraceCheckUtils]: 455: Hoare triple {36960#(<= ~counter~0 20)} assume !!(#t~post5 < 50);havoc #t~post5; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:52,218 INFO L290 TraceCheckUtils]: 454: Hoare triple {36875#(<= ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36960#(<= ~counter~0 20)} is VALID [2022-04-07 13:06:52,218 INFO L290 TraceCheckUtils]: 453: Hoare triple {36875#(<= ~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; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:52,219 INFO L284 TraceCheckUtils]: 452: Hoare quadruple {35321#true} {36875#(<= ~counter~0 19)} #67#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:52,219 INFO L290 TraceCheckUtils]: 451: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,219 INFO L290 TraceCheckUtils]: 450: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,219 INFO L290 TraceCheckUtils]: 449: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,219 INFO L272 TraceCheckUtils]: 448: Hoare triple {36875#(<= ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,219 INFO L284 TraceCheckUtils]: 447: Hoare quadruple {35321#true} {36875#(<= ~counter~0 19)} #65#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:52,220 INFO L290 TraceCheckUtils]: 446: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,220 INFO L290 TraceCheckUtils]: 445: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,220 INFO L290 TraceCheckUtils]: 444: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,220 INFO L272 TraceCheckUtils]: 443: Hoare triple {36875#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,220 INFO L284 TraceCheckUtils]: 442: Hoare quadruple {35321#true} {36875#(<= ~counter~0 19)} #63#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:52,220 INFO L290 TraceCheckUtils]: 441: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,220 INFO L290 TraceCheckUtils]: 440: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,220 INFO L290 TraceCheckUtils]: 439: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,220 INFO L272 TraceCheckUtils]: 438: Hoare triple {36875#(<= ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,221 INFO L284 TraceCheckUtils]: 437: Hoare quadruple {35321#true} {36875#(<= ~counter~0 19)} #61#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:52,221 INFO L290 TraceCheckUtils]: 436: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,221 INFO L290 TraceCheckUtils]: 435: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,221 INFO L290 TraceCheckUtils]: 434: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,221 INFO L272 TraceCheckUtils]: 433: Hoare triple {36875#(<= ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,221 INFO L284 TraceCheckUtils]: 432: Hoare quadruple {35321#true} {36875#(<= ~counter~0 19)} #59#return; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:52,222 INFO L290 TraceCheckUtils]: 431: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,222 INFO L290 TraceCheckUtils]: 430: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,222 INFO L290 TraceCheckUtils]: 429: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,222 INFO L272 TraceCheckUtils]: 428: Hoare triple {36875#(<= ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,222 INFO L290 TraceCheckUtils]: 427: Hoare triple {36875#(<= ~counter~0 19)} assume !!(#t~post5 < 50);havoc #t~post5; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:52,223 INFO L290 TraceCheckUtils]: 426: Hoare triple {36790#(<= ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36875#(<= ~counter~0 19)} is VALID [2022-04-07 13:06:52,223 INFO L290 TraceCheckUtils]: 425: Hoare triple {36790#(<= ~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; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:52,224 INFO L284 TraceCheckUtils]: 424: Hoare quadruple {35321#true} {36790#(<= ~counter~0 18)} #67#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:52,224 INFO L290 TraceCheckUtils]: 423: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,224 INFO L290 TraceCheckUtils]: 422: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,224 INFO L290 TraceCheckUtils]: 421: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,224 INFO L272 TraceCheckUtils]: 420: Hoare triple {36790#(<= ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,224 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {35321#true} {36790#(<= ~counter~0 18)} #65#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:52,224 INFO L290 TraceCheckUtils]: 418: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,224 INFO L290 TraceCheckUtils]: 417: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,225 INFO L290 TraceCheckUtils]: 416: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,225 INFO L272 TraceCheckUtils]: 415: Hoare triple {36790#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,225 INFO L284 TraceCheckUtils]: 414: Hoare quadruple {35321#true} {36790#(<= ~counter~0 18)} #63#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:52,225 INFO L290 TraceCheckUtils]: 413: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,225 INFO L290 TraceCheckUtils]: 412: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,225 INFO L290 TraceCheckUtils]: 411: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,225 INFO L272 TraceCheckUtils]: 410: Hoare triple {36790#(<= ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,237 INFO L284 TraceCheckUtils]: 409: Hoare quadruple {35321#true} {36790#(<= ~counter~0 18)} #61#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:52,237 INFO L290 TraceCheckUtils]: 408: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,237 INFO L290 TraceCheckUtils]: 407: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,237 INFO L290 TraceCheckUtils]: 406: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,238 INFO L272 TraceCheckUtils]: 405: Hoare triple {36790#(<= ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,238 INFO L284 TraceCheckUtils]: 404: Hoare quadruple {35321#true} {36790#(<= ~counter~0 18)} #59#return; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:52,238 INFO L290 TraceCheckUtils]: 403: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,238 INFO L290 TraceCheckUtils]: 402: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,238 INFO L290 TraceCheckUtils]: 401: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,238 INFO L272 TraceCheckUtils]: 400: Hoare triple {36790#(<= ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,239 INFO L290 TraceCheckUtils]: 399: Hoare triple {36790#(<= ~counter~0 18)} assume !!(#t~post5 < 50);havoc #t~post5; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:52,240 INFO L290 TraceCheckUtils]: 398: Hoare triple {36705#(<= ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36790#(<= ~counter~0 18)} is VALID [2022-04-07 13:06:52,240 INFO L290 TraceCheckUtils]: 397: Hoare triple {36705#(<= ~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; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:52,241 INFO L284 TraceCheckUtils]: 396: Hoare quadruple {35321#true} {36705#(<= ~counter~0 17)} #67#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:52,241 INFO L290 TraceCheckUtils]: 395: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,241 INFO L290 TraceCheckUtils]: 394: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,241 INFO L290 TraceCheckUtils]: 393: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,241 INFO L272 TraceCheckUtils]: 392: Hoare triple {36705#(<= ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,242 INFO L284 TraceCheckUtils]: 391: Hoare quadruple {35321#true} {36705#(<= ~counter~0 17)} #65#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:52,242 INFO L290 TraceCheckUtils]: 390: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,242 INFO L290 TraceCheckUtils]: 389: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,242 INFO L290 TraceCheckUtils]: 388: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,242 INFO L272 TraceCheckUtils]: 387: Hoare triple {36705#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,243 INFO L284 TraceCheckUtils]: 386: Hoare quadruple {35321#true} {36705#(<= ~counter~0 17)} #63#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:52,243 INFO L290 TraceCheckUtils]: 385: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,243 INFO L290 TraceCheckUtils]: 384: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,243 INFO L290 TraceCheckUtils]: 383: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,243 INFO L272 TraceCheckUtils]: 382: Hoare triple {36705#(<= ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,244 INFO L284 TraceCheckUtils]: 381: Hoare quadruple {35321#true} {36705#(<= ~counter~0 17)} #61#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:52,244 INFO L290 TraceCheckUtils]: 380: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,244 INFO L290 TraceCheckUtils]: 379: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,244 INFO L290 TraceCheckUtils]: 378: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,244 INFO L272 TraceCheckUtils]: 377: Hoare triple {36705#(<= ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,244 INFO L284 TraceCheckUtils]: 376: Hoare quadruple {35321#true} {36705#(<= ~counter~0 17)} #59#return; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:52,244 INFO L290 TraceCheckUtils]: 375: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,245 INFO L290 TraceCheckUtils]: 374: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,245 INFO L290 TraceCheckUtils]: 373: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,245 INFO L272 TraceCheckUtils]: 372: Hoare triple {36705#(<= ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,245 INFO L290 TraceCheckUtils]: 371: Hoare triple {36705#(<= ~counter~0 17)} assume !!(#t~post5 < 50);havoc #t~post5; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:52,246 INFO L290 TraceCheckUtils]: 370: Hoare triple {36620#(<= ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36705#(<= ~counter~0 17)} is VALID [2022-04-07 13:06:52,247 INFO L290 TraceCheckUtils]: 369: Hoare triple {36620#(<= ~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; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:52,247 INFO L284 TraceCheckUtils]: 368: Hoare quadruple {35321#true} {36620#(<= ~counter~0 16)} #67#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:52,247 INFO L290 TraceCheckUtils]: 367: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,247 INFO L290 TraceCheckUtils]: 366: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,248 INFO L290 TraceCheckUtils]: 365: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,248 INFO L272 TraceCheckUtils]: 364: Hoare triple {36620#(<= ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,248 INFO L284 TraceCheckUtils]: 363: Hoare quadruple {35321#true} {36620#(<= ~counter~0 16)} #65#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:52,248 INFO L290 TraceCheckUtils]: 362: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,248 INFO L290 TraceCheckUtils]: 361: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,248 INFO L290 TraceCheckUtils]: 360: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,249 INFO L272 TraceCheckUtils]: 359: Hoare triple {36620#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,249 INFO L284 TraceCheckUtils]: 358: Hoare quadruple {35321#true} {36620#(<= ~counter~0 16)} #63#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:52,249 INFO L290 TraceCheckUtils]: 357: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,249 INFO L290 TraceCheckUtils]: 356: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,249 INFO L290 TraceCheckUtils]: 355: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,249 INFO L272 TraceCheckUtils]: 354: Hoare triple {36620#(<= ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,250 INFO L284 TraceCheckUtils]: 353: Hoare quadruple {35321#true} {36620#(<= ~counter~0 16)} #61#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:52,250 INFO L290 TraceCheckUtils]: 352: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,250 INFO L290 TraceCheckUtils]: 351: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,250 INFO L290 TraceCheckUtils]: 350: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,250 INFO L272 TraceCheckUtils]: 349: Hoare triple {36620#(<= ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,251 INFO L284 TraceCheckUtils]: 348: Hoare quadruple {35321#true} {36620#(<= ~counter~0 16)} #59#return; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:52,251 INFO L290 TraceCheckUtils]: 347: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,251 INFO L290 TraceCheckUtils]: 346: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,251 INFO L290 TraceCheckUtils]: 345: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,251 INFO L272 TraceCheckUtils]: 344: Hoare triple {36620#(<= ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,251 INFO L290 TraceCheckUtils]: 343: Hoare triple {36620#(<= ~counter~0 16)} assume !!(#t~post5 < 50);havoc #t~post5; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:52,253 INFO L290 TraceCheckUtils]: 342: Hoare triple {36535#(<= ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36620#(<= ~counter~0 16)} is VALID [2022-04-07 13:06:52,253 INFO L290 TraceCheckUtils]: 341: Hoare triple {36535#(<= ~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; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:52,253 INFO L284 TraceCheckUtils]: 340: Hoare quadruple {35321#true} {36535#(<= ~counter~0 15)} #67#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:52,254 INFO L290 TraceCheckUtils]: 339: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,254 INFO L290 TraceCheckUtils]: 338: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,254 INFO L290 TraceCheckUtils]: 337: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,254 INFO L272 TraceCheckUtils]: 336: Hoare triple {36535#(<= ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,254 INFO L284 TraceCheckUtils]: 335: Hoare quadruple {35321#true} {36535#(<= ~counter~0 15)} #65#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:52,254 INFO L290 TraceCheckUtils]: 334: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,254 INFO L290 TraceCheckUtils]: 333: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,254 INFO L290 TraceCheckUtils]: 332: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,254 INFO L272 TraceCheckUtils]: 331: Hoare triple {36535#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,255 INFO L284 TraceCheckUtils]: 330: Hoare quadruple {35321#true} {36535#(<= ~counter~0 15)} #63#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:52,255 INFO L290 TraceCheckUtils]: 329: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,255 INFO L290 TraceCheckUtils]: 328: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,255 INFO L290 TraceCheckUtils]: 327: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,255 INFO L272 TraceCheckUtils]: 326: Hoare triple {36535#(<= ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,256 INFO L284 TraceCheckUtils]: 325: Hoare quadruple {35321#true} {36535#(<= ~counter~0 15)} #61#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:52,256 INFO L290 TraceCheckUtils]: 324: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,256 INFO L290 TraceCheckUtils]: 323: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,256 INFO L290 TraceCheckUtils]: 322: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,256 INFO L272 TraceCheckUtils]: 321: Hoare triple {36535#(<= ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,259 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {35321#true} {36535#(<= ~counter~0 15)} #59#return; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:52,259 INFO L290 TraceCheckUtils]: 319: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,259 INFO L290 TraceCheckUtils]: 318: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,260 INFO L290 TraceCheckUtils]: 317: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,260 INFO L272 TraceCheckUtils]: 316: Hoare triple {36535#(<= ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,260 INFO L290 TraceCheckUtils]: 315: Hoare triple {36535#(<= ~counter~0 15)} assume !!(#t~post5 < 50);havoc #t~post5; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:52,261 INFO L290 TraceCheckUtils]: 314: Hoare triple {36450#(<= ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36535#(<= ~counter~0 15)} is VALID [2022-04-07 13:06:52,261 INFO L290 TraceCheckUtils]: 313: Hoare triple {36450#(<= ~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; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:52,262 INFO L284 TraceCheckUtils]: 312: Hoare quadruple {35321#true} {36450#(<= ~counter~0 14)} #67#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:52,262 INFO L290 TraceCheckUtils]: 311: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,262 INFO L290 TraceCheckUtils]: 310: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,262 INFO L290 TraceCheckUtils]: 309: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,262 INFO L272 TraceCheckUtils]: 308: Hoare triple {36450#(<= ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,263 INFO L284 TraceCheckUtils]: 307: Hoare quadruple {35321#true} {36450#(<= ~counter~0 14)} #65#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:52,263 INFO L290 TraceCheckUtils]: 306: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,263 INFO L290 TraceCheckUtils]: 305: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,263 INFO L290 TraceCheckUtils]: 304: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,263 INFO L272 TraceCheckUtils]: 303: Hoare triple {36450#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,264 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {35321#true} {36450#(<= ~counter~0 14)} #63#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:52,264 INFO L290 TraceCheckUtils]: 301: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,264 INFO L290 TraceCheckUtils]: 300: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,264 INFO L290 TraceCheckUtils]: 299: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,264 INFO L272 TraceCheckUtils]: 298: Hoare triple {36450#(<= ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,265 INFO L284 TraceCheckUtils]: 297: Hoare quadruple {35321#true} {36450#(<= ~counter~0 14)} #61#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:52,265 INFO L290 TraceCheckUtils]: 296: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,265 INFO L290 TraceCheckUtils]: 295: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,265 INFO L290 TraceCheckUtils]: 294: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,265 INFO L272 TraceCheckUtils]: 293: Hoare triple {36450#(<= ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,266 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {35321#true} {36450#(<= ~counter~0 14)} #59#return; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:52,266 INFO L290 TraceCheckUtils]: 291: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,266 INFO L290 TraceCheckUtils]: 290: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,266 INFO L290 TraceCheckUtils]: 289: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,266 INFO L272 TraceCheckUtils]: 288: Hoare triple {36450#(<= ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,266 INFO L290 TraceCheckUtils]: 287: Hoare triple {36450#(<= ~counter~0 14)} assume !!(#t~post5 < 50);havoc #t~post5; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:52,268 INFO L290 TraceCheckUtils]: 286: Hoare triple {36365#(<= ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36450#(<= ~counter~0 14)} is VALID [2022-04-07 13:06:52,268 INFO L290 TraceCheckUtils]: 285: Hoare triple {36365#(<= ~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; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:52,269 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {35321#true} {36365#(<= ~counter~0 13)} #67#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:52,269 INFO L290 TraceCheckUtils]: 283: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,269 INFO L290 TraceCheckUtils]: 282: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,269 INFO L290 TraceCheckUtils]: 281: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,269 INFO L272 TraceCheckUtils]: 280: Hoare triple {36365#(<= ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,270 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {35321#true} {36365#(<= ~counter~0 13)} #65#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:52,270 INFO L290 TraceCheckUtils]: 278: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,270 INFO L290 TraceCheckUtils]: 277: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,270 INFO L290 TraceCheckUtils]: 276: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,270 INFO L272 TraceCheckUtils]: 275: Hoare triple {36365#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,271 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {35321#true} {36365#(<= ~counter~0 13)} #63#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:52,271 INFO L290 TraceCheckUtils]: 273: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,271 INFO L290 TraceCheckUtils]: 272: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,271 INFO L290 TraceCheckUtils]: 271: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,271 INFO L272 TraceCheckUtils]: 270: Hoare triple {36365#(<= ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,272 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {35321#true} {36365#(<= ~counter~0 13)} #61#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:52,272 INFO L290 TraceCheckUtils]: 268: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,272 INFO L290 TraceCheckUtils]: 267: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,272 INFO L290 TraceCheckUtils]: 266: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,272 INFO L272 TraceCheckUtils]: 265: Hoare triple {36365#(<= ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,273 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {35321#true} {36365#(<= ~counter~0 13)} #59#return; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:52,273 INFO L290 TraceCheckUtils]: 263: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,273 INFO L290 TraceCheckUtils]: 262: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,273 INFO L290 TraceCheckUtils]: 261: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,273 INFO L272 TraceCheckUtils]: 260: Hoare triple {36365#(<= ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,273 INFO L290 TraceCheckUtils]: 259: Hoare triple {36365#(<= ~counter~0 13)} assume !!(#t~post5 < 50);havoc #t~post5; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:52,275 INFO L290 TraceCheckUtils]: 258: Hoare triple {36280#(<= ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36365#(<= ~counter~0 13)} is VALID [2022-04-07 13:06:52,275 INFO L290 TraceCheckUtils]: 257: Hoare triple {36280#(<= ~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; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:52,276 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {35321#true} {36280#(<= ~counter~0 12)} #67#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:52,276 INFO L290 TraceCheckUtils]: 255: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,276 INFO L290 TraceCheckUtils]: 254: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,276 INFO L290 TraceCheckUtils]: 253: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,276 INFO L272 TraceCheckUtils]: 252: Hoare triple {36280#(<= ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,277 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {35321#true} {36280#(<= ~counter~0 12)} #65#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:52,277 INFO L290 TraceCheckUtils]: 250: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,277 INFO L290 TraceCheckUtils]: 249: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,277 INFO L290 TraceCheckUtils]: 248: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,277 INFO L272 TraceCheckUtils]: 247: Hoare triple {36280#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,278 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {35321#true} {36280#(<= ~counter~0 12)} #63#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:52,278 INFO L290 TraceCheckUtils]: 245: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,278 INFO L290 TraceCheckUtils]: 244: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,278 INFO L290 TraceCheckUtils]: 243: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,278 INFO L272 TraceCheckUtils]: 242: Hoare triple {36280#(<= ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,279 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {35321#true} {36280#(<= ~counter~0 12)} #61#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:52,279 INFO L290 TraceCheckUtils]: 240: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,279 INFO L290 TraceCheckUtils]: 239: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,279 INFO L290 TraceCheckUtils]: 238: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,279 INFO L272 TraceCheckUtils]: 237: Hoare triple {36280#(<= ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,280 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {35321#true} {36280#(<= ~counter~0 12)} #59#return; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:52,280 INFO L290 TraceCheckUtils]: 235: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,280 INFO L290 TraceCheckUtils]: 234: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,280 INFO L290 TraceCheckUtils]: 233: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,280 INFO L272 TraceCheckUtils]: 232: Hoare triple {36280#(<= ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,280 INFO L290 TraceCheckUtils]: 231: Hoare triple {36280#(<= ~counter~0 12)} assume !!(#t~post5 < 50);havoc #t~post5; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:52,282 INFO L290 TraceCheckUtils]: 230: Hoare triple {36195#(<= ~counter~0 11)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36280#(<= ~counter~0 12)} is VALID [2022-04-07 13:06:52,282 INFO L290 TraceCheckUtils]: 229: Hoare triple {36195#(<= ~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; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:52,283 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {35321#true} {36195#(<= ~counter~0 11)} #67#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:52,283 INFO L290 TraceCheckUtils]: 227: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,283 INFO L290 TraceCheckUtils]: 226: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,283 INFO L290 TraceCheckUtils]: 225: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,283 INFO L272 TraceCheckUtils]: 224: Hoare triple {36195#(<= ~counter~0 11)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,284 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {35321#true} {36195#(<= ~counter~0 11)} #65#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:52,284 INFO L290 TraceCheckUtils]: 222: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,284 INFO L290 TraceCheckUtils]: 221: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,284 INFO L290 TraceCheckUtils]: 220: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,284 INFO L272 TraceCheckUtils]: 219: Hoare triple {36195#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,285 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {35321#true} {36195#(<= ~counter~0 11)} #63#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:52,285 INFO L290 TraceCheckUtils]: 217: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,285 INFO L290 TraceCheckUtils]: 216: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,285 INFO L290 TraceCheckUtils]: 215: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,285 INFO L272 TraceCheckUtils]: 214: Hoare triple {36195#(<= ~counter~0 11)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,286 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {35321#true} {36195#(<= ~counter~0 11)} #61#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:52,286 INFO L290 TraceCheckUtils]: 212: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,286 INFO L290 TraceCheckUtils]: 211: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,286 INFO L290 TraceCheckUtils]: 210: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,286 INFO L272 TraceCheckUtils]: 209: Hoare triple {36195#(<= ~counter~0 11)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,287 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {35321#true} {36195#(<= ~counter~0 11)} #59#return; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:52,287 INFO L290 TraceCheckUtils]: 207: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,287 INFO L290 TraceCheckUtils]: 206: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,287 INFO L290 TraceCheckUtils]: 205: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,287 INFO L272 TraceCheckUtils]: 204: Hoare triple {36195#(<= ~counter~0 11)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,287 INFO L290 TraceCheckUtils]: 203: Hoare triple {36195#(<= ~counter~0 11)} assume !!(#t~post5 < 50);havoc #t~post5; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:52,288 INFO L290 TraceCheckUtils]: 202: Hoare triple {36110#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36195#(<= ~counter~0 11)} is VALID [2022-04-07 13:06:52,289 INFO L290 TraceCheckUtils]: 201: Hoare triple {36110#(<= ~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; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:52,290 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {35321#true} {36110#(<= ~counter~0 10)} #67#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:52,290 INFO L290 TraceCheckUtils]: 199: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,290 INFO L290 TraceCheckUtils]: 198: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,290 INFO L290 TraceCheckUtils]: 197: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,290 INFO L272 TraceCheckUtils]: 196: Hoare triple {36110#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,291 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {35321#true} {36110#(<= ~counter~0 10)} #65#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:52,291 INFO L290 TraceCheckUtils]: 194: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,291 INFO L290 TraceCheckUtils]: 193: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,291 INFO L290 TraceCheckUtils]: 192: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,291 INFO L272 TraceCheckUtils]: 191: Hoare triple {36110#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,292 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {35321#true} {36110#(<= ~counter~0 10)} #63#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:52,292 INFO L290 TraceCheckUtils]: 189: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,292 INFO L290 TraceCheckUtils]: 188: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,292 INFO L290 TraceCheckUtils]: 187: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,292 INFO L272 TraceCheckUtils]: 186: Hoare triple {36110#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,292 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {35321#true} {36110#(<= ~counter~0 10)} #61#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:52,292 INFO L290 TraceCheckUtils]: 184: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,293 INFO L290 TraceCheckUtils]: 183: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,293 INFO L290 TraceCheckUtils]: 182: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,293 INFO L272 TraceCheckUtils]: 181: Hoare triple {36110#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,293 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {35321#true} {36110#(<= ~counter~0 10)} #59#return; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:52,293 INFO L290 TraceCheckUtils]: 179: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,293 INFO L290 TraceCheckUtils]: 178: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,294 INFO L290 TraceCheckUtils]: 177: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,294 INFO L272 TraceCheckUtils]: 176: Hoare triple {36110#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,294 INFO L290 TraceCheckUtils]: 175: Hoare triple {36110#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:52,295 INFO L290 TraceCheckUtils]: 174: Hoare triple {36025#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36110#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:52,295 INFO L290 TraceCheckUtils]: 173: Hoare triple {36025#(<= ~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; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:52,296 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {35321#true} {36025#(<= ~counter~0 9)} #67#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:52,296 INFO L290 TraceCheckUtils]: 171: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,296 INFO L290 TraceCheckUtils]: 170: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,296 INFO L290 TraceCheckUtils]: 169: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,296 INFO L272 TraceCheckUtils]: 168: Hoare triple {36025#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,297 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {35321#true} {36025#(<= ~counter~0 9)} #65#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:52,297 INFO L290 TraceCheckUtils]: 166: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,297 INFO L290 TraceCheckUtils]: 165: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,297 INFO L290 TraceCheckUtils]: 164: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,297 INFO L272 TraceCheckUtils]: 163: Hoare triple {36025#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,298 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {35321#true} {36025#(<= ~counter~0 9)} #63#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:52,298 INFO L290 TraceCheckUtils]: 161: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,298 INFO L290 TraceCheckUtils]: 160: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,298 INFO L290 TraceCheckUtils]: 159: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,298 INFO L272 TraceCheckUtils]: 158: Hoare triple {36025#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,299 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {35321#true} {36025#(<= ~counter~0 9)} #61#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:52,299 INFO L290 TraceCheckUtils]: 156: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,299 INFO L290 TraceCheckUtils]: 155: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,299 INFO L290 TraceCheckUtils]: 154: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,299 INFO L272 TraceCheckUtils]: 153: Hoare triple {36025#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,300 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {35321#true} {36025#(<= ~counter~0 9)} #59#return; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:52,300 INFO L290 TraceCheckUtils]: 151: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,300 INFO L290 TraceCheckUtils]: 150: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,300 INFO L290 TraceCheckUtils]: 149: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,300 INFO L272 TraceCheckUtils]: 148: Hoare triple {36025#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,300 INFO L290 TraceCheckUtils]: 147: Hoare triple {36025#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:52,301 INFO L290 TraceCheckUtils]: 146: Hoare triple {35940#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {36025#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:52,302 INFO L290 TraceCheckUtils]: 145: Hoare triple {35940#(<= ~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; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:52,302 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {35321#true} {35940#(<= ~counter~0 8)} #67#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:52,302 INFO L290 TraceCheckUtils]: 143: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,303 INFO L290 TraceCheckUtils]: 142: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,303 INFO L290 TraceCheckUtils]: 141: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,303 INFO L272 TraceCheckUtils]: 140: Hoare triple {35940#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,303 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {35321#true} {35940#(<= ~counter~0 8)} #65#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:52,303 INFO L290 TraceCheckUtils]: 138: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,303 INFO L290 TraceCheckUtils]: 137: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,303 INFO L290 TraceCheckUtils]: 136: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,304 INFO L272 TraceCheckUtils]: 135: Hoare triple {35940#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,304 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {35321#true} {35940#(<= ~counter~0 8)} #63#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:52,304 INFO L290 TraceCheckUtils]: 133: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,304 INFO L290 TraceCheckUtils]: 132: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,304 INFO L290 TraceCheckUtils]: 131: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,304 INFO L272 TraceCheckUtils]: 130: Hoare triple {35940#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,305 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {35321#true} {35940#(<= ~counter~0 8)} #61#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:52,305 INFO L290 TraceCheckUtils]: 128: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,305 INFO L290 TraceCheckUtils]: 127: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,305 INFO L290 TraceCheckUtils]: 126: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,305 INFO L272 TraceCheckUtils]: 125: Hoare triple {35940#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,306 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {35321#true} {35940#(<= ~counter~0 8)} #59#return; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:52,306 INFO L290 TraceCheckUtils]: 123: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,306 INFO L290 TraceCheckUtils]: 122: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,306 INFO L290 TraceCheckUtils]: 121: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,306 INFO L272 TraceCheckUtils]: 120: Hoare triple {35940#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,306 INFO L290 TraceCheckUtils]: 119: Hoare triple {35940#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:52,307 INFO L290 TraceCheckUtils]: 118: Hoare triple {35855#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35940#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:52,308 INFO L290 TraceCheckUtils]: 117: Hoare triple {35855#(<= ~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; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:52,308 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {35321#true} {35855#(<= ~counter~0 7)} #67#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:52,308 INFO L290 TraceCheckUtils]: 115: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,308 INFO L290 TraceCheckUtils]: 114: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,308 INFO L290 TraceCheckUtils]: 113: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,309 INFO L272 TraceCheckUtils]: 112: Hoare triple {35855#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,309 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {35321#true} {35855#(<= ~counter~0 7)} #65#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:52,309 INFO L290 TraceCheckUtils]: 110: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,309 INFO L290 TraceCheckUtils]: 109: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,309 INFO L290 TraceCheckUtils]: 108: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,309 INFO L272 TraceCheckUtils]: 107: Hoare triple {35855#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,310 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {35321#true} {35855#(<= ~counter~0 7)} #63#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:52,310 INFO L290 TraceCheckUtils]: 105: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,310 INFO L290 TraceCheckUtils]: 104: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,310 INFO L290 TraceCheckUtils]: 103: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,310 INFO L272 TraceCheckUtils]: 102: Hoare triple {35855#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,337 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {35321#true} {35855#(<= ~counter~0 7)} #61#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:52,337 INFO L290 TraceCheckUtils]: 100: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,337 INFO L290 TraceCheckUtils]: 99: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,337 INFO L290 TraceCheckUtils]: 98: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,337 INFO L272 TraceCheckUtils]: 97: Hoare triple {35855#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,338 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {35321#true} {35855#(<= ~counter~0 7)} #59#return; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:52,338 INFO L290 TraceCheckUtils]: 95: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,338 INFO L290 TraceCheckUtils]: 94: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,338 INFO L290 TraceCheckUtils]: 93: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,338 INFO L272 TraceCheckUtils]: 92: Hoare triple {35855#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,339 INFO L290 TraceCheckUtils]: 91: Hoare triple {35855#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:52,340 INFO L290 TraceCheckUtils]: 90: Hoare triple {35770#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35855#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:52,340 INFO L290 TraceCheckUtils]: 89: Hoare triple {35770#(<= ~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; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:52,340 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {35321#true} {35770#(<= ~counter~0 6)} #67#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:52,341 INFO L290 TraceCheckUtils]: 87: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,341 INFO L290 TraceCheckUtils]: 86: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,341 INFO L290 TraceCheckUtils]: 85: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,341 INFO L272 TraceCheckUtils]: 84: Hoare triple {35770#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,341 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {35321#true} {35770#(<= ~counter~0 6)} #65#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:52,341 INFO L290 TraceCheckUtils]: 82: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,341 INFO L290 TraceCheckUtils]: 81: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,342 INFO L272 TraceCheckUtils]: 79: Hoare triple {35770#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,342 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {35321#true} {35770#(<= ~counter~0 6)} #63#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:52,342 INFO L290 TraceCheckUtils]: 77: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,342 INFO L290 TraceCheckUtils]: 76: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,342 INFO L290 TraceCheckUtils]: 75: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,342 INFO L272 TraceCheckUtils]: 74: Hoare triple {35770#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,343 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {35321#true} {35770#(<= ~counter~0 6)} #61#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:52,343 INFO L290 TraceCheckUtils]: 72: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,343 INFO L290 TraceCheckUtils]: 71: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,343 INFO L290 TraceCheckUtils]: 70: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,343 INFO L272 TraceCheckUtils]: 69: Hoare triple {35770#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,344 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {35321#true} {35770#(<= ~counter~0 6)} #59#return; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:52,344 INFO L290 TraceCheckUtils]: 67: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,344 INFO L290 TraceCheckUtils]: 66: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,344 INFO L290 TraceCheckUtils]: 65: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,344 INFO L272 TraceCheckUtils]: 64: Hoare triple {35770#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,344 INFO L290 TraceCheckUtils]: 63: Hoare triple {35770#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:52,345 INFO L290 TraceCheckUtils]: 62: Hoare triple {35685#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35770#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:52,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {35685#(<= ~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; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:52,346 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {35321#true} {35685#(<= ~counter~0 5)} #67#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:52,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,346 INFO L290 TraceCheckUtils]: 57: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,346 INFO L272 TraceCheckUtils]: 56: Hoare triple {35685#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,346 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {35321#true} {35685#(<= ~counter~0 5)} #65#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:52,346 INFO L290 TraceCheckUtils]: 54: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,347 INFO L290 TraceCheckUtils]: 53: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,347 INFO L272 TraceCheckUtils]: 51: Hoare triple {35685#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,347 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {35321#true} {35685#(<= ~counter~0 5)} #63#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:52,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,347 INFO L290 TraceCheckUtils]: 47: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,347 INFO L272 TraceCheckUtils]: 46: Hoare triple {35685#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,348 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {35321#true} {35685#(<= ~counter~0 5)} #61#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:52,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,348 INFO L272 TraceCheckUtils]: 41: Hoare triple {35685#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,348 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {35321#true} {35685#(<= ~counter~0 5)} #59#return; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:52,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,349 INFO L272 TraceCheckUtils]: 36: Hoare triple {35685#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {35685#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:52,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {35600#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35685#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:52,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {35600#(<= ~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; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:52,350 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {35321#true} {35600#(<= ~counter~0 4)} #67#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:52,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,351 INFO L272 TraceCheckUtils]: 28: Hoare triple {35600#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,351 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {35321#true} {35600#(<= ~counter~0 4)} #65#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:52,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,351 INFO L272 TraceCheckUtils]: 23: Hoare triple {35600#(<= ~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)); {35321#true} is VALID [2022-04-07 13:06:52,352 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35321#true} {35600#(<= ~counter~0 4)} #63#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:52,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,352 INFO L272 TraceCheckUtils]: 18: Hoare triple {35600#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,352 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35321#true} {35600#(<= ~counter~0 4)} #61#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:52,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,353 INFO L272 TraceCheckUtils]: 13: Hoare triple {35600#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,353 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35321#true} {35600#(<= ~counter~0 4)} #59#return; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:52,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {35321#true} assume true; {35321#true} is VALID [2022-04-07 13:06:52,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {35321#true} assume !(0 == ~cond); {35321#true} is VALID [2022-04-07 13:06:52,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {35321#true} ~cond := #in~cond; {35321#true} is VALID [2022-04-07 13:06:52,353 INFO L272 TraceCheckUtils]: 8: Hoare triple {35600#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35321#true} is VALID [2022-04-07 13:06:52,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {35600#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:52,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {35515#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {35600#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:52,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {35515#(<= ~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; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:52,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {35515#(<= ~counter~0 3)} call #t~ret6 := main(); {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:52,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35515#(<= ~counter~0 3)} {35321#true} #81#return; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:52,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {35515#(<= ~counter~0 3)} assume true; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:52,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {35321#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; {35515#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:52,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {35321#true} call ULTIMATE.init(); {35321#true} is VALID [2022-04-07 13:06:52,362 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-07 13:06:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:06:52,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420424535] [2022-04-07 13:06:52,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:06:52,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366499815] [2022-04-07 13:06:52,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366499815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:06:52,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:06:52,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-04-07 13:06:52,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407993362] [2022-04-07 13:06:52,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:06:52,367 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