/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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:56:39,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:56:39,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:56:39,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:56:39,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:56:39,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:56:39,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:56:39,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:56:39,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:56:39,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:56:39,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:56:39,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:56:39,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:56:39,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:56:39,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:56:39,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:56:39,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:56:39,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:56:39,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:56:39,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:56:39,244 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:56:39,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:56:39,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:56:39,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:56:39,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:56:39,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:56:39,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:56:39,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:56:39,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:56:39,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:56:39,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:56:39,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:56:39,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:56:39,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:56:39,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:56:39,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:56:39,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:56:39,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:56:39,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:56:39,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:56:39,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:56:39,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:56:39,258 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:56:39,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:56:39,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:56:39,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:56:39,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:56:39,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:56:39,282 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:56:39,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:56:39,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:56:39,283 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:56:39,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:56:39,283 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:56:39,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:56:39,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:56:39,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:56:39,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:56:39,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:56:39,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:56:39,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:56:39,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:56:39,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:56:39,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:56:39,285 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:56:39,285 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:56:39,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:56:39,285 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:56:39,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:56:39,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:56:39,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:56:39,476 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:56:39,477 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:56:39,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-04-07 12:56:39,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38518a5bd/37159b0e17a84304800e842f8828bf77/FLAG214f30806 [2022-04-07 12:56:39,861 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:56:39,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-04-07 12:56:39,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38518a5bd/37159b0e17a84304800e842f8828bf77/FLAG214f30806 [2022-04-07 12:56:39,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38518a5bd/37159b0e17a84304800e842f8828bf77 [2022-04-07 12:56:39,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:56:39,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:56:39,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:56:39,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:56:39,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:56:39,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:56:39" (1/1) ... [2022-04-07 12:56:39,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ecd015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:39, skipping insertion in model container [2022-04-07 12:56:39,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:56:39" (1/1) ... [2022-04-07 12:56:39,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:56:39,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:56:40,028 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_unwindbound20.c[588,601] [2022-04-07 12:56:40,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:56:40,050 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:56:40,057 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_unwindbound20.c[588,601] [2022-04-07 12:56:40,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:56:40,077 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:56:40,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40 WrapperNode [2022-04-07 12:56:40,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:56:40,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:56:40,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:56:40,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:56:40,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40" (1/1) ... [2022-04-07 12:56:40,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40" (1/1) ... [2022-04-07 12:56:40,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40" (1/1) ... [2022-04-07 12:56:40,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40" (1/1) ... [2022-04-07 12:56:40,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40" (1/1) ... [2022-04-07 12:56:40,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40" (1/1) ... [2022-04-07 12:56:40,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40" (1/1) ... [2022-04-07 12:56:40,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:56:40,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:56:40,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:56:40,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:56:40,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40" (1/1) ... [2022-04-07 12:56:40,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:56:40,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:40,127 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:56:40,128 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:56:40,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:56:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:56:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:56:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:56:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:56:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:56:40,149 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:56:40,149 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:56:40,149 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:56:40,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:56:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:56:40,190 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:56:40,191 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:56:40,297 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:56:40,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:56:40,302 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:56:40,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:56:40 BoogieIcfgContainer [2022-04-07 12:56:40,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:56:40,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:56:40,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:56:40,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:56:40,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:56:39" (1/3) ... [2022-04-07 12:56:40,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7528bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:56:40, skipping insertion in model container [2022-04-07 12:56:40,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:56:40" (2/3) ... [2022-04-07 12:56:40,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7528bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:56:40, skipping insertion in model container [2022-04-07 12:56:40,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:56:40" (3/3) ... [2022-04-07 12:56:40,309 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2022-04-07 12:56:40,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:56:40,312 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:56:40,340 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:56:40,344 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:56:40,344 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:56:40,357 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:56:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 12:56:40,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:40,360 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:40,361 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:40,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-07 12:56:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:40,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238007969] [2022-04-07 12:56:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:56:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:40,557 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:56:40,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:56:40,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-07 12:56:40,562 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:56:40,562 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:56:40,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:56:40,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-07 12:56:40,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-07 12:56:40,563 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:56:40,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-07 12:56:40,565 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:56:40,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-07 12:56:40,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-07 12:56:40,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-07 12:56:40,566 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:56:40,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:40,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238007969] [2022-04-07 12:56:40,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238007969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:40,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:40,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:56:40,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098576232] [2022-04-07 12:56:40,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:40,573 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:56:40,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:40,580 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:56:40,605 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:56:40,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:56:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:40,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:56:40,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:56:40,635 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:56:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:40,848 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-07 12:56:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:56:40,848 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:56:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:40,849 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:56:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 12:56:40,859 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:56:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-07 12:56:40,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-07 12:56:40,961 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:56:40,971 INFO L225 Difference]: With dead ends: 57 [2022-04-07 12:56:40,971 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 12:56:40,975 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:56:40,979 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:56:40,980 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:56:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 12:56:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-07 12:56:41,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:41,012 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:56:41,013 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:56:41,013 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:56:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:41,020 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 12:56:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 12:56:41,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:41,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:41,022 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:56:41,023 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:56:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:41,034 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-07 12:56:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-07 12:56:41,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:41,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:41,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:41,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:41,035 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:56:41,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-07 12:56:41,040 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-07 12:56:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:41,040 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-07 12:56:41,041 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:56:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-07 12:56:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:56:41,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:41,042 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:41,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:56:41,043 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:41,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:41,043 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-07 12:56:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:41,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647630098] [2022-04-07 12:56:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:41,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:56:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:41,122 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:56:41,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:41,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:41,124 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:56:41,124 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:56:41,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= ~counter~0 0)} assume true; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:41,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#(= ~counter~0 0)} {227#true} #81#return; {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:41,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#(= ~counter~0 0)} call #t~ret6 := main(); {232#(= ~counter~0 0)} is VALID [2022-04-07 12:56:41,126 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:56:41,126 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:56:41,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {228#false} is VALID [2022-04-07 12:56:41,127 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:56:41,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-07 12:56:41,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-07 12:56:41,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-07 12:56:41,127 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:56:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:41,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647630098] [2022-04-07 12:56:41,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647630098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:41,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:41,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 12:56:41,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285459932] [2022-04-07 12:56:41,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:41,129 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:56:41,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:41,129 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:56:41,138 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:56:41,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:56:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:56:41,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:56:41,139 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:56:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:41,332 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-07 12:56:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:56:41,332 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:56:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:41,333 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:56:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 12:56:41,338 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:56:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-07 12:56:41,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-07 12:56:41,386 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:56:41,387 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:56:41,388 INFO L226 Difference]: Without dead ends: 28 [2022-04-07 12:56:41,390 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:56:41,392 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:56:41,392 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:56:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-07 12:56:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-07 12:56:41,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:41,400 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:56:41,400 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:56:41,401 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:56:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:41,405 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 12:56:41,405 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:56:41,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:41,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:41,406 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:56:41,406 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:56:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:41,407 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-07 12:56:41,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:56:41,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:41,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:41,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:41,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:41,408 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:56:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-07 12:56:41,410 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-07 12:56:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:41,410 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-07 12:56:41,410 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:56:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-07 12:56:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 12:56:41,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:41,411 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:56:41,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 12:56:41,411 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:41,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-07 12:56:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:41,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206225655] [2022-04-07 12:56:41,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:41,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:56:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:41,513 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:56:41,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-07 12:56:41,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-07 12:56:41,515 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:56:41,515 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:56:41,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {406#true} assume true; {406#true} is VALID [2022-04-07 12:56:41,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {406#true} {406#true} #81#return; {406#true} is VALID [2022-04-07 12:56:41,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {406#true} call #t~ret6 := main(); {406#true} is VALID [2022-04-07 12:56:41,516 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:56:41,516 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:56:41,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 20);havoc #t~post5; {411#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-07 12:56:41,518 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:56:41,518 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:56:41,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {407#false} is VALID [2022-04-07 12:56:41,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {407#false} assume !false; {407#false} is VALID [2022-04-07 12:56:41,519 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:56:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:41,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206225655] [2022-04-07 12:56:41,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206225655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:41,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:41,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:56:41,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579610980] [2022-04-07 12:56:41,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:41,531 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:56:41,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:41,532 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:56:41,542 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:56:41,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:56:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:41,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:56:41,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:56:41,546 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:56:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:41,847 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-07 12:56:41,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:56:41,848 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:56:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:41,848 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:56:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 12:56:41,849 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:56:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-07 12:56:41,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-07 12:56:41,889 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:56:41,890 INFO L225 Difference]: With dead ends: 34 [2022-04-07 12:56:41,890 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 12:56:41,890 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:56:41,891 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:41,891 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.1s Time] [2022-04-07 12:56:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 12:56:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 12:56:41,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:41,895 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:56:41,895 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:56:41,896 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:56:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:41,898 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:56:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:56:41,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:41,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:41,898 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:56:41,899 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:56:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:41,900 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:56:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:56:41,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:41,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:41,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:41,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:41,901 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:56:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-07 12:56:41,902 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-07 12:56:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:41,902 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-07 12:56:41,903 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:56:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:56:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:56:41,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:41,903 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:56:41,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 12:56:41,903 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:41,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-07 12:56:41,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:41,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068953250] [2022-04-07 12:56:41,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:41,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:41,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:41,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458321969] [2022-04-07 12:56:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:41,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:41,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:41,932 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:56:41,933 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:56:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:41,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:56:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:41,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:42,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-07 12:56:42,118 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:56:42,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-07 12:56:42,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {593#true} {593#true} #81#return; {593#true} is VALID [2022-04-07 12:56:42,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#true} call #t~ret6 := main(); {593#true} is VALID [2022-04-07 12:56:42,119 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:56:42,120 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:56:42,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {613#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:42,120 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:56:42,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {593#true} ~cond := #in~cond; {593#true} is VALID [2022-04-07 12:56:42,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {593#true} assume !(0 == ~cond); {593#true} is VALID [2022-04-07 12:56:42,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {593#true} assume true; {593#true} is VALID [2022-04-07 12:56:42,121 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:56:42,121 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:56:42,122 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:56:42,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {594#false} is VALID [2022-04-07 12:56:42,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-07 12:56:42,122 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:56:42,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:56:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:42,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068953250] [2022-04-07 12:56:42,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:42,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458321969] [2022-04-07 12:56:42,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458321969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:42,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:42,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:56:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614456380] [2022-04-07 12:56:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:42,124 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:56:42,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:42,124 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:56:42,135 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:56:42,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:56:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:42,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:56:42,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:56:42,136 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:56:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:44,939 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-07 12:56:44,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:56:44,939 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:56:44,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:44,939 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:56:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:44,941 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:56:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:44,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:56:44,992 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:56:44,993 INFO L225 Difference]: With dead ends: 50 [2022-04-07 12:56:44,993 INFO L226 Difference]: Without dead ends: 48 [2022-04-07 12:56:44,993 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:56:44,994 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:56:44,994 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:56:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-07 12:56:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-07 12:56:45,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:45,000 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:56:45,000 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:56:45,000 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:56:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:45,003 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 12:56:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 12:56:45,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:45,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:45,003 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:56:45,004 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:56:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:45,006 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-07 12:56:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-07 12:56:45,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:45,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:45,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:45,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:45,007 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:56:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-07 12:56:45,008 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-07 12:56:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:45,008 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-07 12:56:45,008 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:56:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-07 12:56:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 12:56:45,009 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:45,009 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:56:45,033 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:56:45,225 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:56:45,225 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-07 12:56:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:45,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477684632] [2022-04-07 12:56:45,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:45,235 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:45,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703975230] [2022-04-07 12:56:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:45,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:45,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:45,238 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:56:45,239 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:56:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:45,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:56:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:45,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:45,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {887#true} is VALID [2022-04-07 12:56:45,380 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:56:45,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:56:45,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #81#return; {887#true} is VALID [2022-04-07 12:56:45,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2022-04-07 12:56:45,381 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:56:45,382 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:56:45,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {907#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {907#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-07 12:56:45,382 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:56:45,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-07 12:56:45,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-07 12:56:45,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:56:45,383 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:56:45,385 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:56:45,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2022-04-07 12:56:45,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2022-04-07 12:56:45,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {887#true} assume true; {887#true} is VALID [2022-04-07 12:56:45,387 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:56:45,387 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:56:45,388 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:56:45,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {951#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {888#false} is VALID [2022-04-07 12:56:45,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {888#false} assume !false; {888#false} is VALID [2022-04-07 12:56:45,388 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:56:45,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:56:45,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:45,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477684632] [2022-04-07 12:56:45,389 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:45,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703975230] [2022-04-07 12:56:45,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703975230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:45,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:45,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:56:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168567695] [2022-04-07 12:56:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:45,389 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:56:45,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:45,390 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:56:45,400 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:56:45,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:56:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:45,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:56:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:56:45,401 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:56:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:45,669 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-07 12:56:45,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:56:45,669 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:56:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:45,669 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:56:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:45,672 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:56:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:45,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:56:45,733 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:56:45,734 INFO L225 Difference]: With dead ends: 54 [2022-04-07 12:56:45,735 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 12:56:45,735 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:56:45,735 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:45,736 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.0s Time] [2022-04-07 12:56:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 12:56:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-07 12:56:45,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:45,744 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:56:45,744 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:56:45,744 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:56:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:45,747 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:56:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:56:45,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:45,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:45,747 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:56:45,748 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:56:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:45,750 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-07 12:56:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-07 12:56:45,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:45,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:45,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:45,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:45,750 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:56:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-07 12:56:45,752 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-07 12:56:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:45,752 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-07 12:56:45,753 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:56:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-07 12:56:45,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-07 12:56:45,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:45,753 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:56:45,781 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:56:45,959 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:56:45,959 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-07 12:56:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:45,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834608431] [2022-04-07 12:56:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:45,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:45,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:45,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925496843] [2022-04-07 12:56:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:45,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:45,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:45,970 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:56:45,971 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:56:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:46,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 12:56:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:46,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:46,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {1225#true} call ULTIMATE.init(); {1225#true} is VALID [2022-04-07 12:56:46,116 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:56:46,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:56:46,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1225#true} {1225#true} #81#return; {1225#true} is VALID [2022-04-07 12:56:46,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {1225#true} call #t~ret6 := main(); {1225#true} is VALID [2022-04-07 12:56:46,117 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:56:46,117 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:56:46,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {1245#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:46,118 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:56:46,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:56:46,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:56:46,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:56:46,119 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:56:46,119 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:56:46,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:56:46,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:56:46,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:56:46,120 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:56:46,120 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:56:46,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#true} ~cond := #in~cond; {1225#true} is VALID [2022-04-07 12:56:46,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {1225#true} assume !(0 == ~cond); {1225#true} is VALID [2022-04-07 12:56:46,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {1225#true} assume true; {1225#true} is VALID [2022-04-07 12:56:46,121 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:56:46,122 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:56:46,122 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:56:46,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {1304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1226#false} is VALID [2022-04-07 12:56:46,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2022-04-07 12:56:46,123 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:56:46,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:56:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834608431] [2022-04-07 12:56:46,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:46,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925496843] [2022-04-07 12:56:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925496843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:56:46,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:56:46,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:56:46,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567092569] [2022-04-07 12:56:46,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:56:46,124 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:56:46,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:46,125 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:56:46,149 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:56:46,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:56:46,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:46,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:56:46,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:56:46,150 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:56:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:46,388 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-07 12:56:46,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:56:46,388 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:56:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:46,388 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:56:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:46,390 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:56:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-07 12:56:46,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-07 12:56:46,442 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:56:46,443 INFO L225 Difference]: With dead ends: 62 [2022-04-07 12:56:46,444 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 12:56:46,444 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:56:46,444 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:56:46,445 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:56:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 12:56:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-07 12:56:46,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:46,451 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:56:46,451 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:56:46,451 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:56:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:46,453 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 12:56:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:56:46,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:46,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:46,453 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:56:46,454 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:56:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:46,455 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-07 12:56:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:56:46,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:46,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:46,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:46,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:46,456 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:56:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-07 12:56:46,457 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-07 12:56:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:46,457 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-07 12:56:46,457 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:56:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-07 12:56:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 12:56:46,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:46,458 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:56:46,474 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:56:46,671 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:56:46,672 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-07 12:56:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:46,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861693360] [2022-04-07 12:56:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:46,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:46,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [12093167] [2022-04-07 12:56:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:46,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:46,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:46,683 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:56:46,684 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:56:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:46,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:56:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:46,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:46,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-07 12:56:46,888 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:56:46,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#(<= ~counter~0 0)} assume true; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:56:46,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1593#(<= ~counter~0 0)} {1585#true} #81#return; {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:56:46,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {1593#(<= ~counter~0 0)} call #t~ret6 := main(); {1593#(<= ~counter~0 0)} is VALID [2022-04-07 12:56:46,890 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:56:46,891 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:56:46,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,893 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:56:46,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,912 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:56:46,913 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:56:46,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,914 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:56:46,914 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:56:46,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,915 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:56:46,916 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:56:46,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,917 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:56:46,917 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:56:46,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= ~counter~0 1)} ~cond := #in~cond; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {1609#(<= ~counter~0 1)} assume !(0 == ~cond); {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {1609#(<= ~counter~0 1)} assume true; {1609#(<= ~counter~0 1)} is VALID [2022-04-07 12:56:46,919 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:56:46,919 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:56:46,919 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:56:46,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {1694#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {1586#false} is VALID [2022-04-07 12:56:46,920 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:56:46,920 INFO L290 TraceCheckUtils]: 37: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:56:46,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {1586#false} assume !(0 == ~cond); {1586#false} is VALID [2022-04-07 12:56:46,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {1586#false} assume true; {1586#false} is VALID [2022-04-07 12:56:46,920 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1586#false} {1586#false} #69#return; {1586#false} is VALID [2022-04-07 12:56:46,920 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:56:46,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:56:46,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-07 12:56:46,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-07 12:56:46,921 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:56:46,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:47,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2022-04-07 12:56:47,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2022-04-07 12:56:47,109 INFO L290 TraceCheckUtils]: 42: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2022-04-07 12:56:47,109 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:56:47,109 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1585#true} {1586#false} #69#return; {1586#false} is VALID [2022-04-07 12:56:47,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:47,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:47,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:47,109 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:56:47,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1586#false} is VALID [2022-04-07 12:56:47,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {1756#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1752#(< |main_#t~post5| 20)} is VALID [2022-04-07 12:56:47,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {1756#(< ~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; {1756#(< ~counter~0 20)} is VALID [2022-04-07 12:56:47,111 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #67#return; {1756#(< ~counter~0 20)} is VALID [2022-04-07 12:56:47,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:47,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:47,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:47,111 INFO L272 TraceCheckUtils]: 28: Hoare triple {1756#(< ~counter~0 20)} 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:56:47,112 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #65#return; {1756#(< ~counter~0 20)} is VALID [2022-04-07 12:56:47,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:47,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:47,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:47,112 INFO L272 TraceCheckUtils]: 23: Hoare triple {1756#(< ~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)); {1585#true} is VALID [2022-04-07 12:56:47,113 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #63#return; {1756#(< ~counter~0 20)} is VALID [2022-04-07 12:56:47,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:47,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:47,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:47,113 INFO L272 TraceCheckUtils]: 18: Hoare triple {1756#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:56:47,113 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #61#return; {1756#(< ~counter~0 20)} is VALID [2022-04-07 12:56:47,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:47,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:47,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:47,114 INFO L272 TraceCheckUtils]: 13: Hoare triple {1756#(< ~counter~0 20)} 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:56:47,114 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1585#true} {1756#(< ~counter~0 20)} #59#return; {1756#(< ~counter~0 20)} is VALID [2022-04-07 12:56:47,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {1585#true} assume true; {1585#true} is VALID [2022-04-07 12:56:47,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {1585#true} assume !(0 == ~cond); {1585#true} is VALID [2022-04-07 12:56:47,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1585#true} ~cond := #in~cond; {1585#true} is VALID [2022-04-07 12:56:47,115 INFO L272 TraceCheckUtils]: 8: Hoare triple {1756#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1585#true} is VALID [2022-04-07 12:56:47,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {1756#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1756#(< ~counter~0 20)} is VALID [2022-04-07 12:56:47,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1756#(< ~counter~0 20)} is VALID [2022-04-07 12:56:47,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#(< ~counter~0 19)} 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 19)} is VALID [2022-04-07 12:56:47,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#(< ~counter~0 19)} call #t~ret6 := main(); {1841#(< ~counter~0 19)} is VALID [2022-04-07 12:56:47,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#(< ~counter~0 19)} {1585#true} #81#return; {1841#(< ~counter~0 19)} is VALID [2022-04-07 12:56:47,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#(< ~counter~0 19)} assume true; {1841#(< ~counter~0 19)} is VALID [2022-04-07 12:56:47,119 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 19)} is VALID [2022-04-07 12:56:47,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2022-04-07 12:56:47,119 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:56:47,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:47,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861693360] [2022-04-07 12:56:47,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:47,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12093167] [2022-04-07 12:56:47,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12093167] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:47,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:47,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 12:56:47,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472197009] [2022-04-07 12:56:47,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:47,120 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:56:47,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:47,121 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:56:47,175 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:56:47,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:56:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:56:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:56:47,176 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:56:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:47,783 INFO L93 Difference]: Finished difference Result 120 states and 155 transitions. [2022-04-07 12:56:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:56:47,784 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:56:47,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:47,784 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:56:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-07 12:56:47,786 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:56:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2022-04-07 12:56:47,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 134 transitions. [2022-04-07 12:56:47,895 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:56:47,897 INFO L225 Difference]: With dead ends: 120 [2022-04-07 12:56:47,897 INFO L226 Difference]: Without dead ends: 104 [2022-04-07 12:56:47,897 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:56:47,898 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:47,898 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.1s Time] [2022-04-07 12:56:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-07 12:56:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-07 12:56:47,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:47,929 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:56:47,929 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:56:47,929 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:56:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:47,933 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-07 12:56:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-07 12:56:47,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:47,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:47,933 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:56:47,934 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:56:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:47,937 INFO L93 Difference]: Finished difference Result 104 states and 133 transitions. [2022-04-07 12:56:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2022-04-07 12:56:47,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:47,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:47,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:47,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:47,938 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:56:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2022-04-07 12:56:47,941 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 45 [2022-04-07 12:56:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:47,941 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2022-04-07 12:56:47,941 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:56:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2022-04-07 12:56:47,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-07 12:56:47,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:47,942 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:56:47,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 12:56:48,158 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:56:48,159 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1933038948, now seen corresponding path program 1 times [2022-04-07 12:56:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:48,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336338766] [2022-04-07 12:56:48,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:48,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:48,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:48,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869422598] [2022-04-07 12:56:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:48,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:48,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:48,169 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:56:48,170 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:56:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:48,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:56:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:48,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:48,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-07 12:56:48,395 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:56:48,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-07 12:56:48,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-07 12:56:48,396 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:56:48,396 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:56:48,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {2438#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:56:48,396 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:56:48,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,397 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:56:48,397 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:56:48,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,398 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:56:48,398 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:56:48,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,398 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:56:48,399 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:56:48,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,399 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,399 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:56:48,399 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:56:48,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,400 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:56:48,400 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:56:48,401 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:56:48,401 INFO L290 TraceCheckUtils]: 35: Hoare triple {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} assume !!(#t~post5 < 20);havoc #t~post5; {2523#(and (= (+ (- 1) main_~n~0) 0) (= (+ main_~y~0 (- 6)) 1))} is VALID [2022-04-07 12:56:48,401 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:56:48,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,401 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,402 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:56:48,402 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:56:48,403 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:56:48,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-07 12:56:48,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-07 12:56:48,408 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:56:48,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:48,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {2419#false} assume !false; {2419#false} is VALID [2022-04-07 12:56:48,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {2552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2419#false} is VALID [2022-04-07 12:56:48,581 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:56:48,583 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:56:48,583 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:56:48,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,584 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:56:48,584 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 < 20);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:56:48,587 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:56:48,591 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:56:48,592 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:56:48,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,592 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:56:48,593 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:56:48,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,593 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:56:48,593 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:56:48,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,594 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:56:48,594 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:56:48,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,594 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:56:48,595 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:56:48,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {2418#true} assume !(0 == ~cond); {2418#true} is VALID [2022-04-07 12:56:48,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {2418#true} ~cond := #in~cond; {2418#true} is VALID [2022-04-07 12:56:48,595 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:56:48,596 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 < 20);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:56:48,596 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:56:48,597 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:56:48,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {2418#true} call #t~ret6 := main(); {2418#true} is VALID [2022-04-07 12:56:48,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2418#true} {2418#true} #81#return; {2418#true} is VALID [2022-04-07 12:56:48,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {2418#true} assume true; {2418#true} is VALID [2022-04-07 12:56:48,597 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:56:48,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {2418#true} call ULTIMATE.init(); {2418#true} is VALID [2022-04-07 12:56:48,597 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:56:48,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:48,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336338766] [2022-04-07 12:56:48,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:48,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869422598] [2022-04-07 12:56:48,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869422598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:48,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:48,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:56:48,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492638805] [2022-04-07 12:56:48,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:48,598 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:56:48,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:48,599 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:56:48,640 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:56:48,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:56:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:56:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:56:48,641 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:56:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:49,399 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2022-04-07 12:56:49,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:56:49,399 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:56:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:49,400 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:56:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:56:49,401 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:56:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:56:49,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-07 12:56:49,481 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:56:49,484 INFO L225 Difference]: With dead ends: 118 [2022-04-07 12:56:49,484 INFO L226 Difference]: Without dead ends: 116 [2022-04-07 12:56:49,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:56:49,485 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:49,485 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.2s Time] [2022-04-07 12:56:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-07 12:56:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-07 12:56:49,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:49,523 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:56:49,523 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:56:49,523 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:56:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:49,526 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-07 12:56:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:56:49,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:49,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:49,527 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:56:49,528 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:56:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:49,531 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2022-04-07 12:56:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:56:49,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:49,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:49,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:49,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:49,532 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:56:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2022-04-07 12:56:49,535 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 45 [2022-04-07 12:56:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:49,535 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2022-04-07 12:56:49,535 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:56:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2022-04-07 12:56:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 12:56:49,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:49,536 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:56:49,563 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:56:49,753 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:56:49,753 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:49,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash 780782572, now seen corresponding path program 2 times [2022-04-07 12:56:49,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:49,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168610610] [2022-04-07 12:56:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:49,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:49,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1508593116] [2022-04-07 12:56:49,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:56:49,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:49,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:49,765 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:56:49,766 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:56:49,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:56:49,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:56:49,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:56:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:49,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:50,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-07 12:56:50,003 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:56:50,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-07 12:56:50,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-07 12:56:50,003 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:56:50,004 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:56:50,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3309#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-07 12:56:50,004 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:56:50,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,005 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:56:50,005 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:56:50,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,005 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:56:50,006 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:56:50,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,006 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:56:50,006 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:56:50,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,008 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:56:50,008 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:56:50,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,008 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:56:50,009 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:56:50,009 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:56:50,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3394#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1))} is VALID [2022-04-07 12:56:50,009 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:56:50,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,010 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:56:50,010 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:56:50,010 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,012 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:56:50,013 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:56:50,013 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:56:50,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-07 12:56:50,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-07 12:56:50,014 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:56:50,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:50,175 INFO L290 TraceCheckUtils]: 49: Hoare triple {3290#false} assume !false; {3290#false} is VALID [2022-04-07 12:56:50,175 INFO L290 TraceCheckUtils]: 48: Hoare triple {3438#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3290#false} is VALID [2022-04-07 12:56:50,176 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:56:50,176 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:56:50,176 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:56:50,177 INFO L290 TraceCheckUtils]: 44: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,177 INFO L290 TraceCheckUtils]: 43: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,177 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:56:50,177 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:56:50,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,177 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:56:50,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !!(#t~post5 < 20);havoc #t~post5; {3454#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-07 12:56:50,178 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:56:50,180 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:56:50,180 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:56:50,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,181 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:56:50,181 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:56:50,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,181 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:56:50,182 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:56:50,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,182 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:56:50,183 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:56:50,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,183 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:56:50,188 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:56:50,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {3289#true} assume !(0 == ~cond); {3289#true} is VALID [2022-04-07 12:56:50,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {3289#true} ~cond := #in~cond; {3289#true} is VALID [2022-04-07 12:56:50,188 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:56:50,189 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 < 20);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:56:50,189 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:56:50,189 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:56:50,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {3289#true} call #t~ret6 := main(); {3289#true} is VALID [2022-04-07 12:56:50,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3289#true} {3289#true} #81#return; {3289#true} is VALID [2022-04-07 12:56:50,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {3289#true} assume true; {3289#true} is VALID [2022-04-07 12:56:50,190 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:56:50,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {3289#true} call ULTIMATE.init(); {3289#true} is VALID [2022-04-07 12:56:50,190 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:56:50,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:50,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168610610] [2022-04-07 12:56:50,190 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:50,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508593116] [2022-04-07 12:56:50,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508593116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:50,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:50,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:56:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685459005] [2022-04-07 12:56:50,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:50,191 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:56:50,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:50,191 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:56:50,231 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:56:50,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:56:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:50,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:56:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:56:50,232 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:56:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:50,753 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2022-04-07 12:56:50,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:56:50,754 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:56:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:50,754 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:56:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-07 12:56:50,755 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:56:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-04-07 12:56:50,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-04-07 12:56:50,818 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:56:50,820 INFO L225 Difference]: With dead ends: 122 [2022-04-07 12:56:50,820 INFO L226 Difference]: Without dead ends: 120 [2022-04-07 12:56:50,820 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:56:50,820 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:56:50,820 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:56:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-07 12:56:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-07 12:56:50,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:50,853 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:56:50,854 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:56:50,854 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:56:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:50,857 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-07 12:56:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:56:50,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:50,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:50,858 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:56:50,858 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:56:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:50,860 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-07 12:56:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:56:50,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:50,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:50,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:50,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:50,861 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:56:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-07 12:56:50,863 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 50 [2022-04-07 12:56:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:50,864 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-07 12:56:50,864 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:56:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-07 12:56:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-07 12:56:50,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:50,864 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:56:50,899 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:56:51,083 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:56:51,083 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1909341660, now seen corresponding path program 3 times [2022-04-07 12:56:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:51,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119982852] [2022-04-07 12:56:51,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:51,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:51,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667769486] [2022-04-07 12:56:51,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:56:51,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:51,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:51,093 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:56:51,094 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:56:51,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-07 12:56:51,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:56:51,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-07 12:56:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:51,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:51,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-07 12:56:51,391 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:56:51,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-07 12:56:51,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-07 12:56:51,391 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:56:51,404 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:56:51,407 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 < 20);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:56:51,408 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:56:51,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,409 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:56:51,409 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:56:51,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,409 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:56:51,410 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:56:51,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,410 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:56:51,410 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:56:51,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,419 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:56:51,419 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:56:51,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,420 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:56:51,421 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:56:51,421 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:56:51,421 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 < 20);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:56:51,421 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:56:51,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,422 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:56:51,422 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:56:51,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,422 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,423 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:56:51,423 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:56:51,423 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,423 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,423 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,424 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:56:51,424 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:56:51,425 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:56:51,425 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-07 12:56:51,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-07 12:56:51,425 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:56:51,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:51,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {4205#false} assume !false; {4205#false} is VALID [2022-04-07 12:56:51,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {4368#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4205#false} is VALID [2022-04-07 12:56:51,722 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:56:51,722 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:56:51,723 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:56:51,723 INFO L290 TraceCheckUtils]: 49: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,723 INFO L290 TraceCheckUtils]: 48: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,723 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:56:51,724 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:56:51,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,724 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:56:51,724 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:56:51,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,725 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:56:51,725 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 < 20);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:56:51,725 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:56:51,728 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:56:51,729 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:56:51,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,729 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:56:51,734 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:56:51,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,735 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:56:51,735 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:56:51,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,735 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:56:51,736 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:56:51,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,736 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:56:51,737 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:56:51,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#true} assume !(0 == ~cond); {4204#true} is VALID [2022-04-07 12:56:51,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {4204#true} ~cond := #in~cond; {4204#true} is VALID [2022-04-07 12:56:51,737 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:56:51,737 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 < 20);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:56:51,738 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:56:51,738 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:56:51,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {4204#true} call #t~ret6 := main(); {4204#true} is VALID [2022-04-07 12:56:51,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4204#true} {4204#true} #81#return; {4204#true} is VALID [2022-04-07 12:56:51,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {4204#true} assume true; {4204#true} is VALID [2022-04-07 12:56:51,739 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:56:51,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {4204#true} call ULTIMATE.init(); {4204#true} is VALID [2022-04-07 12:56:51,739 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:56:51,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:51,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119982852] [2022-04-07 12:56:51,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:51,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667769486] [2022-04-07 12:56:51,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667769486] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:51,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:51,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:56:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615985628] [2022-04-07 12:56:51,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:51,740 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:56:51,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:51,741 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:56:51,792 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:56:51,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:56:51,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:51,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:56:51,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:56:51,793 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:56:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:52,651 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2022-04-07 12:56:52,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:56:52,651 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:56:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:56:52,652 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:56:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:56:52,653 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:56:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-07 12:56:52,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-07 12:56:54,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 79 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:56:54,733 INFO L225 Difference]: With dead ends: 146 [2022-04-07 12:56:54,733 INFO L226 Difference]: Without dead ends: 135 [2022-04-07 12:56:54,733 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:56:54,733 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:56:54,734 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.4s Time] [2022-04-07 12:56:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-07 12:56:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-04-07 12:56:54,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:56:54,770 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:56:54,770 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:56:54,770 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:56:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:54,772 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-07 12:56:54,772 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:56:54,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:54,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:54,773 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:56:54,773 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:56:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:56:54,775 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-04-07 12:56:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:56:54,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:56:54,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:56:54,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:56:54,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:56:54,776 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:56:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-04-07 12:56:54,778 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 55 [2022-04-07 12:56:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:56:54,778 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-04-07 12:56:54,778 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:56:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-04-07 12:56:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-07 12:56:54,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:56:54,779 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:56:54,801 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:56:54,991 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:56:54,991 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:56:54,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:56:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1284663070, now seen corresponding path program 1 times [2022-04-07 12:56:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:56:54,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378139976] [2022-04-07 12:56:54,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:54,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:56:55,000 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:56:55,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1788041583] [2022-04-07 12:56:55,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:56:55,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:56:55,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:56:55,023 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:56:55,024 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:56:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:55,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 12:56:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:56:55,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:56:58,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-07 12:56:58,918 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:56:58,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-07 12:56:58,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-07 12:56:58,920 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:56:58,922 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:56:58,922 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 < 20);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:56:58,923 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:56:58,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,923 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:56:58,923 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:56:58,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,924 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:56:58,924 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:56:58,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,925 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:56:58,925 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:56:58,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,925 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:56:58,925 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:56:58,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,926 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:56:58,927 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:56:58,927 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:56:58,927 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 < 20);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:56:58,928 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:56:58,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,928 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:56:58,928 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:56:58,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,929 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:56:58,929 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:56:58,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,929 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,929 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,930 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:56:58,930 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:56:58,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,930 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:56:58,930 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:56:58,930 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,930 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,931 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,931 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:56:58,932 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:56:58,932 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:56:58,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:58,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:58,932 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:58,932 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:56:58,933 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:56:58,933 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:56:58,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-07 12:56:58,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-07 12:56:58,934 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:56:58,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:56:59,447 INFO L290 TraceCheckUtils]: 70: Hoare triple {5224#false} assume !false; {5224#false} is VALID [2022-04-07 12:56:59,447 INFO L290 TraceCheckUtils]: 69: Hoare triple {5436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5224#false} is VALID [2022-04-07 12:56:59,448 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:56:59,448 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:56:59,448 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:56:59,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,449 INFO L290 TraceCheckUtils]: 64: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,449 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:56:59,449 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:56:59,449 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:56:59,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,450 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:56:59,450 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:56:59,450 INFO L290 TraceCheckUtils]: 54: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,450 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:56:59,451 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:56:59,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,451 INFO L290 TraceCheckUtils]: 47: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,451 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:56:59,451 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:56:59,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,452 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:56:59,452 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:56:59,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,452 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:56:59,453 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 < 20);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:56:59,453 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:56:59,455 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:56:59,456 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:56:59,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,456 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:56:59,456 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:56:59,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,456 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:56:59,457 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:56:59,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,457 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:56:59,458 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:56:59,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,458 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:56:59,459 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:56:59,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#true} assume !(0 == ~cond); {5223#true} is VALID [2022-04-07 12:56:59,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#true} ~cond := #in~cond; {5223#true} is VALID [2022-04-07 12:56:59,459 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:56:59,460 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 < 20);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:56:59,460 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:56:59,461 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:56:59,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {5223#true} call #t~ret6 := main(); {5223#true} is VALID [2022-04-07 12:56:59,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5223#true} {5223#true} #81#return; {5223#true} is VALID [2022-04-07 12:56:59,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {5223#true} assume true; {5223#true} is VALID [2022-04-07 12:56:59,461 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:56:59,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {5223#true} call ULTIMATE.init(); {5223#true} is VALID [2022-04-07 12:56:59,461 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:56:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:56:59,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378139976] [2022-04-07 12:56:59,461 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:56:59,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788041583] [2022-04-07 12:56:59,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788041583] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:56:59,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:56:59,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 12:56:59,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404211022] [2022-04-07 12:56:59,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:56:59,462 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:56:59,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:56:59,463 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:56:59,528 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:56:59,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 12:56:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:56:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 12:56:59,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:56:59,538 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:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:00,486 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-04-07 12:57:00,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 12:57:00,486 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:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:00,487 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:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 12:57:00,489 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:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-07 12:57:00,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-07 12:57:00,580 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:00,582 INFO L225 Difference]: With dead ends: 148 [2022-04-07 12:57:00,582 INFO L226 Difference]: Without dead ends: 144 [2022-04-07 12:57:00,583 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:00,583 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:00,583 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.3s Time] [2022-04-07 12:57:00,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-07 12:57:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-04-07 12:57:00,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:00,659 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:00,659 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:00,659 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:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:00,661 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-07 12:57:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-07 12:57:00,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:00,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:00,662 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:00,662 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:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:00,664 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-04-07 12:57:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2022-04-07 12:57:00,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:00,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:00,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:00,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:00,665 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:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-04-07 12:57:00,667 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 71 [2022-04-07 12:57:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:00,667 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-04-07 12:57:00,667 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:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-04-07 12:57:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-07 12:57:00,668 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:00,668 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:00,693 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:00,883 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:00,884 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:00,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash -904350414, now seen corresponding path program 1 times [2022-04-07 12:57:00,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:00,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012887179] [2022-04-07 12:57:00,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:00,893 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:00,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522799834] [2022-04-07 12:57:00,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:00,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:00,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:00,907 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:00,909 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:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:00,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 12:57:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:00,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:01,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {6368#true} call ULTIMATE.init(); {6368#true} is VALID [2022-04-07 12:57:01,535 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:01,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6368#true} {6368#true} #81#return; {6368#true} is VALID [2022-04-07 12:57:01,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {6368#true} call #t~ret6 := main(); {6368#true} is VALID [2022-04-07 12:57:01,536 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:01,536 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:01,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} assume !!(#t~post5 < 20);havoc #t~post5; {6388#(and (= main_~n~0 0) (= main_~y~0 1) (<= 6 main_~z~0))} is VALID [2022-04-07 12:57:01,536 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:01,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,536 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,537 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:01,537 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:01,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,539 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:01,540 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:01,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,540 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:01,540 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:01,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,541 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:01,541 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:01,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,541 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:01,542 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:01,542 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:01,543 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 < 20);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:01,543 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:01,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,543 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:01,544 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:01,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,544 INFO L290 TraceCheckUtils]: 43: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,544 INFO L290 TraceCheckUtils]: 44: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,544 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:01,544 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:01,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,545 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:01,545 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:01,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,546 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:01,546 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:01,546 INFO L290 TraceCheckUtils]: 57: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,546 INFO L290 TraceCheckUtils]: 58: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,546 INFO L290 TraceCheckUtils]: 59: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,546 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:01,547 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:01,547 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:01,547 INFO L290 TraceCheckUtils]: 63: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,547 INFO L290 TraceCheckUtils]: 64: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,547 INFO L290 TraceCheckUtils]: 65: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,547 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:01,547 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:01,548 INFO L290 TraceCheckUtils]: 68: Hoare triple {6368#true} ~cond := #in~cond; {6368#true} is VALID [2022-04-07 12:57:01,548 INFO L290 TraceCheckUtils]: 69: Hoare triple {6368#true} assume !(0 == ~cond); {6368#true} is VALID [2022-04-07 12:57:01,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {6368#true} assume true; {6368#true} is VALID [2022-04-07 12:57:01,548 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:01,549 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:01,549 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:01,550 INFO L290 TraceCheckUtils]: 74: Hoare triple {6596#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6369#false} is VALID [2022-04-07 12:57:01,550 INFO L290 TraceCheckUtils]: 75: Hoare triple {6369#false} assume !false; {6369#false} is VALID [2022-04-07 12:57:01,550 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:01,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:07,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:07,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012887179] [2022-04-07 12:57:07,892 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:07,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522799834] [2022-04-07 12:57:07,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522799834] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:07,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:07,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-07 12:57:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656688844] [2022-04-07 12:57:07,893 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:07,893 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:07,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:07,893 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:07,926 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:07,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 12:57:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 12:57:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:57:07,927 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:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:08,325 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2022-04-07 12:57:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:08,326 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:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:08,326 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:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-07 12:57:08,327 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:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-07 12:57:08,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-07 12:57:08,380 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:08,382 INFO L225 Difference]: With dead ends: 143 [2022-04-07 12:57:08,382 INFO L226 Difference]: Without dead ends: 132 [2022-04-07 12:57:08,382 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:08,383 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:08,383 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:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-07 12:57:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-07 12:57:08,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:08,456 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:08,456 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:08,456 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:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:08,458 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-07 12:57:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:57:08,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:08,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:08,459 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:08,459 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:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:08,461 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-04-07 12:57:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:57:08,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:08,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:08,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:08,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:08,461 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:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2022-04-07 12:57:08,463 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 76 [2022-04-07 12:57:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:08,463 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2022-04-07 12:57:08,463 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:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2022-04-07 12:57:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-07 12:57:08,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:08,464 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:08,480 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:08,675 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:08,675 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:08,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:08,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1454229731, now seen corresponding path program 4 times [2022-04-07 12:57:08,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:08,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463089640] [2022-04-07 12:57:08,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:08,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:08,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:08,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238068326] [2022-04-07 12:57:08,685 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:57:08,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:08,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:08,686 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:08,715 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:10,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:57:10,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:10,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-07 12:57:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:10,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:11,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-07 12:57:11,388 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:11,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:11,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-07 12:57:11,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-07 12:57:11,389 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:11,389 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:11,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 20);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:57:11,389 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:11,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:11,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:11,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:11,389 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:57:11,389 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:11,389 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:11,390 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:11,390 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:11,390 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:11,390 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:11,391 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:11,391 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:11,391 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:11,392 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:11,392 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:11,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:11,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:11,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:11,392 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:11,393 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:11,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:11,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:11,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:11,393 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:11,399 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:11,400 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:11,400 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 < 20);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:11,400 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:11,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:11,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:11,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:11,401 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:11,401 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:11,401 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:11,401 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:11,402 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:11,402 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:11,402 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:11,403 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:11,403 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:11,403 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:11,404 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:11,404 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:11,404 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:11,404 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:11,405 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:11,405 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:11,405 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:11,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:11,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:11,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:11,406 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:11,415 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:11,416 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:11,416 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 < 20);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:11,416 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:11,417 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:11,417 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:11,417 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:11,418 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:11,418 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:11,418 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:11,418 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:11,419 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:11,419 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:11,420 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:11,420 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:11,420 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-07 12:57:11,420 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-07 12:57:11,421 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:11,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:12,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {7398#false} assume !false; {7398#false} is VALID [2022-04-07 12:57:12,213 INFO L290 TraceCheckUtils]: 76: Hoare triple {7635#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7398#false} is VALID [2022-04-07 12:57:12,213 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:12,214 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:12,214 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:12,215 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:12,215 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:12,215 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:12,215 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:12,216 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:12,216 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:12,216 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:12,217 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:12,217 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:12,217 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 < 20);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:12,218 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:14,219 WARN 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 UNKNOWN [2022-04-07 12:57:14,220 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:14,220 INFO L290 TraceCheckUtils]: 59: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,220 INFO L290 TraceCheckUtils]: 58: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:14,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:14,220 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:14,224 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:14,224 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:14,225 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:14,225 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:14,225 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:14,225 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-07 12:57:14,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,225 INFO L290 TraceCheckUtils]: 48: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:14,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:14,225 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:14,225 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-07 12:57:14,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:14,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:14,251 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:14,251 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:57:14,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:14,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:14,251 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:14,252 INFO L290 TraceCheckUtils]: 35: Hoare triple {7397#true} assume !!(#t~post5 < 20);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:57:14,252 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:14,252 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:14,252 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7397#true} {7397#true} #67#return; {7397#true} is VALID [2022-04-07 12:57:14,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:14,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:14,252 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:14,252 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7397#true} {7397#true} #65#return; {7397#true} is VALID [2022-04-07 12:57:14,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:14,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:14,252 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:14,252 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7397#true} {7397#true} #63#return; {7397#true} is VALID [2022-04-07 12:57:14,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:14,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:14,256 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:14,256 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7397#true} {7397#true} #61#return; {7397#true} is VALID [2022-04-07 12:57:14,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:14,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:14,257 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:14,257 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7397#true} {7397#true} #59#return; {7397#true} is VALID [2022-04-07 12:57:14,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {7397#true} assume !(0 == ~cond); {7397#true} is VALID [2022-04-07 12:57:14,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {7397#true} ~cond := #in~cond; {7397#true} is VALID [2022-04-07 12:57:14,257 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:14,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {7397#true} assume !!(#t~post5 < 20);havoc #t~post5; {7397#true} is VALID [2022-04-07 12:57:14,257 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:14,257 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:14,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {7397#true} call #t~ret6 := main(); {7397#true} is VALID [2022-04-07 12:57:14,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7397#true} {7397#true} #81#return; {7397#true} is VALID [2022-04-07 12:57:14,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {7397#true} assume true; {7397#true} is VALID [2022-04-07 12:57:14,257 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:14,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {7397#true} call ULTIMATE.init(); {7397#true} is VALID [2022-04-07 12:57:14,258 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:14,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463089640] [2022-04-07 12:57:14,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238068326] [2022-04-07 12:57:14,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238068326] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:14,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:14,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-04-07 12:57:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913065994] [2022-04-07 12:57:14,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:14,259 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:14,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:14,263 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:14,344 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:14,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 12:57:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 12:57:14,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:57:14,345 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:15,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:15,325 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2022-04-07 12:57:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:57:15,325 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:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:15,325 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:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 12:57:15,326 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:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-07 12:57:15,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-07 12:57:15,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:57:15,377 INFO L225 Difference]: With dead ends: 142 [2022-04-07 12:57:15,377 INFO L226 Difference]: Without dead ends: 138 [2022-04-07 12:57:15,377 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:15,377 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:15,377 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.6s Time] [2022-04-07 12:57:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-07 12:57:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-07 12:57:15,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:15,461 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:15,461 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:15,461 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:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:15,464 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-07 12:57:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:57:15,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:15,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:15,464 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:15,465 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:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:15,467 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-04-07 12:57:15,467 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:57:15,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:15,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:15,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:15,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:15,468 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:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2022-04-07 12:57:15,470 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 78 [2022-04-07 12:57:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:15,470 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2022-04-07 12:57:15,470 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:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2022-04-07 12:57:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-07 12:57:15,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:15,471 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:15,476 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:15,676 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:15,677 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1446042473, now seen corresponding path program 2 times [2022-04-07 12:57:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:15,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218017902] [2022-04-07 12:57:15,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:15,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:15,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603658829] [2022-04-07 12:57:15,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:15,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:15,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:15,686 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:15,687 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:15,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:15,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:15,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-07 12:57:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:15,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:16,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {8554#true} call ULTIMATE.init(); {8554#true} is VALID [2022-04-07 12:57:16,273 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:16,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8554#true} {8554#true} #81#return; {8554#true} is VALID [2022-04-07 12:57:16,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {8554#true} call #t~ret6 := main(); {8554#true} is VALID [2022-04-07 12:57:16,274 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:16,274 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:16,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {8574#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:16,275 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:16,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,275 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:16,275 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:16,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,276 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:16,276 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:16,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,277 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:16,277 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:16,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,278 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:16,278 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:16,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,279 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:16,279 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:16,279 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:16,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {8659#(and (= main_~z~0 12) (= 7 main_~y~0) (= (+ (- 1) main_~n~0) 0))} assume !!(#t~post5 < 20);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:16,280 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:16,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,280 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:16,281 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:16,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,281 INFO L290 TraceCheckUtils]: 44: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,281 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:16,281 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:16,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,283 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:16,283 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:16,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,284 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:16,284 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:16,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,284 INFO L290 TraceCheckUtils]: 59: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,284 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:16,285 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:16,285 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:16,286 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 < 20);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:16,286 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:16,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,286 INFO L290 TraceCheckUtils]: 66: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,286 INFO L290 TraceCheckUtils]: 67: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,286 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:16,286 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:16,286 INFO L290 TraceCheckUtils]: 70: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,287 INFO L290 TraceCheckUtils]: 71: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,287 INFO L290 TraceCheckUtils]: 72: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,287 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:16,287 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:16,287 INFO L290 TraceCheckUtils]: 75: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,287 INFO L290 TraceCheckUtils]: 76: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,287 INFO L290 TraceCheckUtils]: 77: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,288 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:16,288 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:16,288 INFO L290 TraceCheckUtils]: 80: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,288 INFO L290 TraceCheckUtils]: 81: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,288 INFO L290 TraceCheckUtils]: 82: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,288 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:16,289 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:16,289 INFO L290 TraceCheckUtils]: 85: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,289 INFO L290 TraceCheckUtils]: 86: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,289 INFO L290 TraceCheckUtils]: 87: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,289 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:16,290 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:16,290 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:16,290 INFO L290 TraceCheckUtils]: 91: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,290 INFO L290 TraceCheckUtils]: 92: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,290 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:16,290 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:16,290 INFO L290 TraceCheckUtils]: 96: Hoare triple {8554#true} ~cond := #in~cond; {8554#true} is VALID [2022-04-07 12:57:16,290 INFO L290 TraceCheckUtils]: 97: Hoare triple {8554#true} assume !(0 == ~cond); {8554#true} is VALID [2022-04-07 12:57:16,290 INFO L290 TraceCheckUtils]: 98: Hoare triple {8554#true} assume true; {8554#true} is VALID [2022-04-07 12:57:16,302 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:16,302 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:16,303 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:16,303 INFO L290 TraceCheckUtils]: 102: Hoare triple {8867#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8555#false} is VALID [2022-04-07 12:57:16,303 INFO L290 TraceCheckUtils]: 103: Hoare triple {8555#false} assume !false; {8555#false} is VALID [2022-04-07 12:57:16,304 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:16,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:22,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:22,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218017902] [2022-04-07 12:57:22,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:22,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603658829] [2022-04-07 12:57:22,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603658829] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:22,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:22,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-07 12:57:22,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864932822] [2022-04-07 12:57:22,546 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:22,547 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:22,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:22,547 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:22,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:22,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:57:22,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:22,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:57:22,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:57:22,591 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:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:23,265 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2022-04-07 12:57:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 12:57:23,265 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:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:23,265 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:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-07 12:57:23,266 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:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-07 12:57:23,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-07 12:57:23,335 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:23,337 INFO L225 Difference]: With dead ends: 140 [2022-04-07 12:57:23,337 INFO L226 Difference]: Without dead ends: 129 [2022-04-07 12:57:23,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:57:23,337 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:23,338 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.2s Time] [2022-04-07 12:57:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-07 12:57:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-07 12:57:23,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:23,420 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:23,420 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:23,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:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:23,422 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-07 12:57:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 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 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:23,422 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:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:23,424 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2022-04-07 12:57:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:57:23,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:23,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:23,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:23,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:23,425 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:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-07 12:57:23,426 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 104 [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 129 states and 132 transitions. [2022-04-07 12:57:23,427 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:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-07 12:57:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [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 [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:23,461 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:23,644 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:23,644 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash -813840784, now seen corresponding path program 2 times [2022-04-07 12:57:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:23,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100061333] [2022-04-07 12:57:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:23,654 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:23,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5106826] [2022-04-07 12:57:23,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:23,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:23,654 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 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:23,659 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:23,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:23,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:23,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-07 12:57:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:23,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:24,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {9650#true} call ULTIMATE.init(); {9650#true} is VALID [2022-04-07 12:57:24,394 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:57:24,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9650#true} {9650#true} #81#return; {9650#true} is VALID [2022-04-07 12:57:24,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {9650#true} call #t~ret6 := main(); {9650#true} is VALID [2022-04-07 12:57:24,394 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:57:24,395 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:57:24,395 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 < 20);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:57:24,395 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:57:24,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,396 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:57:24,396 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:57:24,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,406 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:57:24,406 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:57:24,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,407 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:57:24,407 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:57:24,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,408 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:57:24,408 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:57:24,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,408 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:57:24,409 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:57:24,409 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:57:24,410 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 < 20);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:57:24,410 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:57:24,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,410 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:57:24,410 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:57:24,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,411 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:57:24,411 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:57:24,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,411 INFO L290 TraceCheckUtils]: 48: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,411 INFO L290 TraceCheckUtils]: 49: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,412 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:57:24,412 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:57:24,412 INFO L290 TraceCheckUtils]: 52: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,412 INFO L290 TraceCheckUtils]: 54: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,413 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:57:24,413 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:57:24,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,413 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:57:24,414 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:57:24,414 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:57:24,414 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 < 20);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:57:24,415 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:57:24,415 INFO L290 TraceCheckUtils]: 65: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,415 INFO L290 TraceCheckUtils]: 66: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,415 INFO L290 TraceCheckUtils]: 67: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,415 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:57:24,415 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:57:24,415 INFO L290 TraceCheckUtils]: 70: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,415 INFO L290 TraceCheckUtils]: 71: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,415 INFO L290 TraceCheckUtils]: 72: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,416 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:57:24,416 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:57:24,416 INFO L290 TraceCheckUtils]: 75: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,416 INFO L290 TraceCheckUtils]: 76: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,416 INFO L290 TraceCheckUtils]: 77: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,417 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:57:24,417 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:57:24,417 INFO L290 TraceCheckUtils]: 80: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,417 INFO L290 TraceCheckUtils]: 81: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,417 INFO L290 TraceCheckUtils]: 82: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,417 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:57:24,417 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:57:24,417 INFO L290 TraceCheckUtils]: 85: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,417 INFO L290 TraceCheckUtils]: 86: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,418 INFO L290 TraceCheckUtils]: 87: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,418 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:57:24,419 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:57:24,419 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:57:24,420 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 < 20);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:57:24,420 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:57:24,420 INFO L290 TraceCheckUtils]: 93: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,420 INFO L290 TraceCheckUtils]: 94: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,420 INFO L290 TraceCheckUtils]: 95: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,420 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:57:24,420 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:57:24,420 INFO L290 TraceCheckUtils]: 98: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,421 INFO L290 TraceCheckUtils]: 99: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,421 INFO L290 TraceCheckUtils]: 100: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,421 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:57:24,421 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:57:24,421 INFO L290 TraceCheckUtils]: 103: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,421 INFO L290 TraceCheckUtils]: 104: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,421 INFO L290 TraceCheckUtils]: 105: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,422 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:57:24,422 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:57:24,422 INFO L290 TraceCheckUtils]: 108: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,422 INFO L290 TraceCheckUtils]: 109: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,422 INFO L290 TraceCheckUtils]: 110: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,422 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:57:24,423 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:57:24,423 INFO L290 TraceCheckUtils]: 113: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,423 INFO L290 TraceCheckUtils]: 114: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,423 INFO L290 TraceCheckUtils]: 115: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,423 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:57:24,423 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:57:24,424 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:57:24,424 INFO L290 TraceCheckUtils]: 119: Hoare triple {9650#true} ~cond := #in~cond; {9650#true} is VALID [2022-04-07 12:57:24,424 INFO L290 TraceCheckUtils]: 120: Hoare triple {9650#true} assume !(0 == ~cond); {9650#true} is VALID [2022-04-07 12:57:24,424 INFO L290 TraceCheckUtils]: 121: Hoare triple {9650#true} assume true; {9650#true} is VALID [2022-04-07 12:57:24,424 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:57:24,425 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:57:24,425 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:57:24,425 INFO L290 TraceCheckUtils]: 125: Hoare triple {10033#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9651#false} is VALID [2022-04-07 12:57:24,425 INFO L290 TraceCheckUtils]: 126: Hoare triple {9651#false} assume !false; {9651#false} is VALID [2022-04-07 12:57:24,426 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:57:24,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:24,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:24,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100061333] [2022-04-07 12:57:24,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:24,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5106826] [2022-04-07 12:57:24,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5106826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:24,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:24,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 12:57:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553962704] [2022-04-07 12:57:24,789 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:24,790 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:57:24,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:24,790 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:57:24,846 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:24,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:57:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:57:24,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:57:24,847 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:57:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:25,901 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2022-04-07 12:57:25,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:57:25,902 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:57:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:25,902 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:57:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:57:25,903 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:57:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:57:25,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-07 12:57:26,008 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:57:26,010 INFO L225 Difference]: With dead ends: 152 [2022-04-07 12:57:26,010 INFO L226 Difference]: Without dead ends: 150 [2022-04-07 12:57:26,010 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:57:26,010 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:26,010 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.4s Time] [2022-04-07 12:57:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-07 12:57:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-07 12:57:26,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:26,099 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:57:26,100 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:57:26,100 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:57:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:26,102 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-07 12:57:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-07 12:57:26,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:26,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:26,103 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:57:26,103 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:57:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:26,105 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-04-07 12:57:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-04-07 12:57:26,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:26,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:26,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:26,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:26,106 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:57:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2022-04-07 12:57:26,108 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 127 [2022-04-07 12:57:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:26,108 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2022-04-07 12:57:26,108 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:57:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2022-04-07 12:57:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-07 12:57:26,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:26,109 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:57:26,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-07 12:57:26,323 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:57:26,323 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash -167438485, now seen corresponding path program 2 times [2022-04-07 12:57:26,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:26,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178029713] [2022-04-07 12:57:26,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:26,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:26,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:26,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098759244] [2022-04-07 12:57:26,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:57:26,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:26,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:26,334 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:57:26,335 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:57:26,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:57:26,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:26,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:57:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:26,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:26,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-07 12:57:26,804 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:57:26,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {10899#(<= ~counter~0 0)} assume true; {10899#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:26,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10899#(<= ~counter~0 0)} {10891#true} #81#return; {10899#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:26,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {10899#(<= ~counter~0 0)} call #t~ret6 := main(); {10899#(<= ~counter~0 0)} is VALID [2022-04-07 12:57:26,806 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:57:26,806 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:57:26,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {10915#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,807 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:57:26,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,808 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:57:26,808 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:57:26,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,810 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:57:26,810 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:57:26,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,811 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:57:26,812 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:57:26,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,813 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:57:26,813 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:57:26,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {10915#(<= ~counter~0 1)} ~cond := #in~cond; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {10915#(<= ~counter~0 1)} assume !(0 == ~cond); {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {10915#(<= ~counter~0 1)} assume true; {10915#(<= ~counter~0 1)} is VALID [2022-04-07 12:57:26,814 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:57:26,815 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:57:26,815 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:57:26,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {11000#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,816 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:57:26,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,817 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:57:26,817 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:57:26,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,818 INFO L290 TraceCheckUtils]: 44: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,818 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:57:26,819 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:57:26,819 INFO L290 TraceCheckUtils]: 47: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,820 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:57:26,820 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:57:26,821 INFO L290 TraceCheckUtils]: 52: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,821 INFO L290 TraceCheckUtils]: 53: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,821 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:57:26,822 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:57:26,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {11000#(<= ~counter~0 2)} ~cond := #in~cond; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {11000#(<= ~counter~0 2)} assume !(0 == ~cond); {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,823 INFO L290 TraceCheckUtils]: 59: Hoare triple {11000#(<= ~counter~0 2)} assume true; {11000#(<= ~counter~0 2)} is VALID [2022-04-07 12:57:26,823 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:57:26,823 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:57:26,824 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:57:26,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {11085#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,824 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:57:26,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,825 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,825 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:57:26,826 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:57:26,826 INFO L290 TraceCheckUtils]: 70: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,827 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:57:26,827 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:57:26,828 INFO L290 TraceCheckUtils]: 75: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,828 INFO L290 TraceCheckUtils]: 76: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,828 INFO L290 TraceCheckUtils]: 77: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,828 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:57:26,829 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:57:26,829 INFO L290 TraceCheckUtils]: 80: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,829 INFO L290 TraceCheckUtils]: 81: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,830 INFO L290 TraceCheckUtils]: 82: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,830 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:57:26,830 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:57:26,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {11085#(<= ~counter~0 3)} ~cond := #in~cond; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {11085#(<= ~counter~0 3)} assume !(0 == ~cond); {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {11085#(<= ~counter~0 3)} assume true; {11085#(<= ~counter~0 3)} is VALID [2022-04-07 12:57:26,832 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:57:26,832 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:57:26,832 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:57:26,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {11170#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,833 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:57:26,833 INFO L290 TraceCheckUtils]: 93: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,833 INFO L290 TraceCheckUtils]: 94: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,834 INFO L290 TraceCheckUtils]: 95: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,836 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:57:26,836 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:57:26,841 INFO L290 TraceCheckUtils]: 98: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,841 INFO L290 TraceCheckUtils]: 99: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,841 INFO L290 TraceCheckUtils]: 100: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,842 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:57:26,843 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:57:26,843 INFO L290 TraceCheckUtils]: 103: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,843 INFO L290 TraceCheckUtils]: 104: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,844 INFO L290 TraceCheckUtils]: 105: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,844 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:57:26,845 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:57:26,845 INFO L290 TraceCheckUtils]: 108: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,845 INFO L290 TraceCheckUtils]: 109: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,845 INFO L290 TraceCheckUtils]: 110: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,846 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:57:26,847 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:57:26,847 INFO L290 TraceCheckUtils]: 113: Hoare triple {11170#(<= ~counter~0 4)} ~cond := #in~cond; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,847 INFO L290 TraceCheckUtils]: 114: Hoare triple {11170#(<= ~counter~0 4)} assume !(0 == ~cond); {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,848 INFO L290 TraceCheckUtils]: 115: Hoare triple {11170#(<= ~counter~0 4)} assume true; {11170#(<= ~counter~0 4)} is VALID [2022-04-07 12:57:26,848 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:57:26,848 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:57:26,849 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:57:26,849 INFO L290 TraceCheckUtils]: 119: Hoare triple {11255#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {10892#false} is VALID [2022-04-07 12:57:26,849 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:57:26,849 INFO L290 TraceCheckUtils]: 121: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-07 12:57:26,850 INFO L290 TraceCheckUtils]: 122: Hoare triple {10892#false} assume !(0 == ~cond); {10892#false} is VALID [2022-04-07 12:57:26,850 INFO L290 TraceCheckUtils]: 123: Hoare triple {10892#false} assume true; {10892#false} is VALID [2022-04-07 12:57:26,850 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10892#false} {10892#false} #69#return; {10892#false} is VALID [2022-04-07 12:57:26,850 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:57:26,850 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-07 12:57:26,850 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-07 12:57:26,850 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-07 12:57:26,850 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:57:26,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:27,270 INFO L290 TraceCheckUtils]: 128: Hoare triple {10892#false} assume !false; {10892#false} is VALID [2022-04-07 12:57:27,270 INFO L290 TraceCheckUtils]: 127: Hoare triple {10892#false} assume 0 == ~cond; {10892#false} is VALID [2022-04-07 12:57:27,270 INFO L290 TraceCheckUtils]: 126: Hoare triple {10892#false} ~cond := #in~cond; {10892#false} is VALID [2022-04-07 12:57:27,270 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:57:27,270 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {10891#true} {10892#false} #69#return; {10892#false} is VALID [2022-04-07 12:57:27,270 INFO L290 TraceCheckUtils]: 123: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,270 INFO L290 TraceCheckUtils]: 122: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,270 INFO L290 TraceCheckUtils]: 121: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,270 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:57:27,271 INFO L290 TraceCheckUtils]: 119: Hoare triple {11313#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {10892#false} is VALID [2022-04-07 12:57:27,271 INFO L290 TraceCheckUtils]: 118: Hoare triple {11317#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11313#(< |main_#t~post5| 20)} is VALID [2022-04-07 12:57:27,271 INFO L290 TraceCheckUtils]: 117: Hoare triple {11317#(< ~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; {11317#(< ~counter~0 20)} is VALID [2022-04-07 12:57:27,272 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #67#return; {11317#(< ~counter~0 20)} is VALID [2022-04-07 12:57:27,272 INFO L290 TraceCheckUtils]: 115: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,272 INFO L290 TraceCheckUtils]: 114: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,272 INFO L290 TraceCheckUtils]: 113: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,272 INFO L272 TraceCheckUtils]: 112: Hoare triple {11317#(< ~counter~0 20)} 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:57:27,272 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #65#return; {11317#(< ~counter~0 20)} is VALID [2022-04-07 12:57:27,272 INFO L290 TraceCheckUtils]: 110: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,273 INFO L290 TraceCheckUtils]: 109: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,273 INFO L290 TraceCheckUtils]: 108: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,273 INFO L272 TraceCheckUtils]: 107: Hoare triple {11317#(< ~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)); {10891#true} is VALID [2022-04-07 12:57:27,273 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #63#return; {11317#(< ~counter~0 20)} is VALID [2022-04-07 12:57:27,273 INFO L290 TraceCheckUtils]: 105: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,273 INFO L290 TraceCheckUtils]: 104: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,273 INFO L290 TraceCheckUtils]: 103: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,273 INFO L272 TraceCheckUtils]: 102: Hoare triple {11317#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-07 12:57:27,274 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #61#return; {11317#(< ~counter~0 20)} is VALID [2022-04-07 12:57:27,274 INFO L290 TraceCheckUtils]: 100: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,274 INFO L290 TraceCheckUtils]: 99: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,274 INFO L290 TraceCheckUtils]: 98: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,274 INFO L272 TraceCheckUtils]: 97: Hoare triple {11317#(< ~counter~0 20)} 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:57:27,274 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {10891#true} {11317#(< ~counter~0 20)} #59#return; {11317#(< ~counter~0 20)} is VALID [2022-04-07 12:57:27,274 INFO L290 TraceCheckUtils]: 95: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,274 INFO L290 TraceCheckUtils]: 94: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,274 INFO L290 TraceCheckUtils]: 93: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,275 INFO L272 TraceCheckUtils]: 92: Hoare triple {11317#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-07 12:57:27,275 INFO L290 TraceCheckUtils]: 91: Hoare triple {11317#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {11317#(< ~counter~0 20)} is VALID [2022-04-07 12:57:27,278 INFO L290 TraceCheckUtils]: 90: Hoare triple {11402#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11317#(< ~counter~0 20)} is VALID [2022-04-07 12:57:27,278 INFO L290 TraceCheckUtils]: 89: Hoare triple {11402#(< ~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; {11402#(< ~counter~0 19)} is VALID [2022-04-07 12:57:27,278 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #67#return; {11402#(< ~counter~0 19)} is VALID [2022-04-07 12:57:27,278 INFO L290 TraceCheckUtils]: 87: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,278 INFO L290 TraceCheckUtils]: 86: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,278 INFO L290 TraceCheckUtils]: 85: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,279 INFO L272 TraceCheckUtils]: 84: Hoare triple {11402#(< ~counter~0 19)} 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:57:27,279 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #65#return; {11402#(< ~counter~0 19)} is VALID [2022-04-07 12:57:27,279 INFO L290 TraceCheckUtils]: 82: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,279 INFO L290 TraceCheckUtils]: 81: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,279 INFO L290 TraceCheckUtils]: 80: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,279 INFO L272 TraceCheckUtils]: 79: Hoare triple {11402#(< ~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)); {10891#true} is VALID [2022-04-07 12:57:27,280 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #63#return; {11402#(< ~counter~0 19)} is VALID [2022-04-07 12:57:27,280 INFO L290 TraceCheckUtils]: 77: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,280 INFO L290 TraceCheckUtils]: 76: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,280 INFO L290 TraceCheckUtils]: 75: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,280 INFO L272 TraceCheckUtils]: 74: Hoare triple {11402#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-07 12:57:27,280 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #61#return; {11402#(< ~counter~0 19)} is VALID [2022-04-07 12:57:27,280 INFO L290 TraceCheckUtils]: 72: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,280 INFO L290 TraceCheckUtils]: 71: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,280 INFO L290 TraceCheckUtils]: 70: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,281 INFO L272 TraceCheckUtils]: 69: Hoare triple {11402#(< ~counter~0 19)} 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:57:27,281 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10891#true} {11402#(< ~counter~0 19)} #59#return; {11402#(< ~counter~0 19)} is VALID [2022-04-07 12:57:27,281 INFO L290 TraceCheckUtils]: 67: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,281 INFO L290 TraceCheckUtils]: 66: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,281 INFO L290 TraceCheckUtils]: 65: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,281 INFO L272 TraceCheckUtils]: 64: Hoare triple {11402#(< ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-07 12:57:27,285 INFO L290 TraceCheckUtils]: 63: Hoare triple {11402#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {11402#(< ~counter~0 19)} is VALID [2022-04-07 12:57:27,285 INFO L290 TraceCheckUtils]: 62: Hoare triple {11487#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11402#(< ~counter~0 19)} is VALID [2022-04-07 12:57:27,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {11487#(< ~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; {11487#(< ~counter~0 18)} is VALID [2022-04-07 12:57:27,286 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #67#return; {11487#(< ~counter~0 18)} is VALID [2022-04-07 12:57:27,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,286 INFO L272 TraceCheckUtils]: 56: Hoare triple {11487#(< ~counter~0 18)} 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:57:27,303 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #65#return; {11487#(< ~counter~0 18)} is VALID [2022-04-07 12:57:27,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,303 INFO L272 TraceCheckUtils]: 51: Hoare triple {11487#(< ~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)); {10891#true} is VALID [2022-04-07 12:57:27,304 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #63#return; {11487#(< ~counter~0 18)} is VALID [2022-04-07 12:57:27,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,304 INFO L272 TraceCheckUtils]: 46: Hoare triple {11487#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-07 12:57:27,304 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #61#return; {11487#(< ~counter~0 18)} is VALID [2022-04-07 12:57:27,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,305 INFO L272 TraceCheckUtils]: 41: Hoare triple {11487#(< ~counter~0 18)} 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:57:27,305 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10891#true} {11487#(< ~counter~0 18)} #59#return; {11487#(< ~counter~0 18)} is VALID [2022-04-07 12:57:27,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,305 INFO L272 TraceCheckUtils]: 36: Hoare triple {11487#(< ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-07 12:57:27,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {11487#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {11487#(< ~counter~0 18)} is VALID [2022-04-07 12:57:27,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {11572#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11487#(< ~counter~0 18)} is VALID [2022-04-07 12:57:27,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {11572#(< ~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; {11572#(< ~counter~0 17)} is VALID [2022-04-07 12:57:27,307 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #67#return; {11572#(< ~counter~0 17)} is VALID [2022-04-07 12:57:27,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,307 INFO L272 TraceCheckUtils]: 28: Hoare triple {11572#(< ~counter~0 17)} 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:57:27,307 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #65#return; {11572#(< ~counter~0 17)} is VALID [2022-04-07 12:57:27,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,308 INFO L272 TraceCheckUtils]: 23: Hoare triple {11572#(< ~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)); {10891#true} is VALID [2022-04-07 12:57:27,308 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #63#return; {11572#(< ~counter~0 17)} is VALID [2022-04-07 12:57:27,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,308 INFO L272 TraceCheckUtils]: 18: Hoare triple {11572#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-07 12:57:27,309 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #61#return; {11572#(< ~counter~0 17)} is VALID [2022-04-07 12:57:27,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,309 INFO L272 TraceCheckUtils]: 13: Hoare triple {11572#(< ~counter~0 17)} 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:57:27,309 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10891#true} {11572#(< ~counter~0 17)} #59#return; {11572#(< ~counter~0 17)} is VALID [2022-04-07 12:57:27,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {10891#true} assume true; {10891#true} is VALID [2022-04-07 12:57:27,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {10891#true} assume !(0 == ~cond); {10891#true} is VALID [2022-04-07 12:57:27,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {10891#true} ~cond := #in~cond; {10891#true} is VALID [2022-04-07 12:57:27,309 INFO L272 TraceCheckUtils]: 8: Hoare triple {11572#(< ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10891#true} is VALID [2022-04-07 12:57:27,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {11572#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {11572#(< ~counter~0 17)} is VALID [2022-04-07 12:57:27,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {11657#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11572#(< ~counter~0 17)} is VALID [2022-04-07 12:57:27,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {11657#(< ~counter~0 16)} 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 16)} is VALID [2022-04-07 12:57:27,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {11657#(< ~counter~0 16)} call #t~ret6 := main(); {11657#(< ~counter~0 16)} is VALID [2022-04-07 12:57:27,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11657#(< ~counter~0 16)} {10891#true} #81#return; {11657#(< ~counter~0 16)} is VALID [2022-04-07 12:57:27,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {11657#(< ~counter~0 16)} assume true; {11657#(< ~counter~0 16)} is VALID [2022-04-07 12:57:27,312 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 16)} is VALID [2022-04-07 12:57:27,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {10891#true} call ULTIMATE.init(); {10891#true} is VALID [2022-04-07 12:57:27,312 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:57:27,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:27,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178029713] [2022-04-07 12:57:27,312 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:27,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098759244] [2022-04-07 12:57:27,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098759244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:27,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:27,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-07 12:57:27,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779796430] [2022-04-07 12:57:27,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:27,313 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:57:27,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:27,314 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:57:27,418 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:57:27,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-07 12:57:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-07 12:57:27,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:57:27,419 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:57:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:29,041 INFO L93 Difference]: Finished difference Result 368 states and 388 transitions. [2022-04-07 12:57:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-07 12:57:29,042 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:57:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:29,042 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:57:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-07 12:57:29,045 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:57:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 241 transitions. [2022-04-07 12:57:29,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 241 transitions. [2022-04-07 12:57:29,252 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:57:29,259 INFO L225 Difference]: With dead ends: 368 [2022-04-07 12:57:29,259 INFO L226 Difference]: Without dead ends: 353 [2022-04-07 12:57:29,259 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:57:29,260 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:57:29,260 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:57:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-07 12:57:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2022-04-07 12:57:29,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:29,427 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:57:29,427 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:57:29,428 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:57:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:29,434 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-07 12:57:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-07 12:57:29,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:29,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:29,436 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:57:29,436 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:57:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:29,442 INFO L93 Difference]: Finished difference Result 353 states and 367 transitions. [2022-04-07 12:57:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 367 transitions. [2022-04-07 12:57:29,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:29,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:29,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:29,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:29,443 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:57:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 326 transitions. [2022-04-07 12:57:29,449 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 326 transitions. Word has length 129 [2022-04-07 12:57:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:29,449 INFO L478 AbstractCegarLoop]: Abstraction has 311 states and 326 transitions. [2022-04-07 12:57:29,449 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:57:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 326 transitions. [2022-04-07 12:57:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 12:57:29,451 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:29,451 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:57:29,485 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:57:29,667 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:57:29,667 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:29,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash 173938976, now seen corresponding path program 3 times [2022-04-07 12:57:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:29,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570224328] [2022-04-07 12:57:29,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:29,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:29,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [637782684] [2022-04-07 12:57:29,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:57:29,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:29,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:29,688 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:57:29,688 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:57:30,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-07 12:57:30,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:30,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 12:57:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:30,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:30,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {13359#true} call ULTIMATE.init(); {13359#true} is VALID [2022-04-07 12:57:30,765 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:57:30,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13359#true} {13359#true} #81#return; {13359#true} is VALID [2022-04-07 12:57:30,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {13359#true} call #t~ret6 := main(); {13359#true} is VALID [2022-04-07 12:57:30,766 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:57:30,766 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:57:30,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {13379#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-07 12:57:30,766 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:57:30,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,767 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:57:30,767 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:57:30,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,768 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:57:30,768 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:57:30,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,768 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:57:30,768 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:57:30,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,769 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:57:30,769 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:57:30,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,770 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:57:30,770 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:57:30,770 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:57:30,771 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 < 20);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:57:30,771 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:57:30,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,771 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:57:30,771 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:57:30,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,772 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:57:30,772 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:57:30,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,773 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:57:30,773 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:57:30,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,773 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:57:30,773 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:57:30,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,774 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:57:30,774 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:57:30,775 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:57:30,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !!(#t~post5 < 20);havoc #t~post5; {13549#(and (= main_~z~0 18) (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-07 12:57:30,775 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:57:30,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,776 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:57:30,776 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:57:30,776 INFO L290 TraceCheckUtils]: 70: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,776 INFO L290 TraceCheckUtils]: 71: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,776 INFO L290 TraceCheckUtils]: 72: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,776 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:57:30,776 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:57:30,777 INFO L290 TraceCheckUtils]: 75: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,777 INFO L290 TraceCheckUtils]: 76: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,777 INFO L290 TraceCheckUtils]: 77: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,777 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:57:30,777 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:57:30,777 INFO L290 TraceCheckUtils]: 80: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,777 INFO L290 TraceCheckUtils]: 81: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,777 INFO L290 TraceCheckUtils]: 82: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,778 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:57:30,778 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:57:30,778 INFO L290 TraceCheckUtils]: 85: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,778 INFO L290 TraceCheckUtils]: 86: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,778 INFO L290 TraceCheckUtils]: 87: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,778 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:57:30,779 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:57:30,779 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:57:30,780 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 < 20);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:57:30,780 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:57:30,780 INFO L290 TraceCheckUtils]: 93: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,780 INFO L290 TraceCheckUtils]: 94: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,780 INFO L290 TraceCheckUtils]: 95: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,780 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:57:30,780 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:57:30,780 INFO L290 TraceCheckUtils]: 98: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,780 INFO L290 TraceCheckUtils]: 99: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,781 INFO L290 TraceCheckUtils]: 100: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,781 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:57:30,781 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:57:30,781 INFO L290 TraceCheckUtils]: 103: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,781 INFO L290 TraceCheckUtils]: 104: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,781 INFO L290 TraceCheckUtils]: 105: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,782 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:57:30,782 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:57:30,782 INFO L290 TraceCheckUtils]: 108: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,782 INFO L290 TraceCheckUtils]: 109: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,782 INFO L290 TraceCheckUtils]: 110: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,782 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:57:30,782 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:57:30,782 INFO L290 TraceCheckUtils]: 113: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,783 INFO L290 TraceCheckUtils]: 114: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,783 INFO L290 TraceCheckUtils]: 115: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,783 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:57:30,783 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:57:30,783 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:57:30,784 INFO L290 TraceCheckUtils]: 119: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,784 INFO L290 TraceCheckUtils]: 120: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,784 INFO L290 TraceCheckUtils]: 121: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,784 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:57:30,784 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:57:30,784 INFO L290 TraceCheckUtils]: 124: Hoare triple {13359#true} ~cond := #in~cond; {13359#true} is VALID [2022-04-07 12:57:30,784 INFO L290 TraceCheckUtils]: 125: Hoare triple {13359#true} assume !(0 == ~cond); {13359#true} is VALID [2022-04-07 12:57:30,784 INFO L290 TraceCheckUtils]: 126: Hoare triple {13359#true} assume true; {13359#true} is VALID [2022-04-07 12:57:30,785 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:57:30,785 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:57:30,786 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:57:30,786 INFO L290 TraceCheckUtils]: 130: Hoare triple {13757#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13360#false} is VALID [2022-04-07 12:57:30,786 INFO L290 TraceCheckUtils]: 131: Hoare triple {13360#false} assume !false; {13360#false} is VALID [2022-04-07 12:57:30,786 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:57:30,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:39,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570224328] [2022-04-07 12:57:39,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:39,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637782684] [2022-04-07 12:57:39,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637782684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 12:57:39,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:57:39,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-07 12:57:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550284420] [2022-04-07 12:57:39,860 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:39,860 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:57:39,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:39,861 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:57:39,915 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:57:39,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:57:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:39,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:57:39,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:57:39,916 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:57:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:41,047 INFO L93 Difference]: Finished difference Result 313 states and 327 transitions. [2022-04-07 12:57:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:57:41,047 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:57:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:41,047 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:57:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:57:41,049 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:57:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-07 12:57:41,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-07 12:57:41,143 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:57:41,148 INFO L225 Difference]: With dead ends: 313 [2022-04-07 12:57:41,148 INFO L226 Difference]: Without dead ends: 302 [2022-04-07 12:57:41,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-07 12:57:41,148 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:57:41,148 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.3s Time] [2022-04-07 12:57:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-07 12:57:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-04-07 12:57:41,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:57:41,336 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:57:41,336 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:57:41,337 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:57:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:41,341 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-07 12:57:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-07 12:57:41,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:41,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:41,342 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:57:41,342 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:57:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:41,349 INFO L93 Difference]: Finished difference Result 302 states and 315 transitions. [2022-04-07 12:57:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-07 12:57:41,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:57:41,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:57:41,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:57:41,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:57:41,350 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:57:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 315 transitions. [2022-04-07 12:57:41,355 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 315 transitions. Word has length 132 [2022-04-07 12:57:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:57:41,355 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 315 transitions. [2022-04-07 12:57:41,355 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:57:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 315 transitions. [2022-04-07 12:57:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-07 12:57:41,356 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:57:41,356 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:57:41,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-07 12:57:41,561 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:57:41,561 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:57:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:57:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1020857049, now seen corresponding path program 3 times [2022-04-07 12:57:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:57:41,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677101106] [2022-04-07 12:57:41,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:57:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:57:41,579 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:57:41,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011757108] [2022-04-07 12:57:41,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 12:57:41,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:57:41,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:57:41,580 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:57:41,581 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:57:42,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-07 12:57:42,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:57:42,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 12:57:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:57:42,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:57:42,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-07 12:57:42,671 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:57:42,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #81#return; {15374#true} is VALID [2022-04-07 12:57:42,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret6 := main(); {15374#true} is VALID [2022-04-07 12:57:42,671 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:57:42,671 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:57:42,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:57:42,671 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:57:42,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,671 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:57:42,672 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:57:42,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,672 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:57:42,672 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:57:42,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,672 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:57:42,672 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:57:42,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,672 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:57:42,672 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:57:42,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,673 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:57:42,673 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:57:42,673 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:57:42,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:57:42,673 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:57:42,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,673 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:57:42,673 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:57:42,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,673 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:57:42,674 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:57:42,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,674 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:57:42,674 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:57:42,674 INFO L290 TraceCheckUtils]: 52: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,674 INFO L290 TraceCheckUtils]: 53: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,674 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:57:42,674 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:57:42,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,674 INFO L290 TraceCheckUtils]: 58: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,674 INFO L290 TraceCheckUtils]: 59: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,674 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:57:42,674 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:57:42,675 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:57:42,675 INFO L290 TraceCheckUtils]: 63: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:57:42,675 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:57:42,675 INFO L290 TraceCheckUtils]: 65: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,675 INFO L290 TraceCheckUtils]: 66: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,675 INFO L290 TraceCheckUtils]: 67: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,675 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:57:42,675 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:57:42,675 INFO L290 TraceCheckUtils]: 70: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,675 INFO L290 TraceCheckUtils]: 71: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,675 INFO L290 TraceCheckUtils]: 72: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,675 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:57:42,675 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:57:42,675 INFO L290 TraceCheckUtils]: 75: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,675 INFO L290 TraceCheckUtils]: 76: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,675 INFO L290 TraceCheckUtils]: 77: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,675 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:57:42,676 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:57:42,676 INFO L290 TraceCheckUtils]: 80: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,676 INFO L290 TraceCheckUtils]: 81: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,676 INFO L290 TraceCheckUtils]: 82: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,676 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:57:42,676 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:57:42,676 INFO L290 TraceCheckUtils]: 85: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,676 INFO L290 TraceCheckUtils]: 86: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,676 INFO L290 TraceCheckUtils]: 87: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,676 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:57:42,676 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:57:42,676 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:57:42,676 INFO L290 TraceCheckUtils]: 91: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:57:42,676 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:57:42,676 INFO L290 TraceCheckUtils]: 93: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,676 INFO L290 TraceCheckUtils]: 94: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,676 INFO L290 TraceCheckUtils]: 95: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:57:42,677 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:57:42,677 INFO L290 TraceCheckUtils]: 98: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L290 TraceCheckUtils]: 99: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L290 TraceCheckUtils]: 100: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:57:42,677 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:57:42,677 INFO L290 TraceCheckUtils]: 103: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L290 TraceCheckUtils]: 104: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L290 TraceCheckUtils]: 105: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:57:42,677 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:57:42,677 INFO L290 TraceCheckUtils]: 108: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L290 TraceCheckUtils]: 109: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L290 TraceCheckUtils]: 110: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,677 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:57:42,678 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:57:42,678 INFO L290 TraceCheckUtils]: 113: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,678 INFO L290 TraceCheckUtils]: 114: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,678 INFO L290 TraceCheckUtils]: 115: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,678 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:57:42,679 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:57:42,679 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:57:42,679 INFO L290 TraceCheckUtils]: 119: Hoare triple {15730#(<= main_~n~0 (+ main_~a~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {15730#(<= main_~n~0 (+ main_~a~0 1))} is VALID [2022-04-07 12:57:42,679 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:57:42,679 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:57:42,680 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:57:42,680 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:57:42,680 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:57:42,681 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:57:42,681 INFO L290 TraceCheckUtils]: 126: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,681 INFO L290 TraceCheckUtils]: 127: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,681 INFO L290 TraceCheckUtils]: 128: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,681 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:57:42,681 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:57:42,681 INFO L290 TraceCheckUtils]: 131: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,681 INFO L290 TraceCheckUtils]: 132: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,681 INFO L290 TraceCheckUtils]: 133: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,682 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:57:42,682 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:57:42,682 INFO L290 TraceCheckUtils]: 136: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,682 INFO L290 TraceCheckUtils]: 137: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,682 INFO L290 TraceCheckUtils]: 138: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,682 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:57:42,683 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:57:42,683 INFO L290 TraceCheckUtils]: 141: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,683 INFO L290 TraceCheckUtils]: 142: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,683 INFO L290 TraceCheckUtils]: 143: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,683 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:57:42,684 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:57:42,684 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:57:42,684 INFO L290 TraceCheckUtils]: 147: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:42,684 INFO L290 TraceCheckUtils]: 148: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:42,684 INFO L290 TraceCheckUtils]: 149: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:42,684 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:57:44,686 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:57:44,687 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:57:44,687 INFO L290 TraceCheckUtils]: 153: Hoare triple {15841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15375#false} is VALID [2022-04-07 12:57:44,687 INFO L290 TraceCheckUtils]: 154: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-07 12:57:44,688 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:57:44,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:57:45,744 INFO L290 TraceCheckUtils]: 154: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-07 12:57:45,745 INFO L290 TraceCheckUtils]: 153: Hoare triple {15841#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15375#false} is VALID [2022-04-07 12:57:45,745 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:57:47,749 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:57:47,749 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:57:47,749 INFO L290 TraceCheckUtils]: 149: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,750 INFO L290 TraceCheckUtils]: 148: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,750 INFO L290 TraceCheckUtils]: 147: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,750 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:57:47,750 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:57:47,751 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:57:47,751 INFO L290 TraceCheckUtils]: 143: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,751 INFO L290 TraceCheckUtils]: 142: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,751 INFO L290 TraceCheckUtils]: 141: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,751 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:57:47,751 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:57:47,752 INFO L290 TraceCheckUtils]: 138: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,752 INFO L290 TraceCheckUtils]: 137: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,752 INFO L290 TraceCheckUtils]: 136: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,752 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:57:47,752 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:57:47,752 INFO L290 TraceCheckUtils]: 133: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,752 INFO L290 TraceCheckUtils]: 132: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,752 INFO L290 TraceCheckUtils]: 131: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,752 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:57:47,753 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:57:47,753 INFO L290 TraceCheckUtils]: 128: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,753 INFO L290 TraceCheckUtils]: 127: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,753 INFO L290 TraceCheckUtils]: 126: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,753 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:57:47,754 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:57:47,754 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:57:47,755 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:57:47,755 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:57:47,755 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:57:47,755 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 < 20);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:57:47,756 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:57:47,756 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:57:47,757 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 115: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 114: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 113: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,757 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:57:47,757 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 110: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 109: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 108: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,757 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:57:47,757 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 105: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 104: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 103: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,757 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:57:47,757 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:57:47,757 INFO L290 TraceCheckUtils]: 100: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,758 INFO L290 TraceCheckUtils]: 99: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,758 INFO L290 TraceCheckUtils]: 98: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,758 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:57:47,758 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:57:47,758 INFO L290 TraceCheckUtils]: 95: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,758 INFO L290 TraceCheckUtils]: 94: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,758 INFO L290 TraceCheckUtils]: 93: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,758 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:57:47,758 INFO L290 TraceCheckUtils]: 91: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:57:47,758 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:57:47,758 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:57:47,758 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:57:47,758 INFO L290 TraceCheckUtils]: 87: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,758 INFO L290 TraceCheckUtils]: 86: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,758 INFO L290 TraceCheckUtils]: 85: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,758 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:57:47,758 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 82: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 81: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 80: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,759 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:57:47,759 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 77: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 76: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 75: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,759 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:57:47,759 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 72: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 71: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 70: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,759 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:57:47,759 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:57:47,759 INFO L290 TraceCheckUtils]: 67: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,760 INFO L290 TraceCheckUtils]: 66: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,760 INFO L290 TraceCheckUtils]: 65: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,760 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:57:47,760 INFO L290 TraceCheckUtils]: 63: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:57:47,760 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:57:47,760 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:57:47,760 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:57:47,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,760 INFO L290 TraceCheckUtils]: 57: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,760 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:57:47,760 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:57:47,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,760 INFO L290 TraceCheckUtils]: 53: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,760 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:57:47,760 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:57:47,761 INFO L290 TraceCheckUtils]: 49: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,761 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:57:47,761 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:57:47,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,761 INFO L290 TraceCheckUtils]: 43: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,761 INFO L290 TraceCheckUtils]: 42: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,761 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:57:47,761 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:57:47,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,761 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:57:47,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:57:47,761 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:57:47,761 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:57:47,762 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15374#true} {15374#true} #67#return; {15374#true} is VALID [2022-04-07 12:57:47,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,762 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:57:47,762 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {15374#true} {15374#true} #65#return; {15374#true} is VALID [2022-04-07 12:57:47,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,762 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:57:47,762 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15374#true} {15374#true} #63#return; {15374#true} is VALID [2022-04-07 12:57:47,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,762 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:57:47,762 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15374#true} {15374#true} #61#return; {15374#true} is VALID [2022-04-07 12:57:47,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,763 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:57:47,763 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15374#true} {15374#true} #59#return; {15374#true} is VALID [2022-04-07 12:57:47,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {15374#true} assume !(0 == ~cond); {15374#true} is VALID [2022-04-07 12:57:47,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {15374#true} ~cond := #in~cond; {15374#true} is VALID [2022-04-07 12:57:47,763 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:57:47,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {15374#true} assume !!(#t~post5 < 20);havoc #t~post5; {15374#true} is VALID [2022-04-07 12:57:47,763 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:57:47,763 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:57:47,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret6 := main(); {15374#true} is VALID [2022-04-07 12:57:47,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #81#return; {15374#true} is VALID [2022-04-07 12:57:47,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-07 12:57:47,763 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:57:47,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-07 12:57:47,764 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:57:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:57:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677101106] [2022-04-07 12:57:47,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:57:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011757108] [2022-04-07 12:57:47,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011757108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:57:47,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:57:47,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-04-07 12:57:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032390147] [2022-04-07 12:57:47,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:57:47,765 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:57:47,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:57:47,766 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:57:49,825 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:57:49,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-07 12:57:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:57:49,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-07 12:57:49,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:57:49,826 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:57:54,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:57:55,432 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 12:57:58,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 12:57:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:57:59,155 INFO L93 Difference]: Finished difference Result 311 states and 325 transitions. [2022-04-07 12:57:59,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:57:59,155 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:57:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:57:59,156 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:57:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-07 12:57:59,157 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:57:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-04-07 12:57:59,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-04-07 12:58:01,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 57 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:58:01,216 INFO L225 Difference]: With dead ends: 311 [2022-04-07 12:58:01,216 INFO L226 Difference]: Without dead ends: 309 [2022-04-07 12:58:01,216 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:58:01,216 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-07 12:58:01,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 113 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-07 12:58:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-07 12:58:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2022-04-07 12:58:01,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:58:01,405 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:01,405 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:01,406 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:01,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:01,411 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-07 12:58:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-07 12:58:01,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:01,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:01,412 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:01,412 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:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:58:01,416 INFO L93 Difference]: Finished difference Result 309 states and 323 transitions. [2022-04-07 12:58:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 323 transitions. [2022-04-07 12:58:01,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:58:01,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:58:01,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:58:01,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:58:01,418 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:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 322 transitions. [2022-04-07 12:58:01,422 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 322 transitions. Word has length 155 [2022-04-07 12:58:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:58:01,423 INFO L478 AbstractCegarLoop]: Abstraction has 308 states and 322 transitions. [2022-04-07 12:58:01,423 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:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2022-04-07 12:58:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-07 12:58:01,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:58:01,424 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:01,429 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:01,629 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:01,629 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:58:01,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:58:01,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2056924759, now seen corresponding path program 4 times [2022-04-07 12:58:01,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:58:01,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452204473] [2022-04-07 12:58:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:58:01,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:58:01,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:58:01,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552665444] [2022-04-07 12:58:01,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 12:58:01,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:58:01,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:58:01,644 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:01,650 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:03,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 12:58:03,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:58:03,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-07 12:58:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:58:03,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:00:24,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {17813#true} call ULTIMATE.init(); {17813#true} is VALID [2022-04-07 13:00:24,148 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:00:24,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:24,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17813#true} {17813#true} #81#return; {17813#true} is VALID [2022-04-07 13:00:24,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {17813#true} call #t~ret6 := main(); {17813#true} is VALID [2022-04-07 13:00:24,149 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:00:24,149 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:00:24,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {17813#true} assume !!(#t~post5 < 20);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:00:24,149 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:00:24,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:24,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:24,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:24,149 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:00:24,149 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:00:24,149 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:00:24,150 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:00:24,150 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:00:24,150 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:00:24,151 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:00:24,151 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:00:24,151 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:00:24,151 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:00:24,152 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:00:24,152 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:00:24,152 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:00:24,152 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:00:24,153 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:00:24,153 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:00:24,153 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:00:24,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:24,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:24,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:24,154 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:00:26,155 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:00:26,156 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:00:26,157 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 < 20);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:00:26,157 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:00:26,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:26,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:26,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:26,157 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:00:26,157 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:00:26,158 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:00:26,158 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:00:26,158 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:00:26,159 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:00:26,159 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:00:26,159 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:00:26,159 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:00:26,159 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:00:26,160 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:00:26,160 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:00:26,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:26,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:26,161 INFO L290 TraceCheckUtils]: 54: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:26,161 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:00:26,161 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:00:26,161 INFO L290 TraceCheckUtils]: 57: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:26,161 INFO L290 TraceCheckUtils]: 58: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:26,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:26,162 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:00:28,163 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:00:28,164 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:00:28,164 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 < 20);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:00:28,164 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:00:28,164 INFO L290 TraceCheckUtils]: 65: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:28,164 INFO L290 TraceCheckUtils]: 66: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:28,164 INFO L290 TraceCheckUtils]: 67: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:28,165 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:00:28,165 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:00:28,165 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:00:28,165 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:00:28,166 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:00:28,166 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:00:28,166 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:00:28,166 INFO L290 TraceCheckUtils]: 75: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:28,166 INFO L290 TraceCheckUtils]: 76: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:28,166 INFO L290 TraceCheckUtils]: 77: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:28,167 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:00:28,167 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:00:28,167 INFO L290 TraceCheckUtils]: 80: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:28,167 INFO L290 TraceCheckUtils]: 81: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:28,167 INFO L290 TraceCheckUtils]: 82: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:28,167 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:00:28,168 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:00:28,168 INFO L290 TraceCheckUtils]: 85: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:28,168 INFO L290 TraceCheckUtils]: 86: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:28,168 INFO L290 TraceCheckUtils]: 87: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:28,168 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:00:30,169 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:00:30,170 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:00:30,171 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 < 20);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:00:30,171 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:00:30,171 INFO L290 TraceCheckUtils]: 93: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:30,171 INFO L290 TraceCheckUtils]: 94: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:30,171 INFO L290 TraceCheckUtils]: 95: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:30,171 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:00:30,171 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:00:30,172 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:00:30,172 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:00:30,172 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:00:30,173 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:00:30,173 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:00:30,173 INFO L290 TraceCheckUtils]: 103: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:30,173 INFO L290 TraceCheckUtils]: 104: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:30,173 INFO L290 TraceCheckUtils]: 105: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:30,173 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:00:30,173 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:00:30,173 INFO L290 TraceCheckUtils]: 108: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:30,173 INFO L290 TraceCheckUtils]: 109: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:30,174 INFO L290 TraceCheckUtils]: 110: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:30,174 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:00:30,174 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:00:30,174 INFO L290 TraceCheckUtils]: 113: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:30,174 INFO L290 TraceCheckUtils]: 114: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:30,174 INFO L290 TraceCheckUtils]: 115: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:30,175 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:00:32,176 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:00:32,177 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:00:32,178 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 < 20);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:00:32,178 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:00:32,178 INFO L290 TraceCheckUtils]: 121: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:32,178 INFO L290 TraceCheckUtils]: 122: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:32,178 INFO L290 TraceCheckUtils]: 123: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:32,179 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:00:32,179 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:00:32,179 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:00:32,179 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:00:32,179 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:00:32,180 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:00:32,180 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:00:32,180 INFO L290 TraceCheckUtils]: 131: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:32,180 INFO L290 TraceCheckUtils]: 132: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:32,180 INFO L290 TraceCheckUtils]: 133: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:32,181 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:00:32,181 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:00:32,181 INFO L290 TraceCheckUtils]: 136: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:32,181 INFO L290 TraceCheckUtils]: 137: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:32,181 INFO L290 TraceCheckUtils]: 138: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:32,181 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:00:32,181 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:00:32,181 INFO L290 TraceCheckUtils]: 141: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:32,182 INFO L290 TraceCheckUtils]: 142: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:32,182 INFO L290 TraceCheckUtils]: 143: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:32,182 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:00:32,183 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:00:32,183 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:00:32,183 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:00:32,183 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:00:32,183 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:00:32,580 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:00:32,581 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:00:32,581 INFO L290 TraceCheckUtils]: 152: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:32,581 INFO L290 TraceCheckUtils]: 153: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:32,581 INFO L290 TraceCheckUtils]: 154: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:32,581 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:00:32,587 INFO 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#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:00:32,587 INFO L290 TraceCheckUtils]: 157: Hoare triple {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:00:32,588 INFO L290 TraceCheckUtils]: 158: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17814#false} is VALID [2022-04-07 13:00:32,588 INFO L290 TraceCheckUtils]: 159: Hoare triple {17814#false} assume !false; {17814#false} is VALID [2022-04-07 13:00:32,589 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:00:32,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:00:41,395 INFO L290 TraceCheckUtils]: 159: Hoare triple {17814#false} assume !false; {17814#false} is VALID [2022-04-07 13:00:41,396 INFO L290 TraceCheckUtils]: 158: Hoare triple {18299#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17814#false} is VALID [2022-04-07 13:00:41,396 INFO L290 TraceCheckUtils]: 157: Hoare triple {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18299#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:00:41,397 INFO L272 TraceCheckUtils]: 156: Hoare triple {18315#(= (+ (* 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)); {18295#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:00:41,397 INFO L284 TraceCheckUtils]: 155: Hoare quadruple {17813#true} {18315#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #71#return; {18315#(= (+ (* 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:00:41,397 INFO L290 TraceCheckUtils]: 154: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,398 INFO L290 TraceCheckUtils]: 153: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,398 INFO L290 TraceCheckUtils]: 152: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,398 INFO L272 TraceCheckUtils]: 151: Hoare triple {18315#(= (+ (* 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:00:41,398 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18334#(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; {18315#(= (+ (* 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:00:41,398 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:00:41,399 INFO L290 TraceCheckUtils]: 148: Hoare triple {18344#(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:00:41,399 INFO L290 TraceCheckUtils]: 147: Hoare triple {17813#true} ~cond := #in~cond; {18344#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:00:41,399 INFO L272 TraceCheckUtils]: 146: Hoare triple {18334#(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:00:41,400 INFO L290 TraceCheckUtils]: 145: Hoare triple {18351#(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); {18334#(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:00:41,400 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {17813#true} {18351#(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; {18351#(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:00:41,400 INFO L290 TraceCheckUtils]: 143: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,400 INFO L290 TraceCheckUtils]: 142: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,400 INFO L290 TraceCheckUtils]: 141: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,400 INFO L272 TraceCheckUtils]: 140: Hoare triple {18351#(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:00:41,401 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {17813#true} {18351#(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; {18351#(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:00:41,401 INFO L290 TraceCheckUtils]: 138: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,401 INFO L290 TraceCheckUtils]: 137: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,401 INFO L290 TraceCheckUtils]: 136: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,401 INFO L272 TraceCheckUtils]: 135: Hoare triple {18351#(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:00:41,401 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {17813#true} {18351#(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; {18351#(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:00:41,401 INFO L290 TraceCheckUtils]: 133: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,402 INFO L290 TraceCheckUtils]: 132: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,402 INFO L290 TraceCheckUtils]: 131: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,402 INFO L272 TraceCheckUtils]: 130: Hoare triple {18351#(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:00:41,402 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17864#(not (= |__VERIFIER_assert_#in~cond| 0))} {18400#(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; {18351#(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:00:41,402 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:00:41,403 INFO L290 TraceCheckUtils]: 127: Hoare triple {18344#(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:00:41,403 INFO L290 TraceCheckUtils]: 126: Hoare triple {17813#true} ~cond := #in~cond; {18344#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:00:41,403 INFO L272 TraceCheckUtils]: 125: Hoare triple {18400#(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:00:41,404 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17813#true} {18400#(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; {18400#(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:00:41,404 INFO L290 TraceCheckUtils]: 123: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,404 INFO L290 TraceCheckUtils]: 122: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,404 INFO L290 TraceCheckUtils]: 121: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,404 INFO L272 TraceCheckUtils]: 120: Hoare triple {18400#(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:00:41,404 INFO L290 TraceCheckUtils]: 119: Hoare triple {18400#(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 < 20);havoc #t~post5; {18400#(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:00:41,405 INFO L290 TraceCheckUtils]: 118: Hoare triple {18400#(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; {18400#(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:00:41,408 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; {18400#(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:00:41,408 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-07 13:00:41,408 INFO L290 TraceCheckUtils]: 115: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,408 INFO L290 TraceCheckUtils]: 114: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,408 INFO L290 TraceCheckUtils]: 113: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,408 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:00:41,408 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-07 13:00:41,408 INFO L290 TraceCheckUtils]: 110: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,408 INFO L290 TraceCheckUtils]: 109: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,408 INFO L290 TraceCheckUtils]: 108: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,408 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:00:41,408 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-07 13:00:41,409 INFO L290 TraceCheckUtils]: 105: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,409 INFO L290 TraceCheckUtils]: 104: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,409 INFO L290 TraceCheckUtils]: 103: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,409 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:00:41,409 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-07 13:00:41,409 INFO L290 TraceCheckUtils]: 100: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,409 INFO L290 TraceCheckUtils]: 99: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,409 INFO L290 TraceCheckUtils]: 98: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,409 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:00:41,409 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:00:41,409 INFO L290 TraceCheckUtils]: 95: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,409 INFO L290 TraceCheckUtils]: 94: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,409 INFO L290 TraceCheckUtils]: 93: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,409 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:00:41,409 INFO L290 TraceCheckUtils]: 91: Hoare triple {17813#true} assume !!(#t~post5 < 20);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:00:41,409 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:00:41,409 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:00:41,409 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 87: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 86: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 85: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,410 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:00:41,410 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 82: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 81: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 80: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,410 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:00:41,410 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 77: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 76: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 75: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,410 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:00:41,410 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-07 13:00:41,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,411 INFO L290 TraceCheckUtils]: 71: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,411 INFO L290 TraceCheckUtils]: 70: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,411 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:00:41,411 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:00:41,411 INFO L290 TraceCheckUtils]: 67: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,411 INFO L290 TraceCheckUtils]: 66: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,411 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:00:41,411 INFO L290 TraceCheckUtils]: 63: Hoare triple {17813#true} assume !!(#t~post5 < 20);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:00:41,411 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:00:41,411 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:00:41,411 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-07 13:00:41,411 INFO L290 TraceCheckUtils]: 59: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,411 INFO L290 TraceCheckUtils]: 58: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,412 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:00:41,412 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-07 13:00:41,412 INFO L290 TraceCheckUtils]: 54: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,412 INFO L290 TraceCheckUtils]: 53: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,412 INFO L290 TraceCheckUtils]: 52: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,412 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:00:41,412 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-07 13:00:41,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,412 INFO L290 TraceCheckUtils]: 47: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,412 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:00:41,412 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-07 13:00:41,412 INFO L290 TraceCheckUtils]: 44: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,413 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:00:41,413 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:00:41,413 INFO L290 TraceCheckUtils]: 39: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,413 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:00:41,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {17813#true} assume !!(#t~post5 < 20);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:00:41,413 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:00:41,413 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:00:41,413 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17813#true} {17813#true} #67#return; {17813#true} is VALID [2022-04-07 13:00:41,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,413 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:00:41,413 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17813#true} {17813#true} #65#return; {17813#true} is VALID [2022-04-07 13:00:41,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,414 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:00:41,414 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17813#true} {17813#true} #63#return; {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,414 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:00:41,414 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17813#true} {17813#true} #61#return; {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,414 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:00:41,414 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17813#true} {17813#true} #59#return; {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {17813#true} assume !(0 == ~cond); {17813#true} is VALID [2022-04-07 13:00:41,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {17813#true} ~cond := #in~cond; {17813#true} is VALID [2022-04-07 13:00:41,415 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:00:41,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {17813#true} assume !!(#t~post5 < 20);havoc #t~post5; {17813#true} is VALID [2022-04-07 13:00:41,415 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:00:41,415 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:00:41,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {17813#true} call #t~ret6 := main(); {17813#true} is VALID [2022-04-07 13:00:41,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17813#true} {17813#true} #81#return; {17813#true} is VALID [2022-04-07 13:00:41,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {17813#true} assume true; {17813#true} is VALID [2022-04-07 13:00:41,415 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:00:41,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {17813#true} call ULTIMATE.init(); {17813#true} is VALID [2022-04-07 13:00:41,416 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:00:41,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:00:41,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452204473] [2022-04-07 13:00:41,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:00:41,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552665444] [2022-04-07 13:00:41,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552665444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:00:41,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:00:41,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-07 13:00:41,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881602524] [2022-04-07 13:00:41,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:00:41,417 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-04-07 13:00:41,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:00:41,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-07 13:00:49,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 93 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-07 13:00:49,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-07 13:00:49,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:00:49,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-07 13:00:49,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=241, Unknown=1, NotChecked=0, Total=306 [2022-04-07 13:00:49,585 INFO L87 Difference]: Start difference. First operand 308 states and 322 transitions. Second operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-07 13:00:52,514 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:00:57,472 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:01:00,339 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:01:02,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:01:03,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:01:13,284 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:01:17,366 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:01:19,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:01:21,458 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:01:23,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:01:25,555 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:01:27,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:01:30,876 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:01:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:31,224 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2022-04-07 13:01:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 13:01:31,224 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) Word has length 160 [2022-04-07 13:01:31,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:01:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-07 13:01:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-07 13:01:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-07 13:01:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 54 transitions. [2022-04-07 13:01:31,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 54 transitions. [2022-04-07 13:01:33,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:33,525 INFO L225 Difference]: With dead ends: 315 [2022-04-07 13:01:33,525 INFO L226 Difference]: Without dead ends: 294 [2022-04-07 13:01:33,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 300 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=125, Invalid=426, Unknown=1, NotChecked=0, Total=552 [2022-04-07 13:01:33,526 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 95 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2022-04-07 13:01:33,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 101 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 192 Invalid, 11 Unknown, 0 Unchecked, 31.9s Time] [2022-04-07 13:01:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-04-07 13:01:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-04-07 13:01:33,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:01:33,703 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:01:33,703 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:01:33,704 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:01:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:33,707 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-07 13:01:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-07 13:01:33,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:33,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:33,708 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:01:33,709 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:01:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:33,712 INFO L93 Difference]: Finished difference Result 294 states and 295 transitions. [2022-04-07 13:01:33,713 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-07 13:01:33,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:33,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:33,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:01:33,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:01:33,713 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:01:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2022-04-07 13:01:33,718 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 160 [2022-04-07 13:01:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:01:33,718 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2022-04-07 13:01:33,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 12 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 10 states have call predecessors, (32), 12 states have call successors, (32) [2022-04-07 13:01:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2022-04-07 13:01:33,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-04-07 13:01:33,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:01:33,721 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:01:33,726 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:01:33,926 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:01:33,927 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:01:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:01:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1533533153, now seen corresponding path program 3 times [2022-04-07 13:01:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:01:33,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257043951] [2022-04-07 13:01:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:01:33,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:01:33,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423637299] [2022-04-07 13:01:33,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-07 13:01:33,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:33,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:01:33,942 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:01:33,943 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:01:34,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2022-04-07 13:01:34,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 13:01:34,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-07 13:01:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:01:34,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:01:35,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {20248#true} call ULTIMATE.init(); {20248#true} is VALID [2022-04-07 13:01:35,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {20248#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; {20256#(<= ~counter~0 0)} is VALID [2022-04-07 13:01:35,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {20256#(<= ~counter~0 0)} assume true; {20256#(<= ~counter~0 0)} is VALID [2022-04-07 13:01:35,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20256#(<= ~counter~0 0)} {20248#true} #81#return; {20256#(<= ~counter~0 0)} is VALID [2022-04-07 13:01:35,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {20256#(<= ~counter~0 0)} call #t~ret6 := main(); {20256#(<= ~counter~0 0)} is VALID [2022-04-07 13:01:35,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {20256#(<= ~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; {20256#(<= ~counter~0 0)} is VALID [2022-04-07 13:01:35,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {20256#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {20272#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,331 INFO L272 TraceCheckUtils]: 8: Hoare triple {20272#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {20272#(<= ~counter~0 1)} ~cond := #in~cond; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {20272#(<= ~counter~0 1)} assume !(0 == ~cond); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {20272#(<= ~counter~0 1)} assume true; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,332 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20272#(<= ~counter~0 1)} {20272#(<= ~counter~0 1)} #59#return; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,333 INFO L272 TraceCheckUtils]: 13: Hoare triple {20272#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {20272#(<= ~counter~0 1)} ~cond := #in~cond; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {20272#(<= ~counter~0 1)} assume !(0 == ~cond); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {20272#(<= ~counter~0 1)} assume true; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,334 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20272#(<= ~counter~0 1)} {20272#(<= ~counter~0 1)} #61#return; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,334 INFO L272 TraceCheckUtils]: 18: Hoare triple {20272#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {20272#(<= ~counter~0 1)} ~cond := #in~cond; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {20272#(<= ~counter~0 1)} assume !(0 == ~cond); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {20272#(<= ~counter~0 1)} assume true; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,335 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20272#(<= ~counter~0 1)} {20272#(<= ~counter~0 1)} #63#return; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,336 INFO L272 TraceCheckUtils]: 23: Hoare triple {20272#(<= ~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)); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {20272#(<= ~counter~0 1)} ~cond := #in~cond; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {20272#(<= ~counter~0 1)} assume !(0 == ~cond); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {20272#(<= ~counter~0 1)} assume true; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,337 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20272#(<= ~counter~0 1)} {20272#(<= ~counter~0 1)} #65#return; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,337 INFO L272 TraceCheckUtils]: 28: Hoare triple {20272#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {20272#(<= ~counter~0 1)} ~cond := #in~cond; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {20272#(<= ~counter~0 1)} assume !(0 == ~cond); {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {20272#(<= ~counter~0 1)} assume true; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,338 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20272#(<= ~counter~0 1)} {20272#(<= ~counter~0 1)} #67#return; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {20272#(<= ~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; {20272#(<= ~counter~0 1)} is VALID [2022-04-07 13:01:35,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {20272#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {20357#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,340 INFO L272 TraceCheckUtils]: 36: Hoare triple {20357#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,340 INFO L290 TraceCheckUtils]: 37: Hoare triple {20357#(<= ~counter~0 2)} ~cond := #in~cond; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {20357#(<= ~counter~0 2)} assume !(0 == ~cond); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,340 INFO L290 TraceCheckUtils]: 39: Hoare triple {20357#(<= ~counter~0 2)} assume true; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,341 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20357#(<= ~counter~0 2)} {20357#(<= ~counter~0 2)} #59#return; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,341 INFO L272 TraceCheckUtils]: 41: Hoare triple {20357#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {20357#(<= ~counter~0 2)} ~cond := #in~cond; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {20357#(<= ~counter~0 2)} assume !(0 == ~cond); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {20357#(<= ~counter~0 2)} assume true; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,342 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20357#(<= ~counter~0 2)} {20357#(<= ~counter~0 2)} #61#return; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,343 INFO L272 TraceCheckUtils]: 46: Hoare triple {20357#(<= ~counter~0 2)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,343 INFO L290 TraceCheckUtils]: 47: Hoare triple {20357#(<= ~counter~0 2)} ~cond := #in~cond; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,343 INFO L290 TraceCheckUtils]: 48: Hoare triple {20357#(<= ~counter~0 2)} assume !(0 == ~cond); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {20357#(<= ~counter~0 2)} assume true; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,344 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20357#(<= ~counter~0 2)} {20357#(<= ~counter~0 2)} #63#return; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,344 INFO L272 TraceCheckUtils]: 51: Hoare triple {20357#(<= ~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)); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {20357#(<= ~counter~0 2)} ~cond := #in~cond; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,345 INFO L290 TraceCheckUtils]: 53: Hoare triple {20357#(<= ~counter~0 2)} assume !(0 == ~cond); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,345 INFO L290 TraceCheckUtils]: 54: Hoare triple {20357#(<= ~counter~0 2)} assume true; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,345 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20357#(<= ~counter~0 2)} {20357#(<= ~counter~0 2)} #65#return; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,346 INFO L272 TraceCheckUtils]: 56: Hoare triple {20357#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,346 INFO L290 TraceCheckUtils]: 57: Hoare triple {20357#(<= ~counter~0 2)} ~cond := #in~cond; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {20357#(<= ~counter~0 2)} assume !(0 == ~cond); {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,347 INFO L290 TraceCheckUtils]: 59: Hoare triple {20357#(<= ~counter~0 2)} assume true; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,347 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20357#(<= ~counter~0 2)} {20357#(<= ~counter~0 2)} #67#return; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,347 INFO L290 TraceCheckUtils]: 61: Hoare triple {20357#(<= ~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; {20357#(<= ~counter~0 2)} is VALID [2022-04-07 13:01:35,348 INFO L290 TraceCheckUtils]: 62: Hoare triple {20357#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,348 INFO L290 TraceCheckUtils]: 63: Hoare triple {20442#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,348 INFO L272 TraceCheckUtils]: 64: Hoare triple {20442#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,349 INFO L290 TraceCheckUtils]: 65: Hoare triple {20442#(<= ~counter~0 3)} ~cond := #in~cond; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,349 INFO L290 TraceCheckUtils]: 66: Hoare triple {20442#(<= ~counter~0 3)} assume !(0 == ~cond); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,349 INFO L290 TraceCheckUtils]: 67: Hoare triple {20442#(<= ~counter~0 3)} assume true; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,349 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20442#(<= ~counter~0 3)} {20442#(<= ~counter~0 3)} #59#return; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,350 INFO L272 TraceCheckUtils]: 69: Hoare triple {20442#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,350 INFO L290 TraceCheckUtils]: 70: Hoare triple {20442#(<= ~counter~0 3)} ~cond := #in~cond; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,350 INFO L290 TraceCheckUtils]: 71: Hoare triple {20442#(<= ~counter~0 3)} assume !(0 == ~cond); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,351 INFO L290 TraceCheckUtils]: 72: Hoare triple {20442#(<= ~counter~0 3)} assume true; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,351 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20442#(<= ~counter~0 3)} {20442#(<= ~counter~0 3)} #61#return; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,351 INFO L272 TraceCheckUtils]: 74: Hoare triple {20442#(<= ~counter~0 3)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,352 INFO L290 TraceCheckUtils]: 75: Hoare triple {20442#(<= ~counter~0 3)} ~cond := #in~cond; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,352 INFO L290 TraceCheckUtils]: 76: Hoare triple {20442#(<= ~counter~0 3)} assume !(0 == ~cond); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,352 INFO L290 TraceCheckUtils]: 77: Hoare triple {20442#(<= ~counter~0 3)} assume true; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,352 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20442#(<= ~counter~0 3)} {20442#(<= ~counter~0 3)} #63#return; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,353 INFO L272 TraceCheckUtils]: 79: Hoare triple {20442#(<= ~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)); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,353 INFO L290 TraceCheckUtils]: 80: Hoare triple {20442#(<= ~counter~0 3)} ~cond := #in~cond; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,353 INFO L290 TraceCheckUtils]: 81: Hoare triple {20442#(<= ~counter~0 3)} assume !(0 == ~cond); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,354 INFO L290 TraceCheckUtils]: 82: Hoare triple {20442#(<= ~counter~0 3)} assume true; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,354 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {20442#(<= ~counter~0 3)} {20442#(<= ~counter~0 3)} #65#return; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,354 INFO L272 TraceCheckUtils]: 84: Hoare triple {20442#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,355 INFO L290 TraceCheckUtils]: 85: Hoare triple {20442#(<= ~counter~0 3)} ~cond := #in~cond; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {20442#(<= ~counter~0 3)} assume !(0 == ~cond); {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,355 INFO L290 TraceCheckUtils]: 87: Hoare triple {20442#(<= ~counter~0 3)} assume true; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,356 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20442#(<= ~counter~0 3)} {20442#(<= ~counter~0 3)} #67#return; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,356 INFO L290 TraceCheckUtils]: 89: Hoare triple {20442#(<= ~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; {20442#(<= ~counter~0 3)} is VALID [2022-04-07 13:01:35,356 INFO L290 TraceCheckUtils]: 90: Hoare triple {20442#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,357 INFO L290 TraceCheckUtils]: 91: Hoare triple {20527#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,357 INFO L272 TraceCheckUtils]: 92: Hoare triple {20527#(<= ~counter~0 4)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {20527#(<= ~counter~0 4)} ~cond := #in~cond; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {20527#(<= ~counter~0 4)} assume !(0 == ~cond); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,358 INFO L290 TraceCheckUtils]: 95: Hoare triple {20527#(<= ~counter~0 4)} assume true; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,358 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20527#(<= ~counter~0 4)} {20527#(<= ~counter~0 4)} #59#return; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,358 INFO L272 TraceCheckUtils]: 97: Hoare triple {20527#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,359 INFO L290 TraceCheckUtils]: 98: Hoare triple {20527#(<= ~counter~0 4)} ~cond := #in~cond; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,359 INFO L290 TraceCheckUtils]: 99: Hoare triple {20527#(<= ~counter~0 4)} assume !(0 == ~cond); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,359 INFO L290 TraceCheckUtils]: 100: Hoare triple {20527#(<= ~counter~0 4)} assume true; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,360 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20527#(<= ~counter~0 4)} {20527#(<= ~counter~0 4)} #61#return; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,360 INFO L272 TraceCheckUtils]: 102: Hoare triple {20527#(<= ~counter~0 4)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,360 INFO L290 TraceCheckUtils]: 103: Hoare triple {20527#(<= ~counter~0 4)} ~cond := #in~cond; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,361 INFO L290 TraceCheckUtils]: 104: Hoare triple {20527#(<= ~counter~0 4)} assume !(0 == ~cond); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,361 INFO L290 TraceCheckUtils]: 105: Hoare triple {20527#(<= ~counter~0 4)} assume true; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,361 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20527#(<= ~counter~0 4)} {20527#(<= ~counter~0 4)} #63#return; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,362 INFO L272 TraceCheckUtils]: 107: Hoare triple {20527#(<= ~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)); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,362 INFO L290 TraceCheckUtils]: 108: Hoare triple {20527#(<= ~counter~0 4)} ~cond := #in~cond; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,362 INFO L290 TraceCheckUtils]: 109: Hoare triple {20527#(<= ~counter~0 4)} assume !(0 == ~cond); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,362 INFO L290 TraceCheckUtils]: 110: Hoare triple {20527#(<= ~counter~0 4)} assume true; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,363 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20527#(<= ~counter~0 4)} {20527#(<= ~counter~0 4)} #65#return; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,363 INFO L272 TraceCheckUtils]: 112: Hoare triple {20527#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,363 INFO L290 TraceCheckUtils]: 113: Hoare triple {20527#(<= ~counter~0 4)} ~cond := #in~cond; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,364 INFO L290 TraceCheckUtils]: 114: Hoare triple {20527#(<= ~counter~0 4)} assume !(0 == ~cond); {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,364 INFO L290 TraceCheckUtils]: 115: Hoare triple {20527#(<= ~counter~0 4)} assume true; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,364 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20527#(<= ~counter~0 4)} {20527#(<= ~counter~0 4)} #67#return; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,365 INFO L290 TraceCheckUtils]: 117: Hoare triple {20527#(<= ~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; {20527#(<= ~counter~0 4)} is VALID [2022-04-07 13:01:35,365 INFO L290 TraceCheckUtils]: 118: Hoare triple {20527#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,365 INFO L290 TraceCheckUtils]: 119: Hoare triple {20612#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,366 INFO L272 TraceCheckUtils]: 120: Hoare triple {20612#(<= ~counter~0 5)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,366 INFO L290 TraceCheckUtils]: 121: Hoare triple {20612#(<= ~counter~0 5)} ~cond := #in~cond; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,366 INFO L290 TraceCheckUtils]: 122: Hoare triple {20612#(<= ~counter~0 5)} assume !(0 == ~cond); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,367 INFO L290 TraceCheckUtils]: 123: Hoare triple {20612#(<= ~counter~0 5)} assume true; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,367 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20612#(<= ~counter~0 5)} {20612#(<= ~counter~0 5)} #59#return; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,367 INFO L272 TraceCheckUtils]: 125: Hoare triple {20612#(<= ~counter~0 5)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,368 INFO L290 TraceCheckUtils]: 126: Hoare triple {20612#(<= ~counter~0 5)} ~cond := #in~cond; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,368 INFO L290 TraceCheckUtils]: 127: Hoare triple {20612#(<= ~counter~0 5)} assume !(0 == ~cond); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,368 INFO L290 TraceCheckUtils]: 128: Hoare triple {20612#(<= ~counter~0 5)} assume true; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,368 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20612#(<= ~counter~0 5)} {20612#(<= ~counter~0 5)} #61#return; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,369 INFO L272 TraceCheckUtils]: 130: Hoare triple {20612#(<= ~counter~0 5)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,369 INFO L290 TraceCheckUtils]: 131: Hoare triple {20612#(<= ~counter~0 5)} ~cond := #in~cond; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,369 INFO L290 TraceCheckUtils]: 132: Hoare triple {20612#(<= ~counter~0 5)} assume !(0 == ~cond); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,370 INFO L290 TraceCheckUtils]: 133: Hoare triple {20612#(<= ~counter~0 5)} assume true; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,370 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20612#(<= ~counter~0 5)} {20612#(<= ~counter~0 5)} #63#return; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,370 INFO L272 TraceCheckUtils]: 135: Hoare triple {20612#(<= ~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)); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,371 INFO L290 TraceCheckUtils]: 136: Hoare triple {20612#(<= ~counter~0 5)} ~cond := #in~cond; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,371 INFO L290 TraceCheckUtils]: 137: Hoare triple {20612#(<= ~counter~0 5)} assume !(0 == ~cond); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,371 INFO L290 TraceCheckUtils]: 138: Hoare triple {20612#(<= ~counter~0 5)} assume true; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,372 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {20612#(<= ~counter~0 5)} {20612#(<= ~counter~0 5)} #65#return; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,372 INFO L272 TraceCheckUtils]: 140: Hoare triple {20612#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,372 INFO L290 TraceCheckUtils]: 141: Hoare triple {20612#(<= ~counter~0 5)} ~cond := #in~cond; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,372 INFO L290 TraceCheckUtils]: 142: Hoare triple {20612#(<= ~counter~0 5)} assume !(0 == ~cond); {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,373 INFO L290 TraceCheckUtils]: 143: Hoare triple {20612#(<= ~counter~0 5)} assume true; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,373 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20612#(<= ~counter~0 5)} {20612#(<= ~counter~0 5)} #67#return; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,373 INFO L290 TraceCheckUtils]: 145: Hoare triple {20612#(<= ~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; {20612#(<= ~counter~0 5)} is VALID [2022-04-07 13:01:35,374 INFO L290 TraceCheckUtils]: 146: Hoare triple {20612#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,374 INFO L290 TraceCheckUtils]: 147: Hoare triple {20697#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,375 INFO L272 TraceCheckUtils]: 148: Hoare triple {20697#(<= ~counter~0 6)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,375 INFO L290 TraceCheckUtils]: 149: Hoare triple {20697#(<= ~counter~0 6)} ~cond := #in~cond; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,375 INFO L290 TraceCheckUtils]: 150: Hoare triple {20697#(<= ~counter~0 6)} assume !(0 == ~cond); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,375 INFO L290 TraceCheckUtils]: 151: Hoare triple {20697#(<= ~counter~0 6)} assume true; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,376 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {20697#(<= ~counter~0 6)} {20697#(<= ~counter~0 6)} #59#return; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,376 INFO L272 TraceCheckUtils]: 153: Hoare triple {20697#(<= ~counter~0 6)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,376 INFO L290 TraceCheckUtils]: 154: Hoare triple {20697#(<= ~counter~0 6)} ~cond := #in~cond; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,377 INFO L290 TraceCheckUtils]: 155: Hoare triple {20697#(<= ~counter~0 6)} assume !(0 == ~cond); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,377 INFO L290 TraceCheckUtils]: 156: Hoare triple {20697#(<= ~counter~0 6)} assume true; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,377 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20697#(<= ~counter~0 6)} {20697#(<= ~counter~0 6)} #61#return; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,378 INFO L272 TraceCheckUtils]: 158: Hoare triple {20697#(<= ~counter~0 6)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,378 INFO L290 TraceCheckUtils]: 159: Hoare triple {20697#(<= ~counter~0 6)} ~cond := #in~cond; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,378 INFO L290 TraceCheckUtils]: 160: Hoare triple {20697#(<= ~counter~0 6)} assume !(0 == ~cond); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,378 INFO L290 TraceCheckUtils]: 161: Hoare triple {20697#(<= ~counter~0 6)} assume true; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,379 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {20697#(<= ~counter~0 6)} {20697#(<= ~counter~0 6)} #63#return; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,379 INFO L272 TraceCheckUtils]: 163: Hoare triple {20697#(<= ~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)); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,379 INFO L290 TraceCheckUtils]: 164: Hoare triple {20697#(<= ~counter~0 6)} ~cond := #in~cond; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,380 INFO L290 TraceCheckUtils]: 165: Hoare triple {20697#(<= ~counter~0 6)} assume !(0 == ~cond); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,380 INFO L290 TraceCheckUtils]: 166: Hoare triple {20697#(<= ~counter~0 6)} assume true; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,380 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {20697#(<= ~counter~0 6)} {20697#(<= ~counter~0 6)} #65#return; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,381 INFO L272 TraceCheckUtils]: 168: Hoare triple {20697#(<= ~counter~0 6)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,381 INFO L290 TraceCheckUtils]: 169: Hoare triple {20697#(<= ~counter~0 6)} ~cond := #in~cond; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,381 INFO L290 TraceCheckUtils]: 170: Hoare triple {20697#(<= ~counter~0 6)} assume !(0 == ~cond); {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,381 INFO L290 TraceCheckUtils]: 171: Hoare triple {20697#(<= ~counter~0 6)} assume true; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,382 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20697#(<= ~counter~0 6)} {20697#(<= ~counter~0 6)} #67#return; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,382 INFO L290 TraceCheckUtils]: 173: Hoare triple {20697#(<= ~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; {20697#(<= ~counter~0 6)} is VALID [2022-04-07 13:01:35,383 INFO L290 TraceCheckUtils]: 174: Hoare triple {20697#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,383 INFO L290 TraceCheckUtils]: 175: Hoare triple {20782#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,383 INFO L272 TraceCheckUtils]: 176: Hoare triple {20782#(<= ~counter~0 7)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,383 INFO L290 TraceCheckUtils]: 177: Hoare triple {20782#(<= ~counter~0 7)} ~cond := #in~cond; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,384 INFO L290 TraceCheckUtils]: 178: Hoare triple {20782#(<= ~counter~0 7)} assume !(0 == ~cond); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,384 INFO L290 TraceCheckUtils]: 179: Hoare triple {20782#(<= ~counter~0 7)} assume true; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,384 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {20782#(<= ~counter~0 7)} {20782#(<= ~counter~0 7)} #59#return; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,385 INFO L272 TraceCheckUtils]: 181: Hoare triple {20782#(<= ~counter~0 7)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,385 INFO L290 TraceCheckUtils]: 182: Hoare triple {20782#(<= ~counter~0 7)} ~cond := #in~cond; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,385 INFO L290 TraceCheckUtils]: 183: Hoare triple {20782#(<= ~counter~0 7)} assume !(0 == ~cond); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,386 INFO L290 TraceCheckUtils]: 184: Hoare triple {20782#(<= ~counter~0 7)} assume true; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,386 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20782#(<= ~counter~0 7)} {20782#(<= ~counter~0 7)} #61#return; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,386 INFO L272 TraceCheckUtils]: 186: Hoare triple {20782#(<= ~counter~0 7)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,387 INFO L290 TraceCheckUtils]: 187: Hoare triple {20782#(<= ~counter~0 7)} ~cond := #in~cond; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,387 INFO L290 TraceCheckUtils]: 188: Hoare triple {20782#(<= ~counter~0 7)} assume !(0 == ~cond); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,387 INFO L290 TraceCheckUtils]: 189: Hoare triple {20782#(<= ~counter~0 7)} assume true; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,387 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {20782#(<= ~counter~0 7)} {20782#(<= ~counter~0 7)} #63#return; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,388 INFO L272 TraceCheckUtils]: 191: Hoare triple {20782#(<= ~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)); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,388 INFO L290 TraceCheckUtils]: 192: Hoare triple {20782#(<= ~counter~0 7)} ~cond := #in~cond; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,388 INFO L290 TraceCheckUtils]: 193: Hoare triple {20782#(<= ~counter~0 7)} assume !(0 == ~cond); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,389 INFO L290 TraceCheckUtils]: 194: Hoare triple {20782#(<= ~counter~0 7)} assume true; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,389 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {20782#(<= ~counter~0 7)} {20782#(<= ~counter~0 7)} #65#return; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,390 INFO L272 TraceCheckUtils]: 196: Hoare triple {20782#(<= ~counter~0 7)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,390 INFO L290 TraceCheckUtils]: 197: Hoare triple {20782#(<= ~counter~0 7)} ~cond := #in~cond; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,390 INFO L290 TraceCheckUtils]: 198: Hoare triple {20782#(<= ~counter~0 7)} assume !(0 == ~cond); {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,390 INFO L290 TraceCheckUtils]: 199: Hoare triple {20782#(<= ~counter~0 7)} assume true; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,391 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20782#(<= ~counter~0 7)} {20782#(<= ~counter~0 7)} #67#return; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,391 INFO L290 TraceCheckUtils]: 201: Hoare triple {20782#(<= ~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; {20782#(<= ~counter~0 7)} is VALID [2022-04-07 13:01:35,391 INFO L290 TraceCheckUtils]: 202: Hoare triple {20782#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,392 INFO L290 TraceCheckUtils]: 203: Hoare triple {20867#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,392 INFO L272 TraceCheckUtils]: 204: Hoare triple {20867#(<= ~counter~0 8)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,392 INFO L290 TraceCheckUtils]: 205: Hoare triple {20867#(<= ~counter~0 8)} ~cond := #in~cond; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,399 INFO L290 TraceCheckUtils]: 206: Hoare triple {20867#(<= ~counter~0 8)} assume !(0 == ~cond); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,399 INFO L290 TraceCheckUtils]: 207: Hoare triple {20867#(<= ~counter~0 8)} assume true; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,400 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {20867#(<= ~counter~0 8)} {20867#(<= ~counter~0 8)} #59#return; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,400 INFO L272 TraceCheckUtils]: 209: Hoare triple {20867#(<= ~counter~0 8)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,400 INFO L290 TraceCheckUtils]: 210: Hoare triple {20867#(<= ~counter~0 8)} ~cond := #in~cond; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,401 INFO L290 TraceCheckUtils]: 211: Hoare triple {20867#(<= ~counter~0 8)} assume !(0 == ~cond); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,401 INFO L290 TraceCheckUtils]: 212: Hoare triple {20867#(<= ~counter~0 8)} assume true; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,401 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {20867#(<= ~counter~0 8)} {20867#(<= ~counter~0 8)} #61#return; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,402 INFO L272 TraceCheckUtils]: 214: Hoare triple {20867#(<= ~counter~0 8)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,402 INFO L290 TraceCheckUtils]: 215: Hoare triple {20867#(<= ~counter~0 8)} ~cond := #in~cond; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,402 INFO L290 TraceCheckUtils]: 216: Hoare triple {20867#(<= ~counter~0 8)} assume !(0 == ~cond); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,402 INFO L290 TraceCheckUtils]: 217: Hoare triple {20867#(<= ~counter~0 8)} assume true; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,403 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {20867#(<= ~counter~0 8)} {20867#(<= ~counter~0 8)} #63#return; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,403 INFO L272 TraceCheckUtils]: 219: Hoare triple {20867#(<= ~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)); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,403 INFO L290 TraceCheckUtils]: 220: Hoare triple {20867#(<= ~counter~0 8)} ~cond := #in~cond; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,404 INFO L290 TraceCheckUtils]: 221: Hoare triple {20867#(<= ~counter~0 8)} assume !(0 == ~cond); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,404 INFO L290 TraceCheckUtils]: 222: Hoare triple {20867#(<= ~counter~0 8)} assume true; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,404 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {20867#(<= ~counter~0 8)} {20867#(<= ~counter~0 8)} #65#return; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,405 INFO L272 TraceCheckUtils]: 224: Hoare triple {20867#(<= ~counter~0 8)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,405 INFO L290 TraceCheckUtils]: 225: Hoare triple {20867#(<= ~counter~0 8)} ~cond := #in~cond; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,405 INFO L290 TraceCheckUtils]: 226: Hoare triple {20867#(<= ~counter~0 8)} assume !(0 == ~cond); {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,405 INFO L290 TraceCheckUtils]: 227: Hoare triple {20867#(<= ~counter~0 8)} assume true; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,406 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {20867#(<= ~counter~0 8)} {20867#(<= ~counter~0 8)} #67#return; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,406 INFO L290 TraceCheckUtils]: 229: Hoare triple {20867#(<= ~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; {20867#(<= ~counter~0 8)} is VALID [2022-04-07 13:01:35,407 INFO L290 TraceCheckUtils]: 230: Hoare triple {20867#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,407 INFO L290 TraceCheckUtils]: 231: Hoare triple {20952#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,408 INFO L272 TraceCheckUtils]: 232: Hoare triple {20952#(<= ~counter~0 9)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,408 INFO L290 TraceCheckUtils]: 233: Hoare triple {20952#(<= ~counter~0 9)} ~cond := #in~cond; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,408 INFO L290 TraceCheckUtils]: 234: Hoare triple {20952#(<= ~counter~0 9)} assume !(0 == ~cond); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,408 INFO L290 TraceCheckUtils]: 235: Hoare triple {20952#(<= ~counter~0 9)} assume true; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,409 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20952#(<= ~counter~0 9)} {20952#(<= ~counter~0 9)} #59#return; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,409 INFO L272 TraceCheckUtils]: 237: Hoare triple {20952#(<= ~counter~0 9)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,409 INFO L290 TraceCheckUtils]: 238: Hoare triple {20952#(<= ~counter~0 9)} ~cond := #in~cond; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,410 INFO L290 TraceCheckUtils]: 239: Hoare triple {20952#(<= ~counter~0 9)} assume !(0 == ~cond); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,410 INFO L290 TraceCheckUtils]: 240: Hoare triple {20952#(<= ~counter~0 9)} assume true; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,410 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {20952#(<= ~counter~0 9)} {20952#(<= ~counter~0 9)} #61#return; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,411 INFO L272 TraceCheckUtils]: 242: Hoare triple {20952#(<= ~counter~0 9)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,411 INFO L290 TraceCheckUtils]: 243: Hoare triple {20952#(<= ~counter~0 9)} ~cond := #in~cond; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,411 INFO L290 TraceCheckUtils]: 244: Hoare triple {20952#(<= ~counter~0 9)} assume !(0 == ~cond); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,411 INFO L290 TraceCheckUtils]: 245: Hoare triple {20952#(<= ~counter~0 9)} assume true; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,412 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {20952#(<= ~counter~0 9)} {20952#(<= ~counter~0 9)} #63#return; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,412 INFO L272 TraceCheckUtils]: 247: Hoare triple {20952#(<= ~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)); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,412 INFO L290 TraceCheckUtils]: 248: Hoare triple {20952#(<= ~counter~0 9)} ~cond := #in~cond; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,413 INFO L290 TraceCheckUtils]: 249: Hoare triple {20952#(<= ~counter~0 9)} assume !(0 == ~cond); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,413 INFO L290 TraceCheckUtils]: 250: Hoare triple {20952#(<= ~counter~0 9)} assume true; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,413 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {20952#(<= ~counter~0 9)} {20952#(<= ~counter~0 9)} #65#return; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,414 INFO L272 TraceCheckUtils]: 252: Hoare triple {20952#(<= ~counter~0 9)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,414 INFO L290 TraceCheckUtils]: 253: Hoare triple {20952#(<= ~counter~0 9)} ~cond := #in~cond; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,414 INFO L290 TraceCheckUtils]: 254: Hoare triple {20952#(<= ~counter~0 9)} assume !(0 == ~cond); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,415 INFO L290 TraceCheckUtils]: 255: Hoare triple {20952#(<= ~counter~0 9)} assume true; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,415 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {20952#(<= ~counter~0 9)} {20952#(<= ~counter~0 9)} #67#return; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,415 INFO L290 TraceCheckUtils]: 257: Hoare triple {20952#(<= ~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; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:35,416 INFO L290 TraceCheckUtils]: 258: Hoare triple {20952#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,416 INFO L290 TraceCheckUtils]: 259: Hoare triple {21037#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,416 INFO L272 TraceCheckUtils]: 260: Hoare triple {21037#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,417 INFO L290 TraceCheckUtils]: 261: Hoare triple {21037#(<= ~counter~0 10)} ~cond := #in~cond; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,417 INFO L290 TraceCheckUtils]: 262: Hoare triple {21037#(<= ~counter~0 10)} assume !(0 == ~cond); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,417 INFO L290 TraceCheckUtils]: 263: Hoare triple {21037#(<= ~counter~0 10)} assume true; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,417 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {21037#(<= ~counter~0 10)} {21037#(<= ~counter~0 10)} #59#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,418 INFO L272 TraceCheckUtils]: 265: Hoare triple {21037#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,418 INFO L290 TraceCheckUtils]: 266: Hoare triple {21037#(<= ~counter~0 10)} ~cond := #in~cond; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,418 INFO L290 TraceCheckUtils]: 267: Hoare triple {21037#(<= ~counter~0 10)} assume !(0 == ~cond); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,419 INFO L290 TraceCheckUtils]: 268: Hoare triple {21037#(<= ~counter~0 10)} assume true; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,419 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {21037#(<= ~counter~0 10)} {21037#(<= ~counter~0 10)} #61#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,419 INFO L272 TraceCheckUtils]: 270: Hoare triple {21037#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,420 INFO L290 TraceCheckUtils]: 271: Hoare triple {21037#(<= ~counter~0 10)} ~cond := #in~cond; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,420 INFO L290 TraceCheckUtils]: 272: Hoare triple {21037#(<= ~counter~0 10)} assume !(0 == ~cond); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,420 INFO L290 TraceCheckUtils]: 273: Hoare triple {21037#(<= ~counter~0 10)} assume true; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,421 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {21037#(<= ~counter~0 10)} {21037#(<= ~counter~0 10)} #63#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,421 INFO L272 TraceCheckUtils]: 275: Hoare triple {21037#(<= ~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)); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,421 INFO L290 TraceCheckUtils]: 276: Hoare triple {21037#(<= ~counter~0 10)} ~cond := #in~cond; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,421 INFO L290 TraceCheckUtils]: 277: Hoare triple {21037#(<= ~counter~0 10)} assume !(0 == ~cond); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,422 INFO L290 TraceCheckUtils]: 278: Hoare triple {21037#(<= ~counter~0 10)} assume true; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,422 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {21037#(<= ~counter~0 10)} {21037#(<= ~counter~0 10)} #65#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,423 INFO L272 TraceCheckUtils]: 280: Hoare triple {21037#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,423 INFO L290 TraceCheckUtils]: 281: Hoare triple {21037#(<= ~counter~0 10)} ~cond := #in~cond; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,423 INFO L290 TraceCheckUtils]: 282: Hoare triple {21037#(<= ~counter~0 10)} assume !(0 == ~cond); {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,423 INFO L290 TraceCheckUtils]: 283: Hoare triple {21037#(<= ~counter~0 10)} assume true; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,424 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {21037#(<= ~counter~0 10)} {21037#(<= ~counter~0 10)} #67#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,424 INFO L290 TraceCheckUtils]: 285: Hoare triple {21037#(<= ~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; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:35,424 INFO L290 TraceCheckUtils]: 286: Hoare triple {21037#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21122#(<= |main_#t~post5| 10)} is VALID [2022-04-07 13:01:35,425 INFO L290 TraceCheckUtils]: 287: Hoare triple {21122#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {20249#false} is VALID [2022-04-07 13:01:35,425 INFO L272 TraceCheckUtils]: 288: Hoare triple {20249#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20249#false} is VALID [2022-04-07 13:01:35,425 INFO L290 TraceCheckUtils]: 289: Hoare triple {20249#false} ~cond := #in~cond; {20249#false} is VALID [2022-04-07 13:01:35,425 INFO L290 TraceCheckUtils]: 290: Hoare triple {20249#false} assume !(0 == ~cond); {20249#false} is VALID [2022-04-07 13:01:35,425 INFO L290 TraceCheckUtils]: 291: Hoare triple {20249#false} assume true; {20249#false} is VALID [2022-04-07 13:01:35,425 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {20249#false} {20249#false} #69#return; {20249#false} is VALID [2022-04-07 13:01:35,425 INFO L272 TraceCheckUtils]: 293: Hoare triple {20249#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {20249#false} is VALID [2022-04-07 13:01:35,425 INFO L290 TraceCheckUtils]: 294: Hoare triple {20249#false} ~cond := #in~cond; {20249#false} is VALID [2022-04-07 13:01:35,425 INFO L290 TraceCheckUtils]: 295: Hoare triple {20249#false} assume 0 == ~cond; {20249#false} is VALID [2022-04-07 13:01:35,425 INFO L290 TraceCheckUtils]: 296: Hoare triple {20249#false} assume !false; {20249#false} is VALID [2022-04-07 13:01:35,427 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:01:35,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:01:36,386 INFO L290 TraceCheckUtils]: 296: Hoare triple {20249#false} assume !false; {20249#false} is VALID [2022-04-07 13:01:36,386 INFO L290 TraceCheckUtils]: 295: Hoare triple {20249#false} assume 0 == ~cond; {20249#false} is VALID [2022-04-07 13:01:36,386 INFO L290 TraceCheckUtils]: 294: Hoare triple {20249#false} ~cond := #in~cond; {20249#false} is VALID [2022-04-07 13:01:36,386 INFO L272 TraceCheckUtils]: 293: Hoare triple {20249#false} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {20249#false} is VALID [2022-04-07 13:01:36,386 INFO L284 TraceCheckUtils]: 292: Hoare quadruple {20248#true} {20249#false} #69#return; {20249#false} is VALID [2022-04-07 13:01:36,386 INFO L290 TraceCheckUtils]: 291: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,387 INFO L290 TraceCheckUtils]: 290: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,387 INFO L290 TraceCheckUtils]: 289: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,387 INFO L272 TraceCheckUtils]: 288: Hoare triple {20249#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,387 INFO L290 TraceCheckUtils]: 287: Hoare triple {21180#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {20249#false} is VALID [2022-04-07 13:01:36,387 INFO L290 TraceCheckUtils]: 286: Hoare triple {21184#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21180#(< |main_#t~post5| 20)} is VALID [2022-04-07 13:01:36,388 INFO L290 TraceCheckUtils]: 285: Hoare triple {21184#(< ~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; {21184#(< ~counter~0 20)} is VALID [2022-04-07 13:01:36,388 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {20248#true} {21184#(< ~counter~0 20)} #67#return; {21184#(< ~counter~0 20)} is VALID [2022-04-07 13:01:36,388 INFO L290 TraceCheckUtils]: 283: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,388 INFO L290 TraceCheckUtils]: 282: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,388 INFO L290 TraceCheckUtils]: 281: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,388 INFO L272 TraceCheckUtils]: 280: Hoare triple {21184#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,389 INFO L284 TraceCheckUtils]: 279: Hoare quadruple {20248#true} {21184#(< ~counter~0 20)} #65#return; {21184#(< ~counter~0 20)} is VALID [2022-04-07 13:01:36,389 INFO L290 TraceCheckUtils]: 278: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,389 INFO L290 TraceCheckUtils]: 277: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,389 INFO L290 TraceCheckUtils]: 276: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,389 INFO L272 TraceCheckUtils]: 275: Hoare triple {21184#(< ~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)); {20248#true} is VALID [2022-04-07 13:01:36,389 INFO L284 TraceCheckUtils]: 274: Hoare quadruple {20248#true} {21184#(< ~counter~0 20)} #63#return; {21184#(< ~counter~0 20)} is VALID [2022-04-07 13:01:36,389 INFO L290 TraceCheckUtils]: 273: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,389 INFO L290 TraceCheckUtils]: 272: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,389 INFO L290 TraceCheckUtils]: 271: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,390 INFO L272 TraceCheckUtils]: 270: Hoare triple {21184#(< ~counter~0 20)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,390 INFO L284 TraceCheckUtils]: 269: Hoare quadruple {20248#true} {21184#(< ~counter~0 20)} #61#return; {21184#(< ~counter~0 20)} is VALID [2022-04-07 13:01:36,390 INFO L290 TraceCheckUtils]: 268: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,390 INFO L290 TraceCheckUtils]: 267: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,390 INFO L290 TraceCheckUtils]: 266: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,390 INFO L272 TraceCheckUtils]: 265: Hoare triple {21184#(< ~counter~0 20)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,390 INFO L284 TraceCheckUtils]: 264: Hoare quadruple {20248#true} {21184#(< ~counter~0 20)} #59#return; {21184#(< ~counter~0 20)} is VALID [2022-04-07 13:01:36,391 INFO L290 TraceCheckUtils]: 263: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,391 INFO L290 TraceCheckUtils]: 262: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,391 INFO L290 TraceCheckUtils]: 261: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,391 INFO L272 TraceCheckUtils]: 260: Hoare triple {21184#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,391 INFO L290 TraceCheckUtils]: 259: Hoare triple {21184#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {21184#(< ~counter~0 20)} is VALID [2022-04-07 13:01:36,392 INFO L290 TraceCheckUtils]: 258: Hoare triple {21269#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21184#(< ~counter~0 20)} is VALID [2022-04-07 13:01:36,392 INFO L290 TraceCheckUtils]: 257: Hoare triple {21269#(< ~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; {21269#(< ~counter~0 19)} is VALID [2022-04-07 13:01:36,392 INFO L284 TraceCheckUtils]: 256: Hoare quadruple {20248#true} {21269#(< ~counter~0 19)} #67#return; {21269#(< ~counter~0 19)} is VALID [2022-04-07 13:01:36,392 INFO L290 TraceCheckUtils]: 255: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,392 INFO L290 TraceCheckUtils]: 254: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,392 INFO L290 TraceCheckUtils]: 253: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,393 INFO L272 TraceCheckUtils]: 252: Hoare triple {21269#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,393 INFO L284 TraceCheckUtils]: 251: Hoare quadruple {20248#true} {21269#(< ~counter~0 19)} #65#return; {21269#(< ~counter~0 19)} is VALID [2022-04-07 13:01:36,393 INFO L290 TraceCheckUtils]: 250: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,393 INFO L290 TraceCheckUtils]: 249: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,393 INFO L290 TraceCheckUtils]: 248: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,393 INFO L272 TraceCheckUtils]: 247: Hoare triple {21269#(< ~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)); {20248#true} is VALID [2022-04-07 13:01:36,395 INFO L284 TraceCheckUtils]: 246: Hoare quadruple {20248#true} {21269#(< ~counter~0 19)} #63#return; {21269#(< ~counter~0 19)} is VALID [2022-04-07 13:01:36,395 INFO L290 TraceCheckUtils]: 245: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,395 INFO L290 TraceCheckUtils]: 244: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,396 INFO L290 TraceCheckUtils]: 243: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,396 INFO L272 TraceCheckUtils]: 242: Hoare triple {21269#(< ~counter~0 19)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,396 INFO L284 TraceCheckUtils]: 241: Hoare quadruple {20248#true} {21269#(< ~counter~0 19)} #61#return; {21269#(< ~counter~0 19)} is VALID [2022-04-07 13:01:36,396 INFO L290 TraceCheckUtils]: 240: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,396 INFO L290 TraceCheckUtils]: 239: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,396 INFO L290 TraceCheckUtils]: 238: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,396 INFO L272 TraceCheckUtils]: 237: Hoare triple {21269#(< ~counter~0 19)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,404 INFO L284 TraceCheckUtils]: 236: Hoare quadruple {20248#true} {21269#(< ~counter~0 19)} #59#return; {21269#(< ~counter~0 19)} is VALID [2022-04-07 13:01:36,405 INFO L290 TraceCheckUtils]: 235: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,405 INFO L290 TraceCheckUtils]: 234: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,405 INFO L290 TraceCheckUtils]: 233: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,405 INFO L272 TraceCheckUtils]: 232: Hoare triple {21269#(< ~counter~0 19)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,405 INFO L290 TraceCheckUtils]: 231: Hoare triple {21269#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {21269#(< ~counter~0 19)} is VALID [2022-04-07 13:01:36,406 INFO L290 TraceCheckUtils]: 230: Hoare triple {21354#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21269#(< ~counter~0 19)} is VALID [2022-04-07 13:01:36,406 INFO L290 TraceCheckUtils]: 229: Hoare triple {21354#(< ~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; {21354#(< ~counter~0 18)} is VALID [2022-04-07 13:01:36,406 INFO L284 TraceCheckUtils]: 228: Hoare quadruple {20248#true} {21354#(< ~counter~0 18)} #67#return; {21354#(< ~counter~0 18)} is VALID [2022-04-07 13:01:36,406 INFO L290 TraceCheckUtils]: 227: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,407 INFO L290 TraceCheckUtils]: 226: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,407 INFO L290 TraceCheckUtils]: 225: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,407 INFO L272 TraceCheckUtils]: 224: Hoare triple {21354#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,407 INFO L284 TraceCheckUtils]: 223: Hoare quadruple {20248#true} {21354#(< ~counter~0 18)} #65#return; {21354#(< ~counter~0 18)} is VALID [2022-04-07 13:01:36,407 INFO L290 TraceCheckUtils]: 222: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,407 INFO L290 TraceCheckUtils]: 221: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,407 INFO L290 TraceCheckUtils]: 220: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,407 INFO L272 TraceCheckUtils]: 219: Hoare triple {21354#(< ~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)); {20248#true} is VALID [2022-04-07 13:01:36,408 INFO L284 TraceCheckUtils]: 218: Hoare quadruple {20248#true} {21354#(< ~counter~0 18)} #63#return; {21354#(< ~counter~0 18)} is VALID [2022-04-07 13:01:36,408 INFO L290 TraceCheckUtils]: 217: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,408 INFO L290 TraceCheckUtils]: 216: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,408 INFO L290 TraceCheckUtils]: 215: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,408 INFO L272 TraceCheckUtils]: 214: Hoare triple {21354#(< ~counter~0 18)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,408 INFO L284 TraceCheckUtils]: 213: Hoare quadruple {20248#true} {21354#(< ~counter~0 18)} #61#return; {21354#(< ~counter~0 18)} is VALID [2022-04-07 13:01:36,409 INFO L290 TraceCheckUtils]: 212: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,409 INFO L290 TraceCheckUtils]: 211: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,409 INFO L290 TraceCheckUtils]: 210: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,409 INFO L272 TraceCheckUtils]: 209: Hoare triple {21354#(< ~counter~0 18)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,409 INFO L284 TraceCheckUtils]: 208: Hoare quadruple {20248#true} {21354#(< ~counter~0 18)} #59#return; {21354#(< ~counter~0 18)} is VALID [2022-04-07 13:01:36,409 INFO L290 TraceCheckUtils]: 207: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,409 INFO L290 TraceCheckUtils]: 206: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,409 INFO L290 TraceCheckUtils]: 205: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,409 INFO L272 TraceCheckUtils]: 204: Hoare triple {21354#(< ~counter~0 18)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,410 INFO L290 TraceCheckUtils]: 203: Hoare triple {21354#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {21354#(< ~counter~0 18)} is VALID [2022-04-07 13:01:36,410 INFO L290 TraceCheckUtils]: 202: Hoare triple {21439#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21354#(< ~counter~0 18)} is VALID [2022-04-07 13:01:36,410 INFO L290 TraceCheckUtils]: 201: Hoare triple {21439#(< ~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; {21439#(< ~counter~0 17)} is VALID [2022-04-07 13:01:36,411 INFO L284 TraceCheckUtils]: 200: Hoare quadruple {20248#true} {21439#(< ~counter~0 17)} #67#return; {21439#(< ~counter~0 17)} is VALID [2022-04-07 13:01:36,411 INFO L290 TraceCheckUtils]: 199: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,411 INFO L290 TraceCheckUtils]: 198: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,411 INFO L290 TraceCheckUtils]: 197: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,411 INFO L272 TraceCheckUtils]: 196: Hoare triple {21439#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,412 INFO L284 TraceCheckUtils]: 195: Hoare quadruple {20248#true} {21439#(< ~counter~0 17)} #65#return; {21439#(< ~counter~0 17)} is VALID [2022-04-07 13:01:36,412 INFO L290 TraceCheckUtils]: 194: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,412 INFO L290 TraceCheckUtils]: 193: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,412 INFO L290 TraceCheckUtils]: 192: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,412 INFO L272 TraceCheckUtils]: 191: Hoare triple {21439#(< ~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)); {20248#true} is VALID [2022-04-07 13:01:36,412 INFO L284 TraceCheckUtils]: 190: Hoare quadruple {20248#true} {21439#(< ~counter~0 17)} #63#return; {21439#(< ~counter~0 17)} is VALID [2022-04-07 13:01:36,412 INFO L290 TraceCheckUtils]: 189: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,412 INFO L290 TraceCheckUtils]: 188: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,412 INFO L290 TraceCheckUtils]: 187: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,413 INFO L272 TraceCheckUtils]: 186: Hoare triple {21439#(< ~counter~0 17)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,413 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {20248#true} {21439#(< ~counter~0 17)} #61#return; {21439#(< ~counter~0 17)} is VALID [2022-04-07 13:01:36,413 INFO L290 TraceCheckUtils]: 184: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,413 INFO L290 TraceCheckUtils]: 183: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,413 INFO L290 TraceCheckUtils]: 182: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,413 INFO L272 TraceCheckUtils]: 181: Hoare triple {21439#(< ~counter~0 17)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,414 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {20248#true} {21439#(< ~counter~0 17)} #59#return; {21439#(< ~counter~0 17)} is VALID [2022-04-07 13:01:36,414 INFO L290 TraceCheckUtils]: 179: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,414 INFO L290 TraceCheckUtils]: 178: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,414 INFO L290 TraceCheckUtils]: 177: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,414 INFO L272 TraceCheckUtils]: 176: Hoare triple {21439#(< ~counter~0 17)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,414 INFO L290 TraceCheckUtils]: 175: Hoare triple {21439#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {21439#(< ~counter~0 17)} is VALID [2022-04-07 13:01:36,415 INFO L290 TraceCheckUtils]: 174: Hoare triple {21524#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21439#(< ~counter~0 17)} is VALID [2022-04-07 13:01:36,415 INFO L290 TraceCheckUtils]: 173: Hoare triple {21524#(< ~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; {21524#(< ~counter~0 16)} is VALID [2022-04-07 13:01:36,415 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {20248#true} {21524#(< ~counter~0 16)} #67#return; {21524#(< ~counter~0 16)} is VALID [2022-04-07 13:01:36,415 INFO L290 TraceCheckUtils]: 171: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,415 INFO L290 TraceCheckUtils]: 170: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,416 INFO L290 TraceCheckUtils]: 169: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,416 INFO L272 TraceCheckUtils]: 168: Hoare triple {21524#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,416 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {20248#true} {21524#(< ~counter~0 16)} #65#return; {21524#(< ~counter~0 16)} is VALID [2022-04-07 13:01:36,416 INFO L290 TraceCheckUtils]: 166: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,416 INFO L290 TraceCheckUtils]: 165: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,416 INFO L290 TraceCheckUtils]: 164: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,416 INFO L272 TraceCheckUtils]: 163: Hoare triple {21524#(< ~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)); {20248#true} is VALID [2022-04-07 13:01:36,417 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {20248#true} {21524#(< ~counter~0 16)} #63#return; {21524#(< ~counter~0 16)} is VALID [2022-04-07 13:01:36,417 INFO L290 TraceCheckUtils]: 161: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,417 INFO L290 TraceCheckUtils]: 160: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,417 INFO L290 TraceCheckUtils]: 159: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,417 INFO L272 TraceCheckUtils]: 158: Hoare triple {21524#(< ~counter~0 16)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,417 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {20248#true} {21524#(< ~counter~0 16)} #61#return; {21524#(< ~counter~0 16)} is VALID [2022-04-07 13:01:36,417 INFO L290 TraceCheckUtils]: 156: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,417 INFO L290 TraceCheckUtils]: 155: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,417 INFO L290 TraceCheckUtils]: 154: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,418 INFO L272 TraceCheckUtils]: 153: Hoare triple {21524#(< ~counter~0 16)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,418 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {20248#true} {21524#(< ~counter~0 16)} #59#return; {21524#(< ~counter~0 16)} is VALID [2022-04-07 13:01:36,418 INFO L290 TraceCheckUtils]: 151: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,418 INFO L290 TraceCheckUtils]: 150: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,418 INFO L290 TraceCheckUtils]: 149: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,418 INFO L272 TraceCheckUtils]: 148: Hoare triple {21524#(< ~counter~0 16)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,418 INFO L290 TraceCheckUtils]: 147: Hoare triple {21524#(< ~counter~0 16)} assume !!(#t~post5 < 20);havoc #t~post5; {21524#(< ~counter~0 16)} is VALID [2022-04-07 13:01:36,419 INFO L290 TraceCheckUtils]: 146: Hoare triple {21609#(< ~counter~0 15)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21524#(< ~counter~0 16)} is VALID [2022-04-07 13:01:36,419 INFO L290 TraceCheckUtils]: 145: Hoare triple {21609#(< ~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; {21609#(< ~counter~0 15)} is VALID [2022-04-07 13:01:36,420 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {20248#true} {21609#(< ~counter~0 15)} #67#return; {21609#(< ~counter~0 15)} is VALID [2022-04-07 13:01:36,420 INFO L290 TraceCheckUtils]: 143: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,420 INFO L290 TraceCheckUtils]: 142: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,420 INFO L290 TraceCheckUtils]: 141: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,420 INFO L272 TraceCheckUtils]: 140: Hoare triple {21609#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,420 INFO L284 TraceCheckUtils]: 139: Hoare quadruple {20248#true} {21609#(< ~counter~0 15)} #65#return; {21609#(< ~counter~0 15)} is VALID [2022-04-07 13:01:36,420 INFO L290 TraceCheckUtils]: 138: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,420 INFO L290 TraceCheckUtils]: 137: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,421 INFO L290 TraceCheckUtils]: 136: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,421 INFO L272 TraceCheckUtils]: 135: Hoare triple {21609#(< ~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)); {20248#true} is VALID [2022-04-07 13:01:36,421 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {20248#true} {21609#(< ~counter~0 15)} #63#return; {21609#(< ~counter~0 15)} is VALID [2022-04-07 13:01:36,421 INFO L290 TraceCheckUtils]: 133: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,421 INFO L290 TraceCheckUtils]: 132: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,421 INFO L290 TraceCheckUtils]: 131: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,421 INFO L272 TraceCheckUtils]: 130: Hoare triple {21609#(< ~counter~0 15)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,422 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {20248#true} {21609#(< ~counter~0 15)} #61#return; {21609#(< ~counter~0 15)} is VALID [2022-04-07 13:01:36,422 INFO L290 TraceCheckUtils]: 128: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,422 INFO L290 TraceCheckUtils]: 127: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,422 INFO L290 TraceCheckUtils]: 126: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,422 INFO L272 TraceCheckUtils]: 125: Hoare triple {21609#(< ~counter~0 15)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,422 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {20248#true} {21609#(< ~counter~0 15)} #59#return; {21609#(< ~counter~0 15)} is VALID [2022-04-07 13:01:36,422 INFO L290 TraceCheckUtils]: 123: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,422 INFO L290 TraceCheckUtils]: 122: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,422 INFO L290 TraceCheckUtils]: 121: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,422 INFO L272 TraceCheckUtils]: 120: Hoare triple {21609#(< ~counter~0 15)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,423 INFO L290 TraceCheckUtils]: 119: Hoare triple {21609#(< ~counter~0 15)} assume !!(#t~post5 < 20);havoc #t~post5; {21609#(< ~counter~0 15)} is VALID [2022-04-07 13:01:36,423 INFO L290 TraceCheckUtils]: 118: Hoare triple {21694#(< ~counter~0 14)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21609#(< ~counter~0 15)} is VALID [2022-04-07 13:01:36,423 INFO L290 TraceCheckUtils]: 117: Hoare triple {21694#(< ~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; {21694#(< ~counter~0 14)} is VALID [2022-04-07 13:01:36,424 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {20248#true} {21694#(< ~counter~0 14)} #67#return; {21694#(< ~counter~0 14)} is VALID [2022-04-07 13:01:36,424 INFO L290 TraceCheckUtils]: 115: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,424 INFO L290 TraceCheckUtils]: 114: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,424 INFO L290 TraceCheckUtils]: 113: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,424 INFO L272 TraceCheckUtils]: 112: Hoare triple {21694#(< ~counter~0 14)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,424 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {20248#true} {21694#(< ~counter~0 14)} #65#return; {21694#(< ~counter~0 14)} is VALID [2022-04-07 13:01:36,424 INFO L290 TraceCheckUtils]: 110: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,425 INFO L290 TraceCheckUtils]: 109: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,425 INFO L290 TraceCheckUtils]: 108: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,425 INFO L272 TraceCheckUtils]: 107: Hoare triple {21694#(< ~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)); {20248#true} is VALID [2022-04-07 13:01:36,425 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {20248#true} {21694#(< ~counter~0 14)} #63#return; {21694#(< ~counter~0 14)} is VALID [2022-04-07 13:01:36,425 INFO L290 TraceCheckUtils]: 105: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,425 INFO L290 TraceCheckUtils]: 104: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,425 INFO L290 TraceCheckUtils]: 103: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,425 INFO L272 TraceCheckUtils]: 102: Hoare triple {21694#(< ~counter~0 14)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,426 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {20248#true} {21694#(< ~counter~0 14)} #61#return; {21694#(< ~counter~0 14)} is VALID [2022-04-07 13:01:36,426 INFO L290 TraceCheckUtils]: 100: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,426 INFO L290 TraceCheckUtils]: 99: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,426 INFO L290 TraceCheckUtils]: 98: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,426 INFO L272 TraceCheckUtils]: 97: Hoare triple {21694#(< ~counter~0 14)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,426 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20248#true} {21694#(< ~counter~0 14)} #59#return; {21694#(< ~counter~0 14)} is VALID [2022-04-07 13:01:36,426 INFO L290 TraceCheckUtils]: 95: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,426 INFO L290 TraceCheckUtils]: 94: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,426 INFO L290 TraceCheckUtils]: 93: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,427 INFO L272 TraceCheckUtils]: 92: Hoare triple {21694#(< ~counter~0 14)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,427 INFO L290 TraceCheckUtils]: 91: Hoare triple {21694#(< ~counter~0 14)} assume !!(#t~post5 < 20);havoc #t~post5; {21694#(< ~counter~0 14)} is VALID [2022-04-07 13:01:36,427 INFO L290 TraceCheckUtils]: 90: Hoare triple {21779#(< ~counter~0 13)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21694#(< ~counter~0 14)} is VALID [2022-04-07 13:01:36,427 INFO L290 TraceCheckUtils]: 89: Hoare triple {21779#(< ~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; {21779#(< ~counter~0 13)} is VALID [2022-04-07 13:01:36,428 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {20248#true} {21779#(< ~counter~0 13)} #67#return; {21779#(< ~counter~0 13)} is VALID [2022-04-07 13:01:36,428 INFO L290 TraceCheckUtils]: 87: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,428 INFO L290 TraceCheckUtils]: 86: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,428 INFO L290 TraceCheckUtils]: 85: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,428 INFO L272 TraceCheckUtils]: 84: Hoare triple {21779#(< ~counter~0 13)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,429 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {20248#true} {21779#(< ~counter~0 13)} #65#return; {21779#(< ~counter~0 13)} is VALID [2022-04-07 13:01:36,429 INFO L290 TraceCheckUtils]: 82: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,429 INFO L290 TraceCheckUtils]: 81: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,429 INFO L290 TraceCheckUtils]: 80: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,429 INFO L272 TraceCheckUtils]: 79: Hoare triple {21779#(< ~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)); {20248#true} is VALID [2022-04-07 13:01:36,429 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20248#true} {21779#(< ~counter~0 13)} #63#return; {21779#(< ~counter~0 13)} is VALID [2022-04-07 13:01:36,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,429 INFO L290 TraceCheckUtils]: 76: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,429 INFO L290 TraceCheckUtils]: 75: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,429 INFO L272 TraceCheckUtils]: 74: Hoare triple {21779#(< ~counter~0 13)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,430 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20248#true} {21779#(< ~counter~0 13)} #61#return; {21779#(< ~counter~0 13)} is VALID [2022-04-07 13:01:36,430 INFO L290 TraceCheckUtils]: 72: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,430 INFO L290 TraceCheckUtils]: 71: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,430 INFO L272 TraceCheckUtils]: 69: Hoare triple {21779#(< ~counter~0 13)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,430 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20248#true} {21779#(< ~counter~0 13)} #59#return; {21779#(< ~counter~0 13)} is VALID [2022-04-07 13:01:36,430 INFO L290 TraceCheckUtils]: 67: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,431 INFO L272 TraceCheckUtils]: 64: Hoare triple {21779#(< ~counter~0 13)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,431 INFO L290 TraceCheckUtils]: 63: Hoare triple {21779#(< ~counter~0 13)} assume !!(#t~post5 < 20);havoc #t~post5; {21779#(< ~counter~0 13)} is VALID [2022-04-07 13:01:36,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {21864#(< ~counter~0 12)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21779#(< ~counter~0 13)} is VALID [2022-04-07 13:01:36,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {21864#(< ~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; {21864#(< ~counter~0 12)} is VALID [2022-04-07 13:01:36,432 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {20248#true} {21864#(< ~counter~0 12)} #67#return; {21864#(< ~counter~0 12)} is VALID [2022-04-07 13:01:36,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,432 INFO L290 TraceCheckUtils]: 58: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,432 INFO L272 TraceCheckUtils]: 56: Hoare triple {21864#(< ~counter~0 12)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,433 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {20248#true} {21864#(< ~counter~0 12)} #65#return; {21864#(< ~counter~0 12)} is VALID [2022-04-07 13:01:36,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,433 INFO L272 TraceCheckUtils]: 51: Hoare triple {21864#(< ~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)); {20248#true} is VALID [2022-04-07 13:01:36,433 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20248#true} {21864#(< ~counter~0 12)} #63#return; {21864#(< ~counter~0 12)} is VALID [2022-04-07 13:01:36,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,434 INFO L272 TraceCheckUtils]: 46: Hoare triple {21864#(< ~counter~0 12)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,434 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20248#true} {21864#(< ~counter~0 12)} #61#return; {21864#(< ~counter~0 12)} is VALID [2022-04-07 13:01:36,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,434 INFO L290 TraceCheckUtils]: 43: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,434 INFO L272 TraceCheckUtils]: 41: Hoare triple {21864#(< ~counter~0 12)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,439 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20248#true} {21864#(< ~counter~0 12)} #59#return; {21864#(< ~counter~0 12)} is VALID [2022-04-07 13:01:36,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,439 INFO L272 TraceCheckUtils]: 36: Hoare triple {21864#(< ~counter~0 12)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {21864#(< ~counter~0 12)} assume !!(#t~post5 < 20);havoc #t~post5; {21864#(< ~counter~0 12)} is VALID [2022-04-07 13:01:36,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {21037#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21864#(< ~counter~0 12)} is VALID [2022-04-07 13:01:36,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {21037#(<= ~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; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:36,441 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20248#true} {21037#(<= ~counter~0 10)} #67#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:36,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,441 INFO L272 TraceCheckUtils]: 28: Hoare triple {21037#(<= ~counter~0 10)} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,442 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20248#true} {21037#(<= ~counter~0 10)} #65#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:36,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,442 INFO L272 TraceCheckUtils]: 23: Hoare triple {21037#(<= ~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)); {20248#true} is VALID [2022-04-07 13:01:36,443 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20248#true} {21037#(<= ~counter~0 10)} #63#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:36,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,443 INFO L272 TraceCheckUtils]: 18: Hoare triple {21037#(<= ~counter~0 10)} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,444 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20248#true} {21037#(<= ~counter~0 10)} #61#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:36,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,444 INFO L272 TraceCheckUtils]: 13: Hoare triple {21037#(<= ~counter~0 10)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,445 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20248#true} {21037#(<= ~counter~0 10)} #59#return; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:36,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {20248#true} assume true; {20248#true} is VALID [2022-04-07 13:01:36,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {20248#true} assume !(0 == ~cond); {20248#true} is VALID [2022-04-07 13:01:36,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {20248#true} ~cond := #in~cond; {20248#true} is VALID [2022-04-07 13:01:36,445 INFO L272 TraceCheckUtils]: 8: Hoare triple {21037#(<= ~counter~0 10)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {20248#true} is VALID [2022-04-07 13:01:36,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {21037#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:36,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {20952#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21037#(<= ~counter~0 10)} is VALID [2022-04-07 13:01:36,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {20952#(<= ~counter~0 9)} 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; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:36,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {20952#(<= ~counter~0 9)} call #t~ret6 := main(); {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:36,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20952#(<= ~counter~0 9)} {20248#true} #81#return; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:36,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {20952#(<= ~counter~0 9)} assume true; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:36,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {20248#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; {20952#(<= ~counter~0 9)} is VALID [2022-04-07 13:01:36,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {20248#true} call ULTIMATE.init(); {20248#true} is VALID [2022-04-07 13:01:36,449 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:01:36,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:01:36,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257043951] [2022-04-07 13:01:36,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:01:36,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423637299] [2022-04-07 13:01:36,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423637299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:01:36,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:01:36,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-07 13:01:36,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321577573] [2022-04-07 13:01:36,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:01:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) Word has length 297 [2022-04-07 13:01:36,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:01:36,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-07 13:01:36,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:36,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-07 13:01:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:01:36,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-07 13:01:36,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-07 13:01:36,690 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-07 13:01:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:40,682 INFO L93 Difference]: Finished difference Result 584 states and 594 transitions. [2022-04-07 13:01:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-07 13:01:40,682 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) Word has length 297 [2022-04-07 13:01:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:01:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-07 13:01:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 352 transitions. [2022-04-07 13:01:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-07 13:01:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 352 transitions. [2022-04-07 13:01:40,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 352 transitions. [2022-04-07 13:01:40,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:01:41,012 INFO L225 Difference]: With dead ends: 584 [2022-04-07 13:01:41,013 INFO L226 Difference]: Without dead ends: 574 [2022-04-07 13:01:41,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-04-07 13:01:41,014 INFO L913 BasicCegarLoop]: 121 mSDtfsCounter, 220 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 13:01:41,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 518 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 13:01:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-04-07 13:01:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2022-04-07 13:01:41,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:01:41,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 574 states. Second operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-07 13:01:41,289 INFO L74 IsIncluded]: Start isIncluded. First operand 574 states. Second operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-07 13:01:41,290 INFO L87 Difference]: Start difference. First operand 574 states. Second operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-07 13:01:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:41,299 INFO L93 Difference]: Finished difference Result 574 states and 575 transitions. [2022-04-07 13:01:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2022-04-07 13:01:41,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:41,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:41,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand 574 states. [2022-04-07 13:01:41,301 INFO L87 Difference]: Start difference. First operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand 574 states. [2022-04-07 13:01:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:01:41,311 INFO L93 Difference]: Finished difference Result 574 states and 575 transitions. [2022-04-07 13:01:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2022-04-07 13:01:41,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:01:41,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:01:41,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:01:41,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:01:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 368 states have (on average 1.002717391304348) internal successors, (369), 368 states have internal predecessors, (369), 104 states have call successors, (104), 103 states have call predecessors, (104), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-07 13:01:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 575 transitions. [2022-04-07 13:01:41,325 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 575 transitions. Word has length 297 [2022-04-07 13:01:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:01:41,326 INFO L478 AbstractCegarLoop]: Abstraction has 574 states and 575 transitions. [2022-04-07 13:01:41,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 22 states have call successors, (106), 13 states have call predecessors, (106), 13 states have return successors, (104), 21 states have call predecessors, (104), 21 states have call successors, (104) [2022-04-07 13:01:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 575 transitions. [2022-04-07 13:01:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2022-04-07 13:01:41,333 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:01:41,333 INFO L499 BasicCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:01:41,352 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:01:41,537 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:01:41,538 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:01:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:01:41,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1184532997, now seen corresponding path program 4 times [2022-04-07 13:01:41,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:01:41,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614893077] [2022-04-07 13:01:41,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:01:41,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:01:41,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:01:41,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387875797] [2022-04-07 13:01:41,564 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-07 13:01:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:01:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:01:41,565 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:01:41,566 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:01:41,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-07 13:01:41,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-07 13:01:41,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 13:01:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 13:01:42,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 13:01:42,310 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 13:01:42,311 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 13:01:42,330 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:01:42,519 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:01:42,522 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2022-04-07 13:01:42,524 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 13:01:42,641 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 13:01:42,642 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 13:01:42,643 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 13:01:42,644 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 13:01:42,644 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 13:01:42,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 01:01:42 BoogieIcfgContainer [2022-04-07 13:01:42,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 13:01:42,645 INFO L158 Benchmark]: Toolchain (without parser) took 302768.06ms. Allocated memory was 187.7MB in the beginning and 305.1MB in the end (delta: 117.4MB). Free memory was 134.4MB in the beginning and 106.3MB in the end (delta: 28.1MB). Peak memory consumption was 146.4MB. Max. memory is 8.0GB. [2022-04-07 13:01:42,645 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 150.6MB in the beginning and 150.6MB in the end (delta: 74.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 13:01:42,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.37ms. Allocated memory was 187.7MB in the beginning and 253.8MB in the end (delta: 66.1MB). Free memory was 134.2MB in the beginning and 228.3MB in the end (delta: -94.1MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-04-07 13:01:42,646 INFO L158 Benchmark]: Boogie Preprocessor took 25.32ms. Allocated memory is still 253.8MB. Free memory was 228.3MB in the beginning and 226.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 13:01:42,646 INFO L158 Benchmark]: RCFGBuilder took 199.88ms. Allocated memory is still 253.8MB. Free memory was 226.3MB in the beginning and 214.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 13:01:42,647 INFO L158 Benchmark]: TraceAbstraction took 302339.78ms. Allocated memory was 253.8MB in the beginning and 305.1MB in the end (delta: 51.4MB). Free memory was 213.8MB in the beginning and 106.3MB in the end (delta: 107.4MB). Peak memory consumption was 159.2MB. Max. memory is 8.0GB. [2022-04-07 13:01:42,649 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 150.6MB in the beginning and 150.6MB in the end (delta: 74.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.37ms. Allocated memory was 187.7MB in the beginning and 253.8MB in the end (delta: 66.1MB). Free memory was 134.2MB in the beginning and 228.3MB in the end (delta: -94.1MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.32ms. Allocated memory is still 253.8MB. Free memory was 228.3MB in the beginning and 226.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 199.88ms. Allocated memory is still 253.8MB. Free memory was 226.3MB in the beginning and 214.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 302339.78ms. Allocated memory was 253.8MB in the beginning and 305.1MB in the end (delta: 51.4MB). Free memory was 213.8MB in the beginning and 106.3MB in the end (delta: 107.4MB). Peak memory consumption was 159.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=26, counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [\old(counter)=0, a=20, counter=0, n=0, x=0, y=1, z=6] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=1, counter++=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=1, n=1, x=1, y=7, z=12] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=2, counter++=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=2, n=2, x=8, y=19, z=18] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=3, counter++=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=3, n=3, x=27, y=37, z=24] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=4, counter++=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=4, n=4, x=64, y=61, z=30] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=5, counter++=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=5, n=5, x=125, y=91, z=36] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=6, counter++=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=6, n=6, x=216, y=127, z=42] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=7, counter++=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=7, n=7, x=343, y=169, z=48] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=8, counter++=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=8, n=8, x=512, y=217, z=54] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=9, counter++=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=9, n=9, x=729, y=271, z=60] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=10, counter++=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=10, n=10, x=1000, y=331, z=66] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=11, counter++=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=11, n=11, x=1331, y=397, z=72] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=12, counter++=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=12, n=12, x=1728, y=469, z=78] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=13, counter++=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=13, n=13, x=2197, y=547, z=84] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=14, counter++=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=14, n=14, x=2744, y=631, z=90] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=15, counter++=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=15, n=15, x=3375, y=721, z=96] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=16, counter++=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=16, n=16, x=4096, y=817, z=102] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=17, counter++=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=17, n=17, x=4913, y=919, z=108] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=18, counter++=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=19, counter++=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=20, counter++=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(counter)=0, a=20, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [\old(counter)=0, a=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] EXPR counter++ VAL [\old(counter)=0, a=20, counter=21, counter++=20, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, \old(counter)=0, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [\old(counter)=0, a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 302.2s, OverallIterations: 21, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 76.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 682 SdHoareTripleChecker+Valid, 40.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 625 mSDsluCounter, 3345 SdHoareTripleChecker+Invalid, 40.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2362 mSDsCounter, 767 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3307 IncrementalHoareTripleChecker+Invalid, 4085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 767 mSolverCounterUnsat, 983 mSDtfsCounter, 3307 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2916 GetRequests, 2669 SyntacticMatches, 21 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=20, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 201.5s InterpolantComputationTime, 2202 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 2680 ConstructedInterpolants, 0 QuantifiedInterpolants, 11256 SizeOfPredicates, 66 NumberOfNonLiveVariables, 3444 ConjunctsInSsa, 378 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 17136/23738 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-07 13:01:42,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...