/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 11:15:27,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 11:15:27,938 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 11:15:27,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 11:15:27,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 11:15:27,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 11:15:27,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 11:15:27,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 11:15:27,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 11:15:27,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 11:15:27,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 11:15:27,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 11:15:27,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 11:15:27,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 11:15:27,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 11:15:28,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 11:15:28,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 11:15:28,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 11:15:28,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 11:15:28,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 11:15:28,008 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 11:15:28,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 11:15:28,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 11:15:28,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 11:15:28,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 11:15:28,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 11:15:28,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 11:15:28,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 11:15:28,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 11:15:28,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 11:15:28,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 11:15:28,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 11:15:28,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 11:15:28,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 11:15:28,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 11:15:28,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 11:15:28,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 11:15:28,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 11:15:28,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 11:15:28,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 11:15:28,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 11:15:28,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 11:15:28,025 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 11:15:28,031 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 11:15:28,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 11:15:28,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 11:15:28,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 11:15:28,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 11:15:28,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 11:15:28,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 11:15:28,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 11:15:28,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 11:15:28,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 11:15:28,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 11:15:28,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 11:15:28,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 11:15:28,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 11:15:28,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 11:15:28,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:15:28,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 11:15:28,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 11:15:28,034 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 11:15:28,034 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 11:15:28,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 11:15:28,035 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 11:15:28,035 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 11:15:28,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 11:15:28,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 11:15:28,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 11:15:28,218 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 11:15:28,218 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 11:15:28,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound100.c [2022-04-28 11:15:28,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f3d4d50/e0de9fe705ec4bd0bf2d8dca57ab879e/FLAGccc03a26e [2022-04-28 11:15:28,590 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 11:15:28,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound100.c [2022-04-28 11:15:28,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f3d4d50/e0de9fe705ec4bd0bf2d8dca57ab879e/FLAGccc03a26e [2022-04-28 11:15:29,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f3d4d50/e0de9fe705ec4bd0bf2d8dca57ab879e [2022-04-28 11:15:29,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 11:15:29,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 11:15:29,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 11:15:29,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 11:15:29,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 11:15:29,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316a187f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29, skipping insertion in model container [2022-04-28 11:15:29,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 11:15:29,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 11:15:29,155 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_valuebound100.c[588,601] [2022-04-28 11:15:29,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:15:29,173 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 11:15:29,180 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_valuebound100.c[588,601] [2022-04-28 11:15:29,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 11:15:29,196 INFO L208 MainTranslator]: Completed translation [2022-04-28 11:15:29,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29 WrapperNode [2022-04-28 11:15:29,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 11:15:29,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 11:15:29,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 11:15:29,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 11:15:29,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 11:15:29,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 11:15:29,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 11:15:29,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 11:15:29,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29" (1/1) ... [2022-04-28 11:15:29,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 11:15:29,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:29,236 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-28 11:15:29,254 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-28 11:15:29,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 11:15:29,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 11:15:29,262 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 11:15:29,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 11:15:29,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 11:15:29,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 11:15:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 11:15:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 11:15:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 11:15:29,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 11:15:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-28 11:15:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 11:15:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 11:15:29,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 11:15:29,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 11:15:29,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 11:15:29,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 11:15:29,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 11:15:29,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 11:15:29,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 11:15:29,312 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 11:15:29,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 11:15:29,420 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 11:15:29,425 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 11:15:29,425 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 11:15:29,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:15:29 BoogieIcfgContainer [2022-04-28 11:15:29,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 11:15:29,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 11:15:29,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 11:15:29,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 11:15:29,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 11:15:29" (1/3) ... [2022-04-28 11:15:29,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a43f446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:15:29, skipping insertion in model container [2022-04-28 11:15:29,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 11:15:29" (2/3) ... [2022-04-28 11:15:29,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a43f446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 11:15:29, skipping insertion in model container [2022-04-28 11:15:29,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 11:15:29" (3/3) ... [2022-04-28 11:15:29,431 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound100.c [2022-04-28 11:15:29,439 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 11:15:29,439 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 11:15:29,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 11:15:29,482 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69b1f3d0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12f23a6f [2022-04-28 11:15:29,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 11:15:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:15:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:15:29,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:29,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:29,498 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-28 11:15:29,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:29,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1927152974] [2022-04-28 11:15:29,513 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-28 11:15:29,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:29,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234642293] [2022-04-28 11:15:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:15:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:29,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#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); {39#true} is VALID [2022-04-28 11:15:29,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:15:29,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:15:29,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:15:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:29,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:15:29,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:15:29,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:15:29,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:15:29,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:15:29,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#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); {39#true} is VALID [2022-04-28 11:15:29,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-28 11:15:29,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-28 11:15:29,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-28 11:15:29,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#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; {39#true} is VALID [2022-04-28 11:15:29,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {39#true} is VALID [2022-04-28 11:15:29,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-28 11:15:29,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-28 11:15:29,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-28 11:15:29,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-28 11:15:29,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-28 11:15:29,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-28 11:15:29,636 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-28 11:15:29,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-28 11:15:29,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-28 11:15:29,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-28 11:15:29,637 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-28 11:15:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:29,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234642293] [2022-04-28 11:15:29,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234642293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:29,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:29,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:15:29,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:29,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1927152974] [2022-04-28 11:15:29,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1927152974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:29,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:29,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 11:15:29,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090951332] [2022-04-28 11:15:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:29,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:15:29,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:29,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:29,662 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-28 11:15:29,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 11:15:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:29,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 11:15:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 11:15:29,684 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:29,894 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-28 11:15:29,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 11:15:29,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:15:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:15:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-28 11:15:29,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-28 11:15:30,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:30,040 INFO L225 Difference]: With dead ends: 63 [2022-04-28 11:15:30,040 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 11:15:30,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-28 11:15:30,047 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:30,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:30,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 11:15:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 11:15:30,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:30,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:15:30,071 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:15:30,072 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:15:30,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:30,075 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:15:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:15:30,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:30,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:30,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:15:30,077 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-28 11:15:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:30,080 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-28 11:15:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:15:30,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:30,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:30,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:30,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:15:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-28 11:15:30,085 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-28 11:15:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:30,098 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-28 11:15:30,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:30,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-28 11:15:30,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-28 11:15:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 11:15:30,141 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:30,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:30,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 11:15:30,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:30,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:30,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-28 11:15:30,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:30,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [262297403] [2022-04-28 11:15:30,154 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-28 11:15:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:30,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540452157] [2022-04-28 11:15:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:30,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 11:15:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:30,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |#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); {301#true} is VALID [2022-04-28 11:15:30,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:15:30,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:15:30,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 11:15:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:30,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:15:30,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:15:30,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:15:30,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:15:30,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 11:15:30,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(and (= |#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); {301#true} is VALID [2022-04-28 11:15:30,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:15:30,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-28 11:15:30,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-28 11:15:30,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#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; {301#true} is VALID [2022-04-28 11:15:30,283 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {301#true} is VALID [2022-04-28 11:15:30,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-28 11:15:30,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-28 11:15:30,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-28 11:15:30,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-28 11:15:30,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:15:30,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-28 11:15:30,285 INFO L272 TraceCheckUtils]: 13: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:30,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {312#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:30,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-28 11:15:30,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-28 11:15:30,286 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-28 11:15:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:30,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540452157] [2022-04-28 11:15:30,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540452157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:30,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:30,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:30,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:30,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [262297403] [2022-04-28 11:15:30,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [262297403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:30,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:30,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:30,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418542918] [2022-04-28 11:15:30,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:30,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:15:30,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:30,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:30,299 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-28 11:15:30,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:15:30,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:30,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:15:30,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:15:30,300 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:30,638 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-28 11:15:30,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:15:30,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 11:15:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:15:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 11:15:30,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 11:15:30,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:30,687 INFO L225 Difference]: With dead ends: 37 [2022-04-28 11:15:30,687 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 11:15:30,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-28 11:15:30,688 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:30,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 11:15:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 11:15:30,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:30,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:15:30,695 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:15:30,695 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:15:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:30,697 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:15:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:15:30,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:30,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:30,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:15:30,699 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 11:15:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:30,701 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 11:15:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:15:30,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:30,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:30,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:30,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 11:15:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-28 11:15:30,704 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-28 11:15:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:30,704 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-28 11:15:30,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 11:15:30,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-28 11:15:30,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-28 11:15:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 11:15:30,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:30,745 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:30,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 11:15:30,745 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:30,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:30,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-28 11:15:30,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:30,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730173056] [2022-04-28 11:15:30,746 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:30,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-28 11:15:30,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:30,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325747012] [2022-04-28 11:15:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:30,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:30,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117329972] [2022-04-28 11:15:30,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:30,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:30,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:30,772 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-28 11:15:30,773 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-28 11:15:30,805 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:30,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:30,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:15:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:30,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:30,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-28 11:15:30,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#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); {538#true} is VALID [2022-04-28 11:15:30,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:15:30,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-28 11:15:30,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-28 11:15:30,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#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; {538#true} is VALID [2022-04-28 11:15:30,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {538#true} is VALID [2022-04-28 11:15:30,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:15:30,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:15:30,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:15:30,917 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-28 11:15:30,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:30,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:30,918 INFO L272 TraceCheckUtils]: 13: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {538#true} is VALID [2022-04-28 11:15:30,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-28 11:15:30,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-28 11:15:30,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-28 11:15:30,919 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {538#true} {576#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:30,919 INFO L272 TraceCheckUtils]: 18: Hoare triple {576#(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)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:30,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:30,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-28 11:15:30,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-28 11:15:30,920 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-28 11:15:30,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:15:30,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:30,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325747012] [2022-04-28 11:15:30,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:30,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117329972] [2022-04-28 11:15:30,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117329972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:30,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:30,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:30,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:30,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1730173056] [2022-04-28 11:15:30,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1730173056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:30,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:30,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:30,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475142512] [2022-04-28 11:15:30,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:30,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:30,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:30,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:30,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:30,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:15:30,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:30,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:15:30,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:15:30,938 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:31,135 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 11:15:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:15:31,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:31,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:31,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:15:31,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:31,197 INFO L225 Difference]: With dead ends: 54 [2022-04-28 11:15:31,197 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 11:15:31,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:15:31,198 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:31,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:15:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 11:15:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-28 11:15:31,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:31,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:15:31,209 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:15:31,209 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:15:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:31,212 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:15:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:15:31,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:31,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:31,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:15:31,214 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-28 11:15:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:31,218 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-28 11:15:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-28 11:15:31,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:31,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:31,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:31,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 11:15:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-28 11:15:31,221 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-28 11:15:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:31,221 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-28 11:15:31,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-28 11:15:31,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-28 11:15:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 11:15:31,269 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:31,269 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:31,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 11:15:31,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:31,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-28 11:15:31,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:31,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [505121307] [2022-04-28 11:15:31,487 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-28 11:15:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:31,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474368337] [2022-04-28 11:15:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:31,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:31,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517696013] [2022-04-28 11:15:31,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:31,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:31,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:31,506 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-28 11:15:31,509 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-28 11:15:31,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:31,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:31,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 11:15:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:31,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:31,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-28 11:15:31,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#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); {906#true} is VALID [2022-04-28 11:15:31,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:15:31,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-28 11:15:31,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-28 11:15:31,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#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; {906#true} is VALID [2022-04-28 11:15:31,626 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {906#true} is VALID [2022-04-28 11:15:31,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:15:31,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:15:31,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:15:31,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-28 11:15:31,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:15:31,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:15:31,628 INFO L272 TraceCheckUtils]: 13: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {906#true} is VALID [2022-04-28 11:15:31,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:15:31,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:15:31,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:15:31,629 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:15:31,629 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#(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)); {906#true} is VALID [2022-04-28 11:15:31,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-28 11:15:31,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-28 11:15:31,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-28 11:15:31,630 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-28 11:15:31,630 INFO L272 TraceCheckUtils]: 23: Hoare triple {944#(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)); {981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:31,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:31,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-28 11:15:31,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-28 11:15:31,631 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-28 11:15:31,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:15:31,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:31,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474368337] [2022-04-28 11:15:31,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:31,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517696013] [2022-04-28 11:15:31,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517696013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:31,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:31,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:31,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:31,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [505121307] [2022-04-28 11:15:31,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [505121307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:31,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:31,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347445794] [2022-04-28 11:15:31,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:31,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:31,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:31,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:15:31,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:31,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:15:31,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:15:31,649 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:31,927 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 11:15:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:15:31,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:31,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:15:31,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:31,986 INFO L225 Difference]: With dead ends: 58 [2022-04-28 11:15:31,986 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 11:15:31,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 11:15:31,987 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:31,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 11:15:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 11:15:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-28 11:15:32,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:32,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:32,013 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:32,013 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:32,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:32,015 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:15:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:15:32,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:32,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:32,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:15:32,016 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-28 11:15:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:32,019 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-28 11:15:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 11:15:32,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:32,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:32,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:32,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-28 11:15:32,021 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-28 11:15:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:32,021 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-28 11:15:32,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-28 11:15:32,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-28 11:15:32,093 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-28 11:15:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-28 11:15:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 11:15:32,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:32,094 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:32,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 11:15:32,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 11:15:32,301 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:32,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-28 11:15:32,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:32,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [630210407] [2022-04-28 11:15:32,301 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 11:15:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-28 11:15:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:32,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521444953] [2022-04-28 11:15:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:32,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:32,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866061648] [2022-04-28 11:15:32,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:32,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:32,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:32,352 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-28 11:15:32,383 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-28 11:15:32,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:32,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:32,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 11:15:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:32,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:32,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-28 11:15:32,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#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); {1325#true} is VALID [2022-04-28 11:15:32,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:32,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-28 11:15:32,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-28 11:15:32,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {1325#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; {1325#true} is VALID [2022-04-28 11:15:32,554 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1325#true} is VALID [2022-04-28 11:15:32,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:15:32,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:15:32,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:32,554 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-28 11:15:32,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {1325#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:32,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:32,555 INFO L272 TraceCheckUtils]: 13: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-28 11:15:32,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:15:32,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:15:32,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:32,556 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:32,556 INFO L272 TraceCheckUtils]: 18: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-28 11:15:32,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:15:32,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:15:32,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:32,557 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:32,557 INFO L272 TraceCheckUtils]: 23: Hoare triple {1363#(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)); {1325#true} is VALID [2022-04-28 11:15:32,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-28 11:15:32,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-28 11:15:32,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-28 11:15:32,558 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:32,559 INFO L272 TraceCheckUtils]: 28: Hoare triple {1363#(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)); {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:32,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:32,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-28 11:15:32,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-28 11:15:32,560 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-28 11:15:32,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 11:15:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:32,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521444953] [2022-04-28 11:15:32,560 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:32,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866061648] [2022-04-28 11:15:32,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866061648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:32,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:32,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:32,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:32,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [630210407] [2022-04-28 11:15:32,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [630210407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:32,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:32,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 11:15:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548308378] [2022-04-28 11:15:32,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:32,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:15:32,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:32,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:15:32,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:32,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 11:15:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:32,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 11:15:32,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 11:15:32,578 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:15:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:32,790 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-28 11:15:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 11:15:32,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-28 11:15:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:15:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:15:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-28 11:15:32,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-28 11:15:32,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:32,849 INFO L225 Difference]: With dead ends: 66 [2022-04-28 11:15:32,850 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 11:15:32,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-28 11:15:32,850 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:32,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:32,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 11:15:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 11:15:32,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:32,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:15:32,885 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:15:32,886 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:15:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:32,891 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:15:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:15:32,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:32,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:32,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:15:32,893 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-28 11:15:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:32,896 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 11:15:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:15:32,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:32,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:32,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:32,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 11:15:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 11:15:32,899 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-28 11:15:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:32,899 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 11:15:32,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 11:15:32,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 11:15:32,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 11:15:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 11:15:32,971 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:32,972 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:32,994 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-28 11:15:33,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:33,185 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:33,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-28 11:15:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:33,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1443687602] [2022-04-28 11:15:33,439 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:33,439 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 2 times [2022-04-28 11:15:33,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:33,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442481158] [2022-04-28 11:15:33,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:33,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:33,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674429314] [2022-04-28 11:15:33,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:33,449 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-28 11:15:33,450 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-28 11:15:33,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:33,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:33,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 11:15:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:33,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:33,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:15:33,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-28 11:15:33,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:15:33,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:15:33,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#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; {1775#true} is VALID [2022-04-28 11:15:33,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:15:33,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:15:33,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:33,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:33,663 INFO L272 TraceCheckUtils]: 13: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:15:33,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,664 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:33,664 INFO L272 TraceCheckUtils]: 18: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:15:33,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,665 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:33,665 INFO L272 TraceCheckUtils]: 23: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:15:33,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,665 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:33,665 INFO L272 TraceCheckUtils]: 28: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:15:33,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,666 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:33,666 INFO L272 TraceCheckUtils]: 33: Hoare triple {1813#(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)); {1775#true} is VALID [2022-04-28 11:15:33,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,667 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:33,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {1813#(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; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:15:33,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} assume !false; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:15:33,668 INFO L272 TraceCheckUtils]: 40: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:15:33,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,668 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,668 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,668 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} #62#return; {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} is VALID [2022-04-28 11:15:33,669 INFO L272 TraceCheckUtils]: 45: Hoare triple {1895#(and (= 7 main_~y~0) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:33,669 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:33,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:15:33,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:15:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:15:33,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:33,860 INFO L290 TraceCheckUtils]: 48: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 11:15:33,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {1921#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 11:15:33,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1921#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:33,862 INFO L272 TraceCheckUtils]: 45: Hoare triple {1937#(= (+ (* 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)); {1917#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:33,862 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1775#true} {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:33,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,865 INFO L272 TraceCheckUtils]: 40: Hoare triple {1937#(= (+ (* 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)); {1775#true} is VALID [2022-04-28 11:15:33,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:33,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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; {1937#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:33,870 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:33,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,871 INFO L272 TraceCheckUtils]: 33: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {1775#true} is VALID [2022-04-28 11:15:33,871 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:33,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,875 INFO L272 TraceCheckUtils]: 28: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {1775#true} is VALID [2022-04-28 11:15:33,875 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:33,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,876 INFO L272 TraceCheckUtils]: 23: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:15:33,877 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:33,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,878 INFO L272 TraceCheckUtils]: 18: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {1775#true} is VALID [2022-04-28 11:15:33,878 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1775#true} {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:33,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,878 INFO L272 TraceCheckUtils]: 13: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:15:33,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:33,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1959#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:33,879 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-28 11:15:33,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-28 11:15:33,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-28 11:15:33,880 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1775#true} is VALID [2022-04-28 11:15:33,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#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; {1775#true} is VALID [2022-04-28 11:15:33,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-28 11:15:33,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-28 11:15:33,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 11:15:33,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-28 11:15:33,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 11:15:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 11:15:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:33,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442481158] [2022-04-28 11:15:33,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:33,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674429314] [2022-04-28 11:15:33,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674429314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:33,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:33,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:15:33,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:33,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1443687602] [2022-04-28 11:15:33,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1443687602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:33,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:33,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:33,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121866151] [2022-04-28 11:15:33,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:15:33,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:33,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:15:33,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:33,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:15:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:33,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:15:33,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:15:33,904 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:15:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:34,203 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-28 11:15:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:15:34,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2022-04-28 11:15:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:15:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:15:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:34,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:15:34,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:34,272 INFO L225 Difference]: With dead ends: 81 [2022-04-28 11:15:34,272 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 11:15:34,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 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-28 11:15:34,273 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:34,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 180 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 11:15:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-04-28 11:15:34,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:34,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:34,300 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:34,301 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:34,303 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:15:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:15:34,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:34,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:34,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:15:34,304 INFO L87 Difference]: Start difference. First operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 79 states. [2022-04-28 11:15:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:34,307 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-28 11:15:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-28 11:15:34,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:34,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:34,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:34,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.054054054054054) internal successors, (39), 39 states have internal predecessors, (39), 21 states have call successors, (21), 11 states have call predecessors, (21), 10 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 11:15:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-04-28 11:15:34,310 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 49 [2022-04-28 11:15:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:34,310 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-04-28 11:15:34,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 11:15:34,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 79 transitions. [2022-04-28 11:15:34,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-28 11:15:34,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 11:15:34,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:34,386 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:34,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:34,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:34,587 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:34,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:34,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 3 times [2022-04-28 11:15:34,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:34,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908937608] [2022-04-28 11:15:34,831 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:34,832 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:34,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1130038122, now seen corresponding path program 4 times [2022-04-28 11:15:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:34,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613165926] [2022-04-28 11:15:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:34,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:34,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354799003] [2022-04-28 11:15:34,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:34,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:34,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:34,844 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-28 11:15:34,874 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-28 11:15:34,896 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:34,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:34,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 11:15:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:34,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:35,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#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); {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#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; {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:15:35,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:35,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} assume !false; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:35,087 INFO L272 TraceCheckUtils]: 13: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:15:35,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,088 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #62#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:35,088 INFO L272 TraceCheckUtils]: 18: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:15:35,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,098 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #64#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:35,098 INFO L272 TraceCheckUtils]: 23: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:15:35,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,098 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #66#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:35,098 INFO L272 TraceCheckUtils]: 28: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:15:35,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,099 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #68#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:35,099 INFO L272 TraceCheckUtils]: 33: Hoare triple {2574#(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)); {2536#true} is VALID [2022-04-28 11:15:35,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,100 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} #70#return; {2574#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:35,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {2574#(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; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:15:35,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} assume !false; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:15:35,101 INFO L272 TraceCheckUtils]: 40: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:15:35,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,101 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #62#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:15:35,101 INFO L272 TraceCheckUtils]: 45: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {2536#true} is VALID [2022-04-28 11:15:35,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,102 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2656#(and (= main_~x~0 1) (= main_~n~0 1))} #64#return; {2656#(and (= main_~x~0 1) (= main_~n~0 1))} is VALID [2022-04-28 11:15:35,103 INFO L272 TraceCheckUtils]: 50: Hoare triple {2656#(and (= main_~x~0 1) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:35,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:35,103 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:15:35,103 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:15:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:15:35,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:35,260 INFO L290 TraceCheckUtils]: 53: Hoare triple {2537#false} assume !false; {2537#false} is VALID [2022-04-28 11:15:35,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {2697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2537#false} is VALID [2022-04-28 11:15:35,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:35,262 INFO L272 TraceCheckUtils]: 50: Hoare triple {2713#(= (* 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)); {2693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:35,262 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:35,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,262 INFO L290 TraceCheckUtils]: 47: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,262 INFO L272 TraceCheckUtils]: 45: Hoare triple {2713#(= (* 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)); {2536#true} is VALID [2022-04-28 11:15:35,263 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {2536#true} {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:35,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,263 INFO L272 TraceCheckUtils]: 40: Hoare triple {2713#(= (* 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)); {2536#true} is VALID [2022-04-28 11:15:35,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:35,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {2750#(= (* (+ 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; {2713#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:35,266 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:35,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,266 INFO L272 TraceCheckUtils]: 33: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:15:35,266 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:35,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,267 INFO L272 TraceCheckUtils]: 28: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:15:35,268 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:35,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,268 INFO L272 TraceCheckUtils]: 23: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:15:35,269 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:35,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,269 INFO L272 TraceCheckUtils]: 18: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:15:35,269 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2536#true} {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:35,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,270 INFO L272 TraceCheckUtils]: 13: Hoare triple {2750#(= (* (+ 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)); {2536#true} is VALID [2022-04-28 11:15:35,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:35,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {2750#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:35,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2536#true} {2536#true} #60#return; {2536#true} is VALID [2022-04-28 11:15:35,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#true} assume !(0 == ~cond); {2536#true} is VALID [2022-04-28 11:15:35,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {2536#true} ~cond := #in~cond; {2536#true} is VALID [2022-04-28 11:15:35,271 INFO L272 TraceCheckUtils]: 6: Hoare triple {2536#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2536#true} is VALID [2022-04-28 11:15:35,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {2536#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; {2536#true} is VALID [2022-04-28 11:15:35,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {2536#true} call #t~ret5 := main(); {2536#true} is VALID [2022-04-28 11:15:35,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2536#true} {2536#true} #84#return; {2536#true} is VALID [2022-04-28 11:15:35,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {2536#true} assume true; {2536#true} is VALID [2022-04-28 11:15:35,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {2536#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); {2536#true} is VALID [2022-04-28 11:15:35,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {2536#true} call ULTIMATE.init(); {2536#true} is VALID [2022-04-28 11:15:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 11:15:35,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:35,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613165926] [2022-04-28 11:15:35,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:35,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354799003] [2022-04-28 11:15:35,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354799003] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:35,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:35,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:15:35,272 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:35,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908937608] [2022-04-28 11:15:35,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908937608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:35,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:35,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:35,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676731745] [2022-04-28 11:15:35,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:35,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:15:35,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:35,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:15:35,307 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-28 11:15:35,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:15:35,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:35,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:15:35,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:15:35,308 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:15:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:35,644 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-28 11:15:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:15:35,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2022-04-28 11:15:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:35,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:15:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:15:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:35,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:15:35,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:35,709 INFO L225 Difference]: With dead ends: 85 [2022-04-28 11:15:35,709 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 11:15:35,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 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-28 11:15:35,709 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:35,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 196 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:35,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 11:15:35,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-28 11:15:35,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:35,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:15:35,738 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:15:35,738 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:15:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:35,740 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:15:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:15:35,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:35,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:35,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:15:35,741 INFO L87 Difference]: Start difference. First operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 11:15:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:35,744 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-04-28 11:15:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-04-28 11:15:35,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:35,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:35,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:35,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 11:15:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-04-28 11:15:35,746 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 54 [2022-04-28 11:15:35,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:35,747 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-04-28 11:15:35,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 11:15:35,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 84 transitions. [2022-04-28 11:15:35,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-04-28 11:15:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 11:15:35,825 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:35,825 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:35,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 11:15:36,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:36,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:36,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 5 times [2022-04-28 11:15:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:36,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [30749860] [2022-04-28 11:15:36,291 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:36,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:36,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1546120389, now seen corresponding path program 6 times [2022-04-28 11:15:36,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:36,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77888987] [2022-04-28 11:15:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:36,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:36,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309241867] [2022-04-28 11:15:36,300 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:15:36,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:36,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:36,320 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-28 11:15:36,335 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-28 11:15:36,365 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 11:15:36,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:36,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:15:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:36,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:36,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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); {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#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; {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,580 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:15:36,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:36,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:36,581 INFO L272 TraceCheckUtils]: 13: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:15:36,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,582 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:36,582 INFO L272 TraceCheckUtils]: 18: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:15:36,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,582 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,582 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,583 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:36,583 INFO L272 TraceCheckUtils]: 23: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:15:36,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,583 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:36,583 INFO L272 TraceCheckUtils]: 28: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:15:36,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,584 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:36,584 INFO L272 TraceCheckUtils]: 33: Hoare triple {3391#(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)); {3353#true} is VALID [2022-04-28 11:15:36,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,585 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {3391#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:36,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {3391#(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; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:36,588 INFO L290 TraceCheckUtils]: 39: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} assume !false; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:36,588 INFO L272 TraceCheckUtils]: 40: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:15:36,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,588 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,590 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #62#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:36,590 INFO L272 TraceCheckUtils]: 45: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~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)); {3353#true} is VALID [2022-04-28 11:15:36,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,592 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #64#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:36,592 INFO L272 TraceCheckUtils]: 50: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:15:36,592 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,592 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,593 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} #66#return; {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6)))} is VALID [2022-04-28 11:15:36,593 INFO L272 TraceCheckUtils]: 55: Hoare triple {3473#(and (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~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)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:36,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:36,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:15:36,594 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:15:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:15:36,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:36,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#false} assume !false; {3354#false} is VALID [2022-04-28 11:15:36,977 INFO L290 TraceCheckUtils]: 57: Hoare triple {3529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3354#false} is VALID [2022-04-28 11:15:36,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:36,979 INFO L272 TraceCheckUtils]: 55: Hoare triple {3545#(= (+ (* 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)); {3525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:36,979 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:36,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,979 INFO L290 TraceCheckUtils]: 51: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,980 INFO L272 TraceCheckUtils]: 50: Hoare triple {3545#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:15:36,980 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:36,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,983 INFO L272 TraceCheckUtils]: 45: Hoare triple {3545#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:15:36,984 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3353#true} {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:36,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,984 INFO L272 TraceCheckUtils]: 40: Hoare triple {3545#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:15:36,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:36,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {3597#(= (+ (* 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; {3545#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:36,987 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #70#return; {3597#(= (+ (* 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-28 11:15:36,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,988 INFO L290 TraceCheckUtils]: 35: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,988 INFO L272 TraceCheckUtils]: 33: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:15:36,988 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #68#return; {3597#(= (+ (* 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-28 11:15:36,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,988 INFO L272 TraceCheckUtils]: 28: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:15:36,989 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #66#return; {3597#(= (+ (* 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-28 11:15:36,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,989 INFO L272 TraceCheckUtils]: 23: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:15:36,990 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #64#return; {3597#(= (+ (* 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-28 11:15:36,990 INFO L290 TraceCheckUtils]: 21: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,991 INFO L272 TraceCheckUtils]: 18: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:15:36,991 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3353#true} {3597#(= (+ (* 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)))} #62#return; {3597#(= (+ (* 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-28 11:15:36,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,991 INFO L272 TraceCheckUtils]: 13: Hoare triple {3597#(= (+ (* 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)); {3353#true} is VALID [2022-04-28 11:15:36,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {3597#(= (+ (* 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 !false; {3597#(= (+ (* 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-28 11:15:36,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {3353#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {3597#(= (+ (* 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-28 11:15:36,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3353#true} {3353#true} #60#return; {3353#true} is VALID [2022-04-28 11:15:36,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {3353#true} assume !(0 == ~cond); {3353#true} is VALID [2022-04-28 11:15:36,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {3353#true} ~cond := #in~cond; {3353#true} is VALID [2022-04-28 11:15:36,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {3353#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3353#true} is VALID [2022-04-28 11:15:36,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {3353#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; {3353#true} is VALID [2022-04-28 11:15:36,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {3353#true} call #t~ret5 := main(); {3353#true} is VALID [2022-04-28 11:15:36,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3353#true} {3353#true} #84#return; {3353#true} is VALID [2022-04-28 11:15:36,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {3353#true} assume true; {3353#true} is VALID [2022-04-28 11:15:36,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {3353#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); {3353#true} is VALID [2022-04-28 11:15:36,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {3353#true} call ULTIMATE.init(); {3353#true} is VALID [2022-04-28 11:15:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 11:15:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77888987] [2022-04-28 11:15:36,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309241867] [2022-04-28 11:15:36,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309241867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:36,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:36,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-28 11:15:36,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:37,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [30749860] [2022-04-28 11:15:37,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [30749860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:37,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:37,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 11:15:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030565220] [2022-04-28 11:15:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:37,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:15:37,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:37,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:15:37,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:37,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 11:15:37,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:37,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 11:15:37,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 11:15:37,048 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:15:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:37,502 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2022-04-28 11:15:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 11:15:37,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2022-04-28 11:15:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:15:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:15:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-04-28 11:15:37,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2022-04-28 11:15:37,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:37,571 INFO L225 Difference]: With dead ends: 89 [2022-04-28 11:15:37,572 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 11:15:37,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:15:37,572 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:37,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 167 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 11:15:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-04-28 11:15:37,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:37,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:37,603 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:37,603 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:37,605 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:15:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:15:37,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:37,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:37,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:15:37,606 INFO L87 Difference]: Start difference. First operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 84 states. [2022-04-28 11:15:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:37,608 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2022-04-28 11:15:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:15:37,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:37,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:37,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:37,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 46 states have internal predecessors, (47), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2022-04-28 11:15:37,611 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 59 [2022-04-28 11:15:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:37,611 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2022-04-28 11:15:37,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-04-28 11:15:37,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 98 transitions. [2022-04-28 11:15:37,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2022-04-28 11:15:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 11:15:37,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:37,710 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 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, 1, 1, 1, 1] [2022-04-28 11:15:37,743 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-28 11:15:37,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:37,910 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 1 times [2022-04-28 11:15:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:37,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [58353702] [2022-04-28 11:15:38,206 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:38,206 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash -310331719, now seen corresponding path program 2 times [2022-04-28 11:15:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:38,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306786328] [2022-04-28 11:15:38,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:38,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:38,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:38,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541317683] [2022-04-28 11:15:38,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:38,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:38,216 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-28 11:15:38,217 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-28 11:15:38,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:38,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:38,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 11:15:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:38,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:38,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {4230#true} call ULTIMATE.init(); {4230#true} is VALID [2022-04-28 11:15:38,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {4230#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); {4230#true} is VALID [2022-04-28 11:15:38,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4230#true} {4230#true} #84#return; {4230#true} is VALID [2022-04-28 11:15:38,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {4230#true} call #t~ret5 := main(); {4230#true} is VALID [2022-04-28 11:15:38,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {4230#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; {4230#true} is VALID [2022-04-28 11:15:38,759 INFO L272 TraceCheckUtils]: 6: Hoare triple {4230#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:15:38,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4230#true} {4230#true} #60#return; {4230#true} is VALID [2022-04-28 11:15:38,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {4230#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:38,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:38,760 INFO L272 TraceCheckUtils]: 13: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:15:38,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,761 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:38,761 INFO L272 TraceCheckUtils]: 18: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:15:38,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,762 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:38,762 INFO L272 TraceCheckUtils]: 23: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:15:38,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,763 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:38,763 INFO L272 TraceCheckUtils]: 28: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:15:38,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,764 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:38,764 INFO L272 TraceCheckUtils]: 33: Hoare triple {4268#(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)); {4230#true} is VALID [2022-04-28 11:15:38,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,764 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4230#true} {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {4268#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:38,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {4268#(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; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:38,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:38,765 INFO L272 TraceCheckUtils]: 40: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:15:38,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,766 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:38,766 INFO L272 TraceCheckUtils]: 45: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {4230#true} is VALID [2022-04-28 11:15:38,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,767 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:38,767 INFO L272 TraceCheckUtils]: 50: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {4230#true} is VALID [2022-04-28 11:15:38,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,768 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:38,768 INFO L272 TraceCheckUtils]: 55: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~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)); {4230#true} is VALID [2022-04-28 11:15:38,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,768 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:38,769 INFO L272 TraceCheckUtils]: 60: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~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)); {4230#true} is VALID [2022-04-28 11:15:38,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,769 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4230#true} {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:38,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {4350#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:38,770 INFO L272 TraceCheckUtils]: 66: Hoare triple {4432#(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)); {4230#true} is VALID [2022-04-28 11:15:38,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {4230#true} ~cond := #in~cond; {4230#true} is VALID [2022-04-28 11:15:38,770 INFO L290 TraceCheckUtils]: 68: Hoare triple {4230#true} assume !(0 == ~cond); {4230#true} is VALID [2022-04-28 11:15:38,770 INFO L290 TraceCheckUtils]: 69: Hoare triple {4230#true} assume true; {4230#true} is VALID [2022-04-28 11:15:38,771 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4230#true} {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {4432#(and (= main_~z~0 12) (= main_~x~0 1) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:38,771 INFO L272 TraceCheckUtils]: 71: Hoare triple {4432#(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)); {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:38,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {4451#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4455#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:38,772 INFO L290 TraceCheckUtils]: 73: Hoare triple {4455#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4231#false} is VALID [2022-04-28 11:15:38,772 INFO L290 TraceCheckUtils]: 74: Hoare triple {4231#false} assume !false; {4231#false} is VALID [2022-04-28 11:15:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:15:38,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:39,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306786328] [2022-04-28 11:15:39,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:39,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541317683] [2022-04-28 11:15:39,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541317683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:15:39,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:15:39,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 11:15:39,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:39,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [58353702] [2022-04-28 11:15:39,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [58353702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:39,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:39,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:15:39,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441548377] [2022-04-28 11:15:39,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:39,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 75 [2022-04-28 11:15:39,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:39,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-28 11:15:39,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:39,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:15:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:39,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:15:39,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:15:39,114 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-28 11:15:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:39,590 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-04-28 11:15:39,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:15:39,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 75 [2022-04-28 11:15:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-28 11:15:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:15:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-28 11:15:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:15:39,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:15:39,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:39,653 INFO L225 Difference]: With dead ends: 94 [2022-04-28 11:15:39,653 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 11:15:39,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:15:39,654 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:39,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 186 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 11:15:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 11:15:39,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:39,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:39,698 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:39,699 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:39,701 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:15:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:15:39,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:39,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:39,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:15:39,701 INFO L87 Difference]: Start difference. First operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 92 states. [2022-04-28 11:15:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:39,703 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-28 11:15:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:15:39,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:39,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:39,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:39,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-04-28 11:15:39,706 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 75 [2022-04-28 11:15:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:39,706 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-04-28 11:15:39,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-28 11:15:39,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 104 transitions. [2022-04-28 11:15:39,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-04-28 11:15:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 11:15:39,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:39,813 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:39,830 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-28 11:15:40,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:40,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:40,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:40,014 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 7 times [2022-04-28 11:15:40,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:40,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384955386] [2022-04-28 11:15:40,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:40,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash -63758730, now seen corresponding path program 8 times [2022-04-28 11:15:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:40,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490545615] [2022-04-28 11:15:40,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:40,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:40,269 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:40,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1143061622] [2022-04-28 11:15:40,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:40,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:40,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:40,271 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-28 11:15:40,278 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-28 11:15:40,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:40,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:40,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:15:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:40,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:40,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:15:40,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#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); {5138#true} is VALID [2022-04-28 11:15:40,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:15:40,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:15:40,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#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; {5138#true} is VALID [2022-04-28 11:15:40,641 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,641 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:15:40,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:40,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:40,642 INFO L272 TraceCheckUtils]: 13: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:15:40,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,645 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:40,646 INFO L272 TraceCheckUtils]: 18: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:15:40,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,646 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:40,646 INFO L272 TraceCheckUtils]: 23: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:15:40,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,647 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:40,647 INFO L272 TraceCheckUtils]: 28: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:15:40,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,647 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:40,648 INFO L272 TraceCheckUtils]: 33: Hoare triple {5176#(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)); {5138#true} is VALID [2022-04-28 11:15:40,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,648 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {5176#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:40,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {5176#(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; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:40,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !false; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:40,649 INFO L272 TraceCheckUtils]: 40: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,650 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #62#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:40,650 INFO L272 TraceCheckUtils]: 45: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,650 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #64#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:40,650 INFO L272 TraceCheckUtils]: 50: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,650 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,651 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #66#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:40,651 INFO L272 TraceCheckUtils]: 55: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= 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)); {5138#true} is VALID [2022-04-28 11:15:40,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,652 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #68#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:40,652 INFO L272 TraceCheckUtils]: 60: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,652 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5138#true} {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #70#return; {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:15:40,653 INFO L290 TraceCheckUtils]: 65: Hoare triple {5258#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= main_~n~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; {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:40,653 INFO L290 TraceCheckUtils]: 66: Hoare triple {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} assume !false; {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:40,653 INFO L272 TraceCheckUtils]: 67: Hoare triple {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,654 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,654 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,654 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} #62#return; {5340#(and (= (+ (- 1) main_~n~0) 1) (= 19 main_~y~0))} is VALID [2022-04-28 11:15:40,655 INFO L272 TraceCheckUtils]: 72: Hoare triple {5340#(and (= (+ (- 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)); {5362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:40,655 INFO L290 TraceCheckUtils]: 73: Hoare triple {5362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:40,656 INFO L290 TraceCheckUtils]: 74: Hoare triple {5366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:15:40,656 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:15:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:15:40,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:40,976 INFO L290 TraceCheckUtils]: 75: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 11:15:40,977 INFO L290 TraceCheckUtils]: 74: Hoare triple {5366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5139#false} is VALID [2022-04-28 11:15:40,977 INFO L290 TraceCheckUtils]: 73: Hoare triple {5362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:40,978 INFO L272 TraceCheckUtils]: 72: Hoare triple {5382#(= (+ (* 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)); {5362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:40,978 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5138#true} {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:40,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,979 INFO L272 TraceCheckUtils]: 67: Hoare triple {5382#(= (+ (* 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)); {5138#true} is VALID [2022-04-28 11:15:40,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:40,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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; {5382#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:15:40,988 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #70#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:40,989 INFO L290 TraceCheckUtils]: 63: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,989 INFO L272 TraceCheckUtils]: 60: Hoare triple {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {5138#true} is VALID [2022-04-28 11:15:40,989 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #68#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:40,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,989 INFO L290 TraceCheckUtils]: 57: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,989 INFO L290 TraceCheckUtils]: 56: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,989 INFO L272 TraceCheckUtils]: 55: Hoare triple {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {5138#true} is VALID [2022-04-28 11:15:40,990 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #66#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:40,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,990 INFO L290 TraceCheckUtils]: 52: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,990 INFO L290 TraceCheckUtils]: 51: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,990 INFO L272 TraceCheckUtils]: 50: Hoare triple {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,991 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #64#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:40,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,991 INFO L290 TraceCheckUtils]: 47: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,991 INFO L290 TraceCheckUtils]: 46: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,991 INFO L272 TraceCheckUtils]: 45: Hoare triple {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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)); {5138#true} is VALID [2022-04-28 11:15:40,991 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {5138#true} {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} #62#return; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:40,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,991 INFO L290 TraceCheckUtils]: 41: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,991 INFO L272 TraceCheckUtils]: 40: Hoare triple {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} assume !false; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:40,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~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; {5404#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:15:40,995 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #70#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:15:40,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,995 INFO L272 TraceCheckUtils]: 33: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,995 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #68#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:15:40,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,995 INFO L272 TraceCheckUtils]: 28: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~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)); {5138#true} is VALID [2022-04-28 11:15:40,996 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #66#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:15:40,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,996 INFO L272 TraceCheckUtils]: 23: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,997 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #64#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:15:40,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,997 INFO L272 TraceCheckUtils]: 18: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,997 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5138#true} {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} #62#return; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:15:40,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,997 INFO L272 TraceCheckUtils]: 13: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} assume !false; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:15:40,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {5486#(= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2)))} is VALID [2022-04-28 11:15:40,998 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5138#true} {5138#true} #60#return; {5138#true} is VALID [2022-04-28 11:15:40,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !(0 == ~cond); {5138#true} is VALID [2022-04-28 11:15:40,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} ~cond := #in~cond; {5138#true} is VALID [2022-04-28 11:15:40,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {5138#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5138#true} is VALID [2022-04-28 11:15:40,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#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; {5138#true} is VALID [2022-04-28 11:15:40,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret5 := main(); {5138#true} is VALID [2022-04-28 11:15:40,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #84#return; {5138#true} is VALID [2022-04-28 11:15:40,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 11:15:40,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#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); {5138#true} is VALID [2022-04-28 11:15:40,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5138#true} is VALID [2022-04-28 11:15:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-28 11:15:40,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:40,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490545615] [2022-04-28 11:15:40,999 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:40,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143061622] [2022-04-28 11:15:40,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143061622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:41,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:41,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 11:15:41,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:41,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384955386] [2022-04-28 11:15:41,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384955386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:41,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:41,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:15:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145644385] [2022-04-28 11:15:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 11:15:41,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:41,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 11:15:41,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:41,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:15:41,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:41,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:15:41,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:15:41,042 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 11:15:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:41,676 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2022-04-28 11:15:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:15:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 11:15:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 11:15:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-04-28 11:15:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 11:15:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2022-04-28 11:15:41,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 100 transitions. [2022-04-28 11:15:41,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:41,809 INFO L225 Difference]: With dead ends: 115 [2022-04-28 11:15:41,809 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 11:15:41,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:15:41,810 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 7 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:41,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 227 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:15:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 11:15:41,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-04-28 11:15:41,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:41,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:15:41,867 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:15:41,867 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:15:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:41,876 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:15:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:15:41,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:41,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:41,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:15:41,879 INFO L87 Difference]: Start difference. First operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand 113 states. [2022-04-28 11:15:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:41,891 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-04-28 11:15:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-04-28 11:15:41,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:41,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:41,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:41,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 29 states have call successors, (29), 17 states have call predecessors, (29), 16 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 11:15:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-28 11:15:41,911 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 76 [2022-04-28 11:15:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:41,911 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-28 11:15:41,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-28 11:15:41,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 115 transitions. [2022-04-28 11:15:42,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-28 11:15:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 11:15:42,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:42,044 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:42,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 11:15:42,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 11:15:42,245 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:42,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 1 times [2022-04-28 11:15:42,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:42,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1615586077] [2022-04-28 11:15:42,534 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:42,534 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1701746168, now seen corresponding path program 2 times [2022-04-28 11:15:42,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:42,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796240102] [2022-04-28 11:15:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:42,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:42,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122285864] [2022-04-28 11:15:42,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:15:42,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:42,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:42,553 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-28 11:15:42,554 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-28 11:15:42,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:15:42,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:42,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 11:15:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:42,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:43,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {6267#true} call ULTIMATE.init(); {6267#true} is VALID [2022-04-28 11:15:43,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {6267#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); {6267#true} is VALID [2022-04-28 11:15:43,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6267#true} {6267#true} #84#return; {6267#true} is VALID [2022-04-28 11:15:43,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {6267#true} call #t~ret5 := main(); {6267#true} is VALID [2022-04-28 11:15:43,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {6267#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; {6267#true} is VALID [2022-04-28 11:15:43,178 INFO L272 TraceCheckUtils]: 6: Hoare triple {6267#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:43,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,178 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6267#true} {6267#true} #60#return; {6267#true} is VALID [2022-04-28 11:15:43,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {6267#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:43,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:43,178 INFO L272 TraceCheckUtils]: 13: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:43,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,179 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:43,179 INFO L272 TraceCheckUtils]: 18: Hoare triple {6305#(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)); {6267#true} is VALID [2022-04-28 11:15:43,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,180 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #64#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:43,180 INFO L272 TraceCheckUtils]: 23: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:43,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,180 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #66#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:43,180 INFO L272 TraceCheckUtils]: 28: Hoare triple {6305#(and (= 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)); {6267#true} is VALID [2022-04-28 11:15:43,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,181 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #68#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:43,181 INFO L272 TraceCheckUtils]: 33: Hoare triple {6305#(and (= 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)); {6267#true} is VALID [2022-04-28 11:15:43,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,182 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #70#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:43,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {6305#(and (= 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; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:43,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !false; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:43,183 INFO L272 TraceCheckUtils]: 40: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:43,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,183 INFO L290 TraceCheckUtils]: 42: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,183 INFO L290 TraceCheckUtils]: 43: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,183 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #62#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:43,183 INFO L272 TraceCheckUtils]: 45: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:43,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,183 INFO L290 TraceCheckUtils]: 47: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,183 INFO L290 TraceCheckUtils]: 48: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,184 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #64#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:43,184 INFO L272 TraceCheckUtils]: 50: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:43,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,185 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #66#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:43,185 INFO L272 TraceCheckUtils]: 55: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~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)); {6267#true} is VALID [2022-04-28 11:15:43,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,185 INFO L290 TraceCheckUtils]: 58: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,185 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #68#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:43,185 INFO L272 TraceCheckUtils]: 60: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~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)); {6267#true} is VALID [2022-04-28 11:15:43,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,185 INFO L290 TraceCheckUtils]: 63: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,186 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6267#true} {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} #70#return; {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} is VALID [2022-04-28 11:15:43,186 INFO L290 TraceCheckUtils]: 65: Hoare triple {6387#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (<= main_~n~0 1))} assume !(~n~0 <= ~a~0); {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:43,186 INFO L272 TraceCheckUtils]: 66: Hoare triple {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:43,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,187 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6267#true} {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} #72#return; {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:43,187 INFO L272 TraceCheckUtils]: 71: Hoare triple {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 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)); {6267#true} is VALID [2022-04-28 11:15:43,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:43,187 INFO L290 TraceCheckUtils]: 73: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:43,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:43,188 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6267#true} {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} #74#return; {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~0) (< main_~a~0 1))} is VALID [2022-04-28 11:15:43,189 INFO L272 TraceCheckUtils]: 76: Hoare triple {6469#(and (= (+ 5 main_~y~0) main_~z~0) (<= 0 main_~a~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)); {6503#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:43,189 INFO L290 TraceCheckUtils]: 77: Hoare triple {6503#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6507#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:43,189 INFO L290 TraceCheckUtils]: 78: Hoare triple {6507#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6268#false} is VALID [2022-04-28 11:15:43,190 INFO L290 TraceCheckUtils]: 79: Hoare triple {6268#false} assume !false; {6268#false} is VALID [2022-04-28 11:15:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:15:43,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:49,944 INFO L290 TraceCheckUtils]: 79: Hoare triple {6268#false} assume !false; {6268#false} is VALID [2022-04-28 11:15:49,944 INFO L290 TraceCheckUtils]: 78: Hoare triple {6507#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6268#false} is VALID [2022-04-28 11:15:49,945 INFO L290 TraceCheckUtils]: 77: Hoare triple {6503#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6507#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:49,945 INFO L272 TraceCheckUtils]: 76: Hoare triple {6523#(= (+ (* 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)); {6503#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:49,946 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6267#true} {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #74#return; {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:15:49,946 INFO L290 TraceCheckUtils]: 74: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,946 INFO L290 TraceCheckUtils]: 73: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,946 INFO L290 TraceCheckUtils]: 72: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,946 INFO L272 TraceCheckUtils]: 71: Hoare triple {6523#(= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:49,946 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {6267#true} {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #72#return; {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:15:49,946 INFO L290 TraceCheckUtils]: 69: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,946 INFO L290 TraceCheckUtils]: 68: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,946 INFO L290 TraceCheckUtils]: 67: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,946 INFO L272 TraceCheckUtils]: 66: Hoare triple {6523#(= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:49,947 INFO L290 TraceCheckUtils]: 65: Hoare triple {6557#(or (= (+ (* 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); {6523#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:15:49,947 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #70#return; {6557#(or (= (+ (* 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-28 11:15:49,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,948 INFO L272 TraceCheckUtils]: 60: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:49,948 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #68#return; {6557#(or (= (+ (* 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-28 11:15:49,948 INFO L290 TraceCheckUtils]: 58: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,948 INFO L290 TraceCheckUtils]: 57: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,948 INFO L272 TraceCheckUtils]: 55: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:49,949 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #66#return; {6557#(or (= (+ (* 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-28 11:15:49,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,949 INFO L272 TraceCheckUtils]: 50: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:49,949 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #64#return; {6557#(or (= (+ (* 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-28 11:15:49,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,950 INFO L272 TraceCheckUtils]: 45: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:49,950 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6267#true} {6557#(or (= (+ (* 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))} #62#return; {6557#(or (= (+ (* 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-28 11:15:49,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,950 INFO L290 TraceCheckUtils]: 42: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,950 INFO L272 TraceCheckUtils]: 40: Hoare triple {6557#(or (= (+ (* 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)); {6267#true} is VALID [2022-04-28 11:15:49,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {6557#(or (= (+ (* 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 !false; {6557#(or (= (+ (* 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-28 11:15:49,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {6305#(and (= 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; {6557#(or (= (+ (* 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-28 11:15:49,952 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #70#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:49,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,952 INFO L290 TraceCheckUtils]: 35: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,953 INFO L272 TraceCheckUtils]: 33: Hoare triple {6305#(and (= 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)); {6267#true} is VALID [2022-04-28 11:15:49,953 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #68#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:49,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,953 INFO L272 TraceCheckUtils]: 28: Hoare triple {6305#(and (= 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)); {6267#true} is VALID [2022-04-28 11:15:49,954 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #66#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:49,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,954 INFO L272 TraceCheckUtils]: 23: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:49,954 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #64#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:49,955 INFO L290 TraceCheckUtils]: 21: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,955 INFO L272 TraceCheckUtils]: 18: Hoare triple {6305#(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)); {6267#true} is VALID [2022-04-28 11:15:49,955 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6267#true} {6305#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:49,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,955 INFO L272 TraceCheckUtils]: 13: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:49,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {6305#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:49,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {6267#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {6305#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-28 11:15:49,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6267#true} {6267#true} #60#return; {6267#true} is VALID [2022-04-28 11:15:49,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {6267#true} assume !(0 == ~cond); {6267#true} is VALID [2022-04-28 11:15:49,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {6267#true} ~cond := #in~cond; {6267#true} is VALID [2022-04-28 11:15:49,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {6267#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {6267#true} is VALID [2022-04-28 11:15:49,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {6267#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; {6267#true} is VALID [2022-04-28 11:15:49,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {6267#true} call #t~ret5 := main(); {6267#true} is VALID [2022-04-28 11:15:49,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6267#true} {6267#true} #84#return; {6267#true} is VALID [2022-04-28 11:15:49,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {6267#true} assume true; {6267#true} is VALID [2022-04-28 11:15:49,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {6267#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); {6267#true} is VALID [2022-04-28 11:15:49,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {6267#true} call ULTIMATE.init(); {6267#true} is VALID [2022-04-28 11:15:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:15:49,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:49,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796240102] [2022-04-28 11:15:49,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:49,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122285864] [2022-04-28 11:15:49,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122285864] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:49,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:49,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 11:15:49,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:49,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1615586077] [2022-04-28 11:15:49,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1615586077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:49,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:49,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:15:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657473862] [2022-04-28 11:15:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:15:49,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:49,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:49,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:49,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:15:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:49,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:15:49,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 11:15:49,998 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:50,588 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-04-28 11:15:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:15:50,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 80 [2022-04-28 11:15:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:15:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-28 11:15:50,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-28 11:15:50,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:50,648 INFO L225 Difference]: With dead ends: 109 [2022-04-28 11:15:50,648 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 11:15:50,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:15:50,648 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:50,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 216 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 11:15:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 11:15:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 11:15:50,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:50,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:50,690 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:50,691 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:50,692 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:15:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:15:50,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:50,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:50,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:15:50,693 INFO L87 Difference]: Start difference. First operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 96 states. [2022-04-28 11:15:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:50,694 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-28 11:15:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:15:50,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:50,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:50,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:50,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.037037037037037) internal successors, (56), 56 states have internal predecessors, (56), 26 states have call successors, (26), 16 states have call predecessors, (26), 15 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 11:15:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-04-28 11:15:50,696 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 80 [2022-04-28 11:15:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:50,696 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-04-28 11:15:50,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:50,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 106 transitions. [2022-04-28 11:15:50,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-04-28 11:15:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 11:15:50,803 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:50,803 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:50,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 11:15:51,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:51,004 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 9 times [2022-04-28 11:15:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:51,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612928479] [2022-04-28 11:15:51,365 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:51,366 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1156119141, now seen corresponding path program 10 times [2022-04-28 11:15:51,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:51,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541450479] [2022-04-28 11:15:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:51,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:51,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774601778] [2022-04-28 11:15:51,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:51,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:51,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:51,389 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-28 11:15:51,390 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-28 11:15:51,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:51,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:51,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 11:15:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:51,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:51,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {7361#true} call ULTIMATE.init(); {7361#true} is VALID [2022-04-28 11:15:51,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#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); {7361#true} is VALID [2022-04-28 11:15:51,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7361#true} #84#return; {7361#true} is VALID [2022-04-28 11:15:51,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {7361#true} call #t~ret5 := main(); {7361#true} is VALID [2022-04-28 11:15:51,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#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; {7361#true} is VALID [2022-04-28 11:15:51,783 INFO L272 TraceCheckUtils]: 6: Hoare triple {7361#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:51,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7361#true} {7361#true} #60#return; {7361#true} is VALID [2022-04-28 11:15:51,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {7361#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:51,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:51,784 INFO L272 TraceCheckUtils]: 13: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:51,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,785 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:51,785 INFO L272 TraceCheckUtils]: 18: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:51,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,786 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:51,786 INFO L272 TraceCheckUtils]: 23: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:51,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,787 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:51,787 INFO L272 TraceCheckUtils]: 28: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:51,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,787 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:51,788 INFO L272 TraceCheckUtils]: 33: Hoare triple {7399#(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)); {7361#true} is VALID [2022-04-28 11:15:51,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,788 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7361#true} {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {7399#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:51,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {7399#(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; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:51,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} assume !false; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:51,789 INFO L272 TraceCheckUtils]: 40: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:51,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,790 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #62#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:51,790 INFO L272 TraceCheckUtils]: 45: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:51,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,790 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #64#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:51,790 INFO L272 TraceCheckUtils]: 50: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:51,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,791 INFO L290 TraceCheckUtils]: 52: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,791 INFO L290 TraceCheckUtils]: 53: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,791 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #66#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:51,791 INFO L272 TraceCheckUtils]: 55: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) 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)); {7361#true} is VALID [2022-04-28 11:15:51,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,792 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #68#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:51,792 INFO L272 TraceCheckUtils]: 60: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:51,792 INFO L290 TraceCheckUtils]: 61: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,792 INFO L290 TraceCheckUtils]: 62: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,792 INFO L290 TraceCheckUtils]: 63: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,792 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7361#true} {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} #70#return; {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 11:15:51,793 INFO L290 TraceCheckUtils]: 65: Hoare triple {7481#(and (= (+ (- 1) main_~x~0) 0) (= main_~n~0 1) (= 6 (+ (- 1) 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; {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:15:51,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} assume !false; {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:15:51,793 INFO L272 TraceCheckUtils]: 67: Hoare triple {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:51,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,793 INFO L290 TraceCheckUtils]: 70: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,794 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7361#true} {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} #62#return; {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:15:51,794 INFO L272 TraceCheckUtils]: 72: Hoare triple {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:51,794 INFO L290 TraceCheckUtils]: 73: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:51,794 INFO L290 TraceCheckUtils]: 74: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:51,794 INFO L290 TraceCheckUtils]: 75: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:51,794 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7361#true} {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} #64#return; {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} is VALID [2022-04-28 11:15:51,795 INFO L272 TraceCheckUtils]: 77: Hoare triple {7563#(and (= 6 (+ (- 2) main_~x~0)) (= (+ (- 1) main_~n~0) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7600#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:51,795 INFO L290 TraceCheckUtils]: 78: Hoare triple {7600#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7604#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:51,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7362#false} is VALID [2022-04-28 11:15:51,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-04-28 11:15:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:15:51,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:52,061 INFO L290 TraceCheckUtils]: 80: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-04-28 11:15:52,061 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7362#false} is VALID [2022-04-28 11:15:52,062 INFO L290 TraceCheckUtils]: 78: Hoare triple {7600#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7604#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:52,062 INFO L272 TraceCheckUtils]: 77: Hoare triple {7620#(= (* 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)); {7600#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:52,063 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {7361#true} {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:52,063 INFO L290 TraceCheckUtils]: 75: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,063 INFO L290 TraceCheckUtils]: 74: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,063 INFO L290 TraceCheckUtils]: 73: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,063 INFO L272 TraceCheckUtils]: 72: Hoare triple {7620#(= (* 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)); {7361#true} is VALID [2022-04-28 11:15:52,063 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7361#true} {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:52,063 INFO L290 TraceCheckUtils]: 70: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,064 INFO L272 TraceCheckUtils]: 67: Hoare triple {7620#(= (* 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)); {7361#true} is VALID [2022-04-28 11:15:52,064 INFO L290 TraceCheckUtils]: 66: Hoare triple {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:52,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {7657#(= (* (+ 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; {7620#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:15:52,066 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:52,066 INFO L290 TraceCheckUtils]: 63: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,066 INFO L290 TraceCheckUtils]: 61: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,066 INFO L272 TraceCheckUtils]: 60: Hoare triple {7657#(= (* (+ 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)); {7361#true} is VALID [2022-04-28 11:15:52,067 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:52,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,067 INFO L290 TraceCheckUtils]: 57: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,067 INFO L272 TraceCheckUtils]: 55: Hoare triple {7657#(= (* (+ 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)); {7361#true} is VALID [2022-04-28 11:15:52,068 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:52,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,068 INFO L272 TraceCheckUtils]: 50: Hoare triple {7657#(= (* (+ 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)); {7361#true} is VALID [2022-04-28 11:15:52,068 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:52,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,068 INFO L272 TraceCheckUtils]: 45: Hoare triple {7657#(= (* (+ 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)); {7361#true} is VALID [2022-04-28 11:15:52,069 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7361#true} {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:52,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,069 INFO L272 TraceCheckUtils]: 40: Hoare triple {7657#(= (* (+ 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)); {7361#true} is VALID [2022-04-28 11:15:52,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:52,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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; {7657#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:15:52,072 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:52,072 INFO L290 TraceCheckUtils]: 36: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,072 INFO L272 TraceCheckUtils]: 33: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:52,072 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:52,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,073 INFO L272 TraceCheckUtils]: 28: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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)); {7361#true} is VALID [2022-04-28 11:15:52,073 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:52,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,073 INFO L272 TraceCheckUtils]: 23: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:52,074 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:52,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,074 INFO L272 TraceCheckUtils]: 18: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:52,075 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7361#true} {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:52,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,075 INFO L272 TraceCheckUtils]: 13: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:52,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:52,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {7361#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {7739#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:15:52,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7361#true} {7361#true} #60#return; {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume !(0 == ~cond); {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {7361#true} ~cond := #in~cond; {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L272 TraceCheckUtils]: 6: Hoare triple {7361#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#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; {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {7361#true} call #t~ret5 := main(); {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7361#true} #84#return; {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#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); {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {7361#true} call ULTIMATE.init(); {7361#true} is VALID [2022-04-28 11:15:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-28 11:15:52,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:52,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541450479] [2022-04-28 11:15:52,077 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:52,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774601778] [2022-04-28 11:15:52,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774601778] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:52,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:52,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 11:15:52,077 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:52,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612928479] [2022-04-28 11:15:52,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612928479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:52,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:52,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 11:15:52,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512070384] [2022-04-28 11:15:52,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:52,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:15:52,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:52,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:52,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:52,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 11:15:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:52,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 11:15:52,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 11:15:52,115 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:53,074 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-04-28 11:15:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 11:15:53,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 81 [2022-04-28 11:15:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:15:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-04-28 11:15:53,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-04-28 11:15:53,154 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-28 11:15:53,156 INFO L225 Difference]: With dead ends: 112 [2022-04-28 11:15:53,156 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 11:15:53,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:15:53,157 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:53,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 222 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 11:15:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 11:15:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2022-04-28 11:15:53,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:53,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:15:53,205 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:15:53,205 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:15:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:53,207 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:15:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:15:53,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:53,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:53,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:15:53,208 INFO L87 Difference]: Start difference. First operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand 110 states. [2022-04-28 11:15:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:53,209 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2022-04-28 11:15:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2022-04-28 11:15:53,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:53,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:53,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:53,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 59 states have internal predecessors, (59), 27 states have call successors, (27), 17 states have call predecessors, (27), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-28 11:15:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 11:15:53,211 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 81 [2022-04-28 11:15:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:53,212 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 11:15:53,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 11:15:53,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 11:15:53,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 11:15:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 11:15:53,354 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:53,354 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:53,370 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-28 11:15:53,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 11:15:53,554 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 11 times [2022-04-28 11:15:53,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:53,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204552734] [2022-04-28 11:15:53,785 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:53,785 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:53,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1087104342, now seen corresponding path program 12 times [2022-04-28 11:15:53,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:53,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701568265] [2022-04-28 11:15:53,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:53,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:53,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:53,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1892744912] [2022-04-28 11:15:53,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:15:53,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:53,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:53,793 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-28 11:15:53,794 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-28 11:15:53,834 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:15:53,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:53,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 11:15:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:53,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:54,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {8504#true} call ULTIMATE.init(); {8504#true} is VALID [2022-04-28 11:15:54,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {8504#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); {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8504#true} {8504#true} #84#return; {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {8504#true} call #t~ret5 := main(); {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {8504#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; {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {8504#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8504#true} {8504#true} #60#return; {8504#true} is VALID [2022-04-28 11:15:54,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {8504#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,313 INFO L272 TraceCheckUtils]: 13: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:54,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,313 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,314 INFO L272 TraceCheckUtils]: 18: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:54,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,314 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,314 INFO L272 TraceCheckUtils]: 23: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:54,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,315 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,315 INFO L272 TraceCheckUtils]: 28: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:54,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,316 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,316 INFO L272 TraceCheckUtils]: 33: Hoare triple {8542#(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)); {8504#true} is VALID [2022-04-28 11:15:54,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,316 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8504#true} {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {8542#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:54,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {8542#(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; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:54,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:54,317 INFO L272 TraceCheckUtils]: 40: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,318 INFO L290 TraceCheckUtils]: 41: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,318 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8504#true} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:54,318 INFO L272 TraceCheckUtils]: 45: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,319 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8504#true} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:54,319 INFO L272 TraceCheckUtils]: 50: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,320 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8504#true} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #66#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:54,320 INFO L272 TraceCheckUtils]: 55: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 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)); {8504#true} is VALID [2022-04-28 11:15:54,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,320 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8504#true} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #68#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:54,320 INFO L272 TraceCheckUtils]: 60: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 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)); {8504#true} is VALID [2022-04-28 11:15:54,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {8504#true} ~cond := #in~cond; {8694#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:54,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {8694#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,322 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #70#return; {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:54,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {8624#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 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; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,323 INFO L290 TraceCheckUtils]: 66: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} assume !false; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,323 INFO L272 TraceCheckUtils]: 67: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,323 INFO L290 TraceCheckUtils]: 68: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,323 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8504#true} {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} #62#return; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,323 INFO L272 TraceCheckUtils]: 72: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,323 INFO L290 TraceCheckUtils]: 73: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,324 INFO L290 TraceCheckUtils]: 75: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,324 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8504#true} {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} #64#return; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,324 INFO L272 TraceCheckUtils]: 77: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,324 INFO L290 TraceCheckUtils]: 78: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,324 INFO L290 TraceCheckUtils]: 79: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,324 INFO L290 TraceCheckUtils]: 80: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,325 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8504#true} {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} #66#return; {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~0 8))} is VALID [2022-04-28 11:15:54,325 INFO L272 TraceCheckUtils]: 82: Hoare triple {8708#(and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) (= main_~x~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)); {8760#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:54,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {8760#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8764#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:54,326 INFO L290 TraceCheckUtils]: 84: Hoare triple {8764#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8505#false} is VALID [2022-04-28 11:15:54,326 INFO L290 TraceCheckUtils]: 85: Hoare triple {8505#false} assume !false; {8505#false} is VALID [2022-04-28 11:15:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 52 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-28 11:15:54,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:54,918 INFO L290 TraceCheckUtils]: 85: Hoare triple {8505#false} assume !false; {8505#false} is VALID [2022-04-28 11:15:54,918 INFO L290 TraceCheckUtils]: 84: Hoare triple {8764#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8505#false} is VALID [2022-04-28 11:15:54,918 INFO L290 TraceCheckUtils]: 83: Hoare triple {8760#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8764#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:54,919 INFO L272 TraceCheckUtils]: 82: Hoare triple {8780#(= (+ (* 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)); {8760#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:54,919 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {8504#true} {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #66#return; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:54,919 INFO L290 TraceCheckUtils]: 80: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,919 INFO L290 TraceCheckUtils]: 79: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,920 INFO L290 TraceCheckUtils]: 78: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,920 INFO L272 TraceCheckUtils]: 77: Hoare triple {8780#(= (+ (* 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)); {8504#true} is VALID [2022-04-28 11:15:54,920 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8504#true} {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #64#return; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:54,920 INFO L290 TraceCheckUtils]: 75: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,920 INFO L290 TraceCheckUtils]: 74: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,920 INFO L272 TraceCheckUtils]: 72: Hoare triple {8780#(= (+ (* 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)); {8504#true} is VALID [2022-04-28 11:15:54,921 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {8504#true} {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} #62#return; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:54,921 INFO L290 TraceCheckUtils]: 70: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,921 INFO L290 TraceCheckUtils]: 69: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,921 INFO L290 TraceCheckUtils]: 68: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,921 INFO L272 TraceCheckUtils]: 67: Hoare triple {8780#(= (+ (* 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)); {8504#true} is VALID [2022-04-28 11:15:54,921 INFO L290 TraceCheckUtils]: 66: Hoare triple {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} assume !false; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:54,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {8832#(= (+ (* 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; {8780#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:15:54,925 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8832#(= (+ (* 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-28 11:15:54,925 INFO L290 TraceCheckUtils]: 63: Hoare triple {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {8846#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:15:54,926 INFO L290 TraceCheckUtils]: 61: Hoare triple {8504#true} ~cond := #in~cond; {8846#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:15:54,926 INFO L272 TraceCheckUtils]: 60: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,926 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8504#true} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:54,926 INFO L290 TraceCheckUtils]: 58: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,926 INFO L272 TraceCheckUtils]: 55: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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)); {8504#true} is VALID [2022-04-28 11:15:54,927 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8504#true} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:54,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,927 INFO L290 TraceCheckUtils]: 52: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,927 INFO L272 TraceCheckUtils]: 50: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,927 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8504#true} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:54,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,928 INFO L290 TraceCheckUtils]: 46: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,928 INFO L272 TraceCheckUtils]: 45: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,928 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8504#true} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:54,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:54,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:54,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:54,928 INFO L272 TraceCheckUtils]: 40: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:54,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:56,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:56,069 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8504#true} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:56,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:56,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:56,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:56,069 INFO L272 TraceCheckUtils]: 33: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:56,070 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8504#true} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:56,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:56,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:56,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:56,070 INFO L272 TraceCheckUtils]: 28: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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)); {8504#true} is VALID [2022-04-28 11:15:56,070 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {8504#true} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:56,070 INFO L290 TraceCheckUtils]: 26: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:56,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:56,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:56,070 INFO L272 TraceCheckUtils]: 23: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:56,071 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8504#true} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:56,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:56,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:56,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:56,071 INFO L272 TraceCheckUtils]: 18: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:56,072 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8504#true} {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:56,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:56,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:56,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:56,072 INFO L272 TraceCheckUtils]: 13: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:56,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:56,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {8504#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {8836#(or (= (+ (* 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))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:15:56,073 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8504#true} {8504#true} #60#return; {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {8504#true} assume !(0 == ~cond); {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {8504#true} ~cond := #in~cond; {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {8504#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {8504#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; {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {8504#true} call #t~ret5 := main(); {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8504#true} {8504#true} #84#return; {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {8504#true} assume true; {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {8504#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); {8504#true} is VALID [2022-04-28 11:15:56,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {8504#true} call ULTIMATE.init(); {8504#true} is VALID [2022-04-28 11:15:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2022-04-28 11:15:56,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:56,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701568265] [2022-04-28 11:15:56,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:56,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892744912] [2022-04-28 11:15:56,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892744912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:15:56,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:15:56,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-04-28 11:15:56,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:56,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204552734] [2022-04-28 11:15:56,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204552734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:56,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:56,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:15:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404292219] [2022-04-28 11:15:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:56,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:15:56,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:56,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:56,104 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-28 11:15:56,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:15:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:56,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:15:56,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:15:56,105 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:57,106 INFO L93 Difference]: Finished difference Result 116 states and 133 transitions. [2022-04-28 11:15:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:15:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 86 [2022-04-28 11:15:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:15:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:57,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 94 transitions. [2022-04-28 11:15:57,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 94 transitions. [2022-04-28 11:15:57,190 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-28 11:15:57,191 INFO L225 Difference]: With dead ends: 116 [2022-04-28 11:15:57,191 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 11:15:57,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:15:57,192 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:57,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 134 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 11:15:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 11:15:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 11:15:57,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:57,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:57,245 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:57,246 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:57,247 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:15:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:15:57,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:57,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:57,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:15:57,248 INFO L87 Difference]: Start difference. First operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 111 states. [2022-04-28 11:15:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:57,250 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-28 11:15:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:15:57,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:57,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:57,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:57,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 63 states have internal predecessors, (64), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-28 11:15:57,254 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 86 [2022-04-28 11:15:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:57,255 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-28 11:15:57,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 11:15:57,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 125 transitions. [2022-04-28 11:15:57,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-28 11:15:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 11:15:57,382 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:57,382 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 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, 1, 1, 1, 1] [2022-04-28 11:15:57,398 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-28 11:15:57,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 11:15:57,598 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:15:57,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:15:57,598 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 3 times [2022-04-28 11:15:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:57,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [550556136] [2022-04-28 11:15:57,846 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:15:57,846 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:15:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash 511374036, now seen corresponding path program 4 times [2022-04-28 11:15:57,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:15:57,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612831548] [2022-04-28 11:15:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:15:57,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:15:57,854 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:15:57,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876261331] [2022-04-28 11:15:57,854 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:15:57,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:15:57,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:15:57,855 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-28 11:15:57,895 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-28 11:15:57,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:15:57,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:15:57,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 11:15:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:15:57,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:15:58,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {9712#true} call ULTIMATE.init(); {9712#true} is VALID [2022-04-28 11:15:58,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {9712#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); {9712#true} is VALID [2022-04-28 11:15:58,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9712#true} {9712#true} #84#return; {9712#true} is VALID [2022-04-28 11:15:58,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {9712#true} call #t~ret5 := main(); {9712#true} is VALID [2022-04-28 11:15:58,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {9712#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; {9712#true} is VALID [2022-04-28 11:15:58,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {9712#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:58,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,473 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9712#true} {9712#true} #60#return; {9712#true} is VALID [2022-04-28 11:15:58,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {9712#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:58,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:58,473 INFO L272 TraceCheckUtils]: 13: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:58,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,474 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:58,474 INFO L272 TraceCheckUtils]: 18: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:58,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,475 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:58,475 INFO L272 TraceCheckUtils]: 23: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:58,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,475 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:58,475 INFO L272 TraceCheckUtils]: 28: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:58,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,476 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:58,476 INFO L272 TraceCheckUtils]: 33: Hoare triple {9750#(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)); {9712#true} is VALID [2022-04-28 11:15:58,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,476 INFO L290 TraceCheckUtils]: 36: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,476 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9712#true} {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {9750#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:15:58,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {9750#(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; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:58,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} assume !false; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:58,477 INFO L272 TraceCheckUtils]: 40: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:58,477 INFO L290 TraceCheckUtils]: 41: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,477 INFO L290 TraceCheckUtils]: 42: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,477 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #62#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:58,478 INFO L272 TraceCheckUtils]: 45: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:58,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,478 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #64#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:58,478 INFO L272 TraceCheckUtils]: 50: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:58,478 INFO L290 TraceCheckUtils]: 51: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,478 INFO L290 TraceCheckUtils]: 52: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,478 INFO L290 TraceCheckUtils]: 53: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,479 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #66#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:58,479 INFO L272 TraceCheckUtils]: 55: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 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)); {9712#true} is VALID [2022-04-28 11:15:58,479 INFO L290 TraceCheckUtils]: 56: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,479 INFO L290 TraceCheckUtils]: 58: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,479 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #68#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:58,479 INFO L272 TraceCheckUtils]: 60: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 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)); {9712#true} is VALID [2022-04-28 11:15:58,479 INFO L290 TraceCheckUtils]: 61: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,479 INFO L290 TraceCheckUtils]: 62: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,479 INFO L290 TraceCheckUtils]: 63: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,481 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9712#true} {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} #70#return; {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:15:58,482 INFO L290 TraceCheckUtils]: 65: Hoare triple {9832#(and (= (+ main_~z~0 main_~x~0 (- 6)) main_~y~0) (= (+ main_~z~0 (- 6)) 6) (= main_~x~0 1) (= (+ (- 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; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:58,482 INFO L290 TraceCheckUtils]: 66: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} assume !false; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:58,482 INFO L272 TraceCheckUtils]: 67: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:58,482 INFO L290 TraceCheckUtils]: 68: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,482 INFO L290 TraceCheckUtils]: 69: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,482 INFO L290 TraceCheckUtils]: 70: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,483 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #62#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:58,483 INFO L272 TraceCheckUtils]: 72: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:58,483 INFO L290 TraceCheckUtils]: 73: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,483 INFO L290 TraceCheckUtils]: 74: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,483 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #64#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:58,483 INFO L272 TraceCheckUtils]: 77: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:58,483 INFO L290 TraceCheckUtils]: 78: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,483 INFO L290 TraceCheckUtils]: 79: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,483 INFO L290 TraceCheckUtils]: 80: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,484 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #66#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:58,484 INFO L272 TraceCheckUtils]: 82: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~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)); {9712#true} is VALID [2022-04-28 11:15:58,484 INFO L290 TraceCheckUtils]: 83: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,484 INFO L290 TraceCheckUtils]: 84: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,484 INFO L290 TraceCheckUtils]: 85: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,484 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #68#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:58,484 INFO L272 TraceCheckUtils]: 87: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:58,484 INFO L290 TraceCheckUtils]: 88: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,485 INFO L290 TraceCheckUtils]: 90: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,485 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {9712#true} {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} #70#return; {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:58,485 INFO L290 TraceCheckUtils]: 92: Hoare triple {9914#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= (+ (- 1) main_~x~0) 7))} assume !(~n~0 <= ~a~0); {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:58,485 INFO L272 TraceCheckUtils]: 93: Hoare triple {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {9712#true} is VALID [2022-04-28 11:15:58,485 INFO L290 TraceCheckUtils]: 94: Hoare triple {9712#true} ~cond := #in~cond; {9712#true} is VALID [2022-04-28 11:15:58,486 INFO L290 TraceCheckUtils]: 95: Hoare triple {9712#true} assume !(0 == ~cond); {9712#true} is VALID [2022-04-28 11:15:58,486 INFO L290 TraceCheckUtils]: 96: Hoare triple {9712#true} assume true; {9712#true} is VALID [2022-04-28 11:15:58,486 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {9712#true} {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} #72#return; {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} is VALID [2022-04-28 11:15:58,486 INFO L272 TraceCheckUtils]: 98: Hoare triple {9996#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= (+ (- 1) main_~x~0) 7))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {10015#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:15:58,487 INFO L290 TraceCheckUtils]: 99: Hoare triple {10015#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10019#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:15:58,487 INFO L290 TraceCheckUtils]: 100: Hoare triple {10019#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9713#false} is VALID [2022-04-28 11:15:58,487 INFO L290 TraceCheckUtils]: 101: Hoare triple {9713#false} assume !false; {9713#false} is VALID [2022-04-28 11:15:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-28 11:15:58,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:15:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:15:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612831548] [2022-04-28 11:15:58,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:15:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876261331] [2022-04-28 11:15:58,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876261331] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:15:58,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:15:58,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:15:58,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:15:58,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [550556136] [2022-04-28 11:15:58,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [550556136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:15:58,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:15:58,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:15:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496532454] [2022-04-28 11:15:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:15:58,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 102 [2022-04-28 11:15:58,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:15:58,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-28 11:15:58,878 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-28 11:15:58,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:15:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:15:58,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:15:58,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:15:58,879 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-28 11:15:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:59,595 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-04-28 11:15:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:15:59,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 102 [2022-04-28 11:15:59,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:15:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-28 11:15:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:15:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-28 11:15:59,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:15:59,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:15:59,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:59,653 INFO L225 Difference]: With dead ends: 117 [2022-04-28 11:15:59,653 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 11:15:59,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:15:59,654 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:15:59,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:15:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 11:15:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-04-28 11:15:59,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:15:59,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:59,730 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:59,730 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:59,732 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:15:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:15:59,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:59,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:59,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:15:59,733 INFO L87 Difference]: Start difference. First operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand 115 states. [2022-04-28 11:15:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:15:59,736 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-04-28 11:15:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:15:59,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:15:59,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:15:59,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:15:59,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:15:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 64 states have (on average 1.046875) internal successors, (67), 66 states have internal predecessors, (67), 32 states have call successors, (32), 19 states have call predecessors, (32), 18 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:15:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2022-04-28 11:15:59,739 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 102 [2022-04-28 11:15:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:15:59,739 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2022-04-28 11:15:59,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-28 11:15:59,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 128 transitions. [2022-04-28 11:15:59,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:15:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2022-04-28 11:15:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-28 11:15:59,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:15:59,864 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:15:59,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 11:16:00,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 11:16:00,079 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:00,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 13 times [2022-04-28 11:16:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:00,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [780693704] [2022-04-28 11:16:00,266 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:00,266 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash -360684101, now seen corresponding path program 14 times [2022-04-28 11:16:00,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:00,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408832332] [2022-04-28 11:16:00,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:00,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:00,277 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:00,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1308686875] [2022-04-28 11:16:00,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:16:00,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:00,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:00,287 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-28 11:16:00,304 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-28 11:16:00,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:16:00,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:00,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 11:16:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:00,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:00,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {10840#true} call ULTIMATE.init(); {10840#true} is VALID [2022-04-28 11:16:00,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {10840#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); {10840#true} is VALID [2022-04-28 11:16:00,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10840#true} {10840#true} #84#return; {10840#true} is VALID [2022-04-28 11:16:00,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {10840#true} call #t~ret5 := main(); {10840#true} is VALID [2022-04-28 11:16:00,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {10840#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; {10840#true} is VALID [2022-04-28 11:16:00,876 INFO L272 TraceCheckUtils]: 6: Hoare triple {10840#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10840#true} {10840#true} #60#return; {10840#true} is VALID [2022-04-28 11:16:00,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {10840#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:16:00,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} assume !false; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:16:00,877 INFO L272 TraceCheckUtils]: 13: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,877 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #62#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:16:00,877 INFO L272 TraceCheckUtils]: 18: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,878 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #64#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:16:00,878 INFO L272 TraceCheckUtils]: 23: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,878 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #66#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:16:00,879 INFO L272 TraceCheckUtils]: 28: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 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)); {10840#true} is VALID [2022-04-28 11:16:00,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,879 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #68#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:16:00,879 INFO L272 TraceCheckUtils]: 33: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,880 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10840#true} {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} #70#return; {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 main_~y~0))} is VALID [2022-04-28 11:16:00,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {10878#(and (= main_~n~0 0) (= main_~z~0 6) (<= 1 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; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:16:00,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} assume !false; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:16:00,881 INFO L272 TraceCheckUtils]: 40: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,881 INFO L290 TraceCheckUtils]: 41: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,881 INFO L290 TraceCheckUtils]: 43: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,881 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #62#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:16:00,882 INFO L272 TraceCheckUtils]: 45: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,882 INFO L290 TraceCheckUtils]: 46: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,882 INFO L290 TraceCheckUtils]: 47: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,882 INFO L290 TraceCheckUtils]: 48: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,882 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #64#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:16:00,882 INFO L272 TraceCheckUtils]: 50: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,883 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #66#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:16:00,883 INFO L272 TraceCheckUtils]: 55: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= 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)); {10840#true} is VALID [2022-04-28 11:16:00,883 INFO L290 TraceCheckUtils]: 56: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,883 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #68#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:16:00,884 INFO L272 TraceCheckUtils]: 60: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,884 INFO L290 TraceCheckUtils]: 61: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,884 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10840#true} {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} #70#return; {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~0 1))} is VALID [2022-04-28 11:16:00,885 INFO L290 TraceCheckUtils]: 65: Hoare triple {10960#(and (<= main_~z~0 (+ 5 main_~y~0)) (= (+ main_~z~0 (- 6)) 6) (= main_~n~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; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:16:00,885 INFO L290 TraceCheckUtils]: 66: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} assume !false; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:16:00,885 INFO L272 TraceCheckUtils]: 67: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,885 INFO L290 TraceCheckUtils]: 68: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,885 INFO L290 TraceCheckUtils]: 69: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,885 INFO L290 TraceCheckUtils]: 70: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,886 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10840#true} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #62#return; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:16:00,886 INFO L272 TraceCheckUtils]: 72: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,886 INFO L290 TraceCheckUtils]: 73: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,886 INFO L290 TraceCheckUtils]: 75: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,886 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10840#true} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #64#return; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:16:00,886 INFO L272 TraceCheckUtils]: 77: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,886 INFO L290 TraceCheckUtils]: 78: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,886 INFO L290 TraceCheckUtils]: 79: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,886 INFO L290 TraceCheckUtils]: 80: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,887 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10840#true} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #66#return; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:16:00,887 INFO L272 TraceCheckUtils]: 82: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~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)); {10840#true} is VALID [2022-04-28 11:16:00,887 INFO L290 TraceCheckUtils]: 83: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,887 INFO L290 TraceCheckUtils]: 84: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,887 INFO L290 TraceCheckUtils]: 85: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,888 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10840#true} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #68#return; {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} is VALID [2022-04-28 11:16:00,888 INFO L272 TraceCheckUtils]: 87: Hoare triple {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,888 INFO L290 TraceCheckUtils]: 88: Hoare triple {10840#true} ~cond := #in~cond; {11112#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:00,888 INFO L290 TraceCheckUtils]: 89: Hoare triple {11112#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:00,889 INFO L290 TraceCheckUtils]: 90: Hoare triple {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:00,889 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} {11042#(and (<= 19 main_~y~0) (= main_~z~0 18) (= main_~n~0 2))} #70#return; {11123#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))))} is VALID [2022-04-28 11:16:00,890 INFO L290 TraceCheckUtils]: 92: Hoare triple {11123#(and (= main_~z~0 18) (= main_~n~0 2) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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; {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} is VALID [2022-04-28 11:16:00,890 INFO L290 TraceCheckUtils]: 93: Hoare triple {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} assume !false; {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} is VALID [2022-04-28 11:16:00,890 INFO L272 TraceCheckUtils]: 94: Hoare triple {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:00,890 INFO L290 TraceCheckUtils]: 95: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:00,890 INFO L290 TraceCheckUtils]: 96: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:00,890 INFO L290 TraceCheckUtils]: 97: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:00,891 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10840#true} {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} #62#return; {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} is VALID [2022-04-28 11:16:00,892 INFO L272 TraceCheckUtils]: 99: Hoare triple {11127#(and (= main_~n~0 3) (= (* main_~y~0 12) 444))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {11149#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:00,892 INFO L290 TraceCheckUtils]: 100: Hoare triple {11149#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11153#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:00,892 INFO L290 TraceCheckUtils]: 101: Hoare triple {11153#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10841#false} is VALID [2022-04-28 11:16:00,892 INFO L290 TraceCheckUtils]: 102: Hoare triple {10841#false} assume !false; {10841#false} is VALID [2022-04-28 11:16:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 73 proven. 34 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-28 11:16:00,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:02,374 INFO L290 TraceCheckUtils]: 102: Hoare triple {10841#false} assume !false; {10841#false} is VALID [2022-04-28 11:16:02,375 INFO L290 TraceCheckUtils]: 101: Hoare triple {11153#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10841#false} is VALID [2022-04-28 11:16:02,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {11149#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11153#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:02,375 INFO L272 TraceCheckUtils]: 99: Hoare triple {11169#(= (+ (* 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)); {11149#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:02,376 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {10840#true} {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} #62#return; {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:16:02,376 INFO L290 TraceCheckUtils]: 97: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,376 INFO L290 TraceCheckUtils]: 96: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,376 INFO L290 TraceCheckUtils]: 95: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,376 INFO L272 TraceCheckUtils]: 94: Hoare triple {11169#(= (+ (* 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)); {10840#true} is VALID [2022-04-28 11:16:02,376 INFO L290 TraceCheckUtils]: 93: Hoare triple {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} assume !false; {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:16:02,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {11191#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ 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; {11169#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-28 11:16:02,381 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #70#return; {11191#(= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0))} is VALID [2022-04-28 11:16:02,381 INFO L290 TraceCheckUtils]: 90: Hoare triple {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:02,382 INFO L290 TraceCheckUtils]: 89: Hoare triple {11205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:02,382 INFO L290 TraceCheckUtils]: 88: Hoare triple {10840#true} ~cond := #in~cond; {11205#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:02,382 INFO L272 TraceCheckUtils]: 87: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,382 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10840#true} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #68#return; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:16:02,382 INFO L290 TraceCheckUtils]: 85: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,383 INFO L290 TraceCheckUtils]: 84: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,383 INFO L290 TraceCheckUtils]: 83: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,383 INFO L272 TraceCheckUtils]: 82: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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)); {10840#true} is VALID [2022-04-28 11:16:02,383 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {10840#true} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #66#return; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:16:02,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,383 INFO L290 TraceCheckUtils]: 79: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,383 INFO L272 TraceCheckUtils]: 77: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,384 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {10840#true} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #64#return; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:16:02,384 INFO L290 TraceCheckUtils]: 75: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,384 INFO L290 TraceCheckUtils]: 73: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,384 INFO L272 TraceCheckUtils]: 72: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,384 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {10840#true} {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} #62#return; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:16:02,384 INFO L290 TraceCheckUtils]: 70: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,385 INFO L272 TraceCheckUtils]: 67: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} assume !false; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:16:02,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 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; {11195#(or (= (+ (* 3 (* main_~n~0 main_~n~0)) 7 (* main_~n~0 9)) (+ main_~z~0 main_~y~0)) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))))} is VALID [2022-04-28 11:16:02,397 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #70#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:16:02,398 INFO L290 TraceCheckUtils]: 63: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,398 INFO L272 TraceCheckUtils]: 60: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,398 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #68#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:16:02,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,398 INFO L272 TraceCheckUtils]: 55: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,399 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #66#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:16:02,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,399 INFO L272 TraceCheckUtils]: 50: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,399 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #64#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:16:02,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,400 INFO L272 TraceCheckUtils]: 45: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,400 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {10840#true} {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} #62#return; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:16:02,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,400 INFO L272 TraceCheckUtils]: 40: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} assume !false; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:16:02,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 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; {11275#(or (= (+ (* 3 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* main_~n~0 9) 16) (+ main_~y~0 6 (* main_~z~0 2))) (not (= (+ (* main_~z~0 18) (* main_~y~0 12) 36) (+ (* (+ main_~z~0 6) (+ main_~z~0 6)) 12))))} is VALID [2022-04-28 11:16:02,430 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #70#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:16:02,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,430 INFO L290 TraceCheckUtils]: 35: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,430 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,430 INFO L272 TraceCheckUtils]: 33: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,430 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #68#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:16:02,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,430 INFO L272 TraceCheckUtils]: 28: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,431 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #66#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:16:02,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,431 INFO L272 TraceCheckUtils]: 23: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,432 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #64#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:16:02,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,432 INFO L272 TraceCheckUtils]: 18: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,432 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10840#true} {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} #62#return; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:16:02,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,432 INFO L272 TraceCheckUtils]: 13: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} assume !false; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:16:02,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {10840#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {11357#(or (not (= (+ (* (+ main_~z~0 12) (+ main_~z~0 12)) 12) (+ (* main_~y~0 12) (* 30 main_~z~0) 144))) (= (+ (* 3 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* main_~n~0 9) 25) (+ main_~y~0 (* main_~z~0 3) 18)))} is VALID [2022-04-28 11:16:02,433 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10840#true} {10840#true} #60#return; {10840#true} is VALID [2022-04-28 11:16:02,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {10840#true} assume !(0 == ~cond); {10840#true} is VALID [2022-04-28 11:16:02,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {10840#true} ~cond := #in~cond; {10840#true} is VALID [2022-04-28 11:16:02,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {10840#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {10840#true} is VALID [2022-04-28 11:16:02,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {10840#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; {10840#true} is VALID [2022-04-28 11:16:02,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {10840#true} call #t~ret5 := main(); {10840#true} is VALID [2022-04-28 11:16:02,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10840#true} {10840#true} #84#return; {10840#true} is VALID [2022-04-28 11:16:02,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {10840#true} assume true; {10840#true} is VALID [2022-04-28 11:16:02,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {10840#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); {10840#true} is VALID [2022-04-28 11:16:02,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {10840#true} call ULTIMATE.init(); {10840#true} is VALID [2022-04-28 11:16:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 73 proven. 34 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-28 11:16:02,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:02,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408832332] [2022-04-28 11:16:02,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:02,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308686875] [2022-04-28 11:16:02,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308686875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:02,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:02,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-04-28 11:16:02,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:02,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [780693704] [2022-04-28 11:16:02,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [780693704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:02,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:02,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 11:16:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508885227] [2022-04-28 11:16:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:02,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:16:02,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:02,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:02,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:02,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 11:16:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 11:16:02,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:16:02,481 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:04,328 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2022-04-28 11:16:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:16:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 103 [2022-04-28 11:16:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 11:16:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-28 11:16:04,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-28 11:16:04,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:04,424 INFO L225 Difference]: With dead ends: 142 [2022-04-28 11:16:04,424 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 11:16:04,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:16:04,425 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:16:04,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 179 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 11:16:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 11:16:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-04-28 11:16:04,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:04,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:16:04,503 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:16:04,503 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:16:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:04,505 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:16:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:16:04,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:04,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:04,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 140 states. [2022-04-28 11:16:04,506 INFO L87 Difference]: Start difference. First operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 140 states. [2022-04-28 11:16:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:04,508 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2022-04-28 11:16:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2022-04-28 11:16:04,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:04,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:04,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:04,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 77 states have internal predecessors, (77), 34 states have call successors, (34), 22 states have call predecessors, (34), 21 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 11:16:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-04-28 11:16:04,512 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 103 [2022-04-28 11:16:04,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:04,512 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-04-28 11:16:04,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-04-28 11:16:04,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 142 transitions. [2022-04-28 11:16:04,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-04-28 11:16:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 11:16:04,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:04,711 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 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, 1, 1, 1, 1, 1, 1] [2022-04-28 11:16:04,727 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-28 11:16:04,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 11:16:04,927 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 3 times [2022-04-28 11:16:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:04,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [123869517] [2022-04-28 11:16:05,140 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:05,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1368175293, now seen corresponding path program 4 times [2022-04-28 11:16:05,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:05,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523643510] [2022-04-28 11:16:05,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:05,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:05,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2076372976] [2022-04-28 11:16:05,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:16:05,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:05,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:05,153 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-28 11:16:05,186 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-28 11:16:05,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:16:05,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:05,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 11:16:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:05,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:05,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {12302#true} call ULTIMATE.init(); {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {12302#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); {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12302#true} {12302#true} #84#return; {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {12302#true} call #t~ret5 := main(); {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {12302#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; {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {12302#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12302#true} {12302#true} #60#return; {12302#true} is VALID [2022-04-28 11:16:05,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {12302#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:05,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:05,781 INFO L272 TraceCheckUtils]: 13: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:16:05,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,782 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:05,782 INFO L272 TraceCheckUtils]: 18: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:16:05,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,783 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:05,783 INFO L272 TraceCheckUtils]: 23: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:16:05,783 INFO L290 TraceCheckUtils]: 24: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,783 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:05,783 INFO L272 TraceCheckUtils]: 28: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:16:05,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,784 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:05,784 INFO L272 TraceCheckUtils]: 33: Hoare triple {12340#(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)); {12302#true} is VALID [2022-04-28 11:16:05,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,785 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12302#true} {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {12340#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:05,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {12340#(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; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:05,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} assume !false; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:05,785 INFO L272 TraceCheckUtils]: 40: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,786 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #62#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:05,786 INFO L272 TraceCheckUtils]: 45: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,787 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #64#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:05,787 INFO L272 TraceCheckUtils]: 50: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,788 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #66#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:05,788 INFO L272 TraceCheckUtils]: 55: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 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)); {12302#true} is VALID [2022-04-28 11:16:05,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,788 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #68#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:05,788 INFO L272 TraceCheckUtils]: 60: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 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)); {12302#true} is VALID [2022-04-28 11:16:05,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,789 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12302#true} {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} #70#return; {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0))} is VALID [2022-04-28 11:16:05,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {12422#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 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; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} assume !false; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,790 INFO L272 TraceCheckUtils]: 67: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,790 INFO L290 TraceCheckUtils]: 69: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,791 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #62#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,791 INFO L272 TraceCheckUtils]: 72: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,791 INFO L290 TraceCheckUtils]: 74: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,791 INFO L290 TraceCheckUtils]: 75: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,791 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #64#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,791 INFO L272 TraceCheckUtils]: 77: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,791 INFO L290 TraceCheckUtils]: 78: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,791 INFO L290 TraceCheckUtils]: 79: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,792 INFO L290 TraceCheckUtils]: 80: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,792 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #66#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,792 INFO L272 TraceCheckUtils]: 82: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 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)); {12302#true} is VALID [2022-04-28 11:16:05,792 INFO L290 TraceCheckUtils]: 83: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,792 INFO L290 TraceCheckUtils]: 84: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,792 INFO L290 TraceCheckUtils]: 85: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,793 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #68#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,793 INFO L272 TraceCheckUtils]: 87: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,793 INFO L290 TraceCheckUtils]: 88: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,793 INFO L290 TraceCheckUtils]: 89: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,793 INFO L290 TraceCheckUtils]: 90: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,794 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {12302#true} {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} #70#return; {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,794 INFO L290 TraceCheckUtils]: 92: Hoare triple {12504#(and (<= main_~n~0 2) (= main_~z~0 18) (<= 1 main_~a~0) (= 19 main_~y~0))} assume !(~n~0 <= ~a~0); {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,794 INFO L272 TraceCheckUtils]: 93: Hoare triple {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,794 INFO L290 TraceCheckUtils]: 94: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,794 INFO L290 TraceCheckUtils]: 95: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,794 INFO L290 TraceCheckUtils]: 96: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,795 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {12302#true} {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} #72#return; {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,795 INFO L272 TraceCheckUtils]: 98: Hoare triple {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {12302#true} is VALID [2022-04-28 11:16:05,795 INFO L290 TraceCheckUtils]: 99: Hoare triple {12302#true} ~cond := #in~cond; {12302#true} is VALID [2022-04-28 11:16:05,795 INFO L290 TraceCheckUtils]: 100: Hoare triple {12302#true} assume !(0 == ~cond); {12302#true} is VALID [2022-04-28 11:16:05,795 INFO L290 TraceCheckUtils]: 101: Hoare triple {12302#true} assume true; {12302#true} is VALID [2022-04-28 11:16:05,796 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {12302#true} {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} #74#return; {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} is VALID [2022-04-28 11:16:05,796 INFO L272 TraceCheckUtils]: 103: Hoare triple {12586#(and (= main_~z~0 18) (<= 1 main_~a~0) (< main_~a~0 2) (= 19 main_~y~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {12620#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:05,796 INFO L290 TraceCheckUtils]: 104: Hoare triple {12620#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12624#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:05,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {12624#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12303#false} is VALID [2022-04-28 11:16:05,797 INFO L290 TraceCheckUtils]: 106: Hoare triple {12303#false} assume !false; {12303#false} is VALID [2022-04-28 11:16:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:16:05,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:13,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523643510] [2022-04-28 11:16:13,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:13,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076372976] [2022-04-28 11:16:13,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076372976] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:16:13,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:16:13,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-28 11:16:13,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:13,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [123869517] [2022-04-28 11:16:13,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [123869517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:13,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:13,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:16:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846001338] [2022-04-28 11:16:13,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:13,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:16:13,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:13,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:13,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:13,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:16:13,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:13,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:16:13,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-28 11:16:13,320 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:14,003 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-04-28 11:16:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:16:14,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 107 [2022-04-28 11:16:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:16:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-28 11:16:14,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-28 11:16:14,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:14,080 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:16:14,080 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 11:16:14,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:16:14,080 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:16:14,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 234 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 11:16:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 11:16:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-28 11:16:14,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:14,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:16:14,150 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:16:14,151 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:16:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:14,152 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:16:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:16:14,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:14,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:14,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 123 states. [2022-04-28 11:16:14,153 INFO L87 Difference]: Start difference. First operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 123 states. [2022-04-28 11:16:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:14,155 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-04-28 11:16:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:16:14,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:14,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:14,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:14,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 31 states have call successors, (31), 21 states have call predecessors, (31), 20 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-28 11:16:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-04-28 11:16:14,169 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 107 [2022-04-28 11:16:14,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:14,169 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-04-28 11:16:14,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:14,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 133 transitions. [2022-04-28 11:16:14,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-04-28 11:16:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-28 11:16:14,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:14,326 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:16:14,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 11:16:14,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:14,526 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:14,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 15 times [2022-04-28 11:16:14,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:14,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [294353660] [2022-04-28 11:16:14,767 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:14,768 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1388085622, now seen corresponding path program 16 times [2022-04-28 11:16:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:14,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451156922] [2022-04-28 11:16:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:14,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:14,775 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:14,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802677312] [2022-04-28 11:16:14,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:16:14,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:14,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:14,780 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-28 11:16:14,781 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-28 11:16:14,827 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:16:14,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:14,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 11:16:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:14,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:15,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {13530#true} call ULTIMATE.init(); {13530#true} is VALID [2022-04-28 11:16:15,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {13530#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); {13530#true} is VALID [2022-04-28 11:16:15,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13530#true} {13530#true} #84#return; {13530#true} is VALID [2022-04-28 11:16:15,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {13530#true} call #t~ret5 := main(); {13530#true} is VALID [2022-04-28 11:16:15,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {13530#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; {13530#true} is VALID [2022-04-28 11:16:15,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {13530#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13530#true} {13530#true} #60#return; {13530#true} is VALID [2022-04-28 11:16:15,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {13530#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:15,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:15,294 INFO L272 TraceCheckUtils]: 13: Hoare triple {13568#(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)); {13530#true} is VALID [2022-04-28 11:16:15,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,295 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13530#true} {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:15,295 INFO L272 TraceCheckUtils]: 18: Hoare triple {13568#(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)); {13530#true} is VALID [2022-04-28 11:16:15,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,296 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13530#true} {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:15,296 INFO L272 TraceCheckUtils]: 23: Hoare triple {13568#(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)); {13530#true} is VALID [2022-04-28 11:16:15,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,297 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13530#true} {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:15,297 INFO L272 TraceCheckUtils]: 28: Hoare triple {13568#(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)); {13530#true} is VALID [2022-04-28 11:16:15,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,297 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13530#true} {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:15,297 INFO L272 TraceCheckUtils]: 33: Hoare triple {13568#(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)); {13530#true} is VALID [2022-04-28 11:16:15,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,298 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13530#true} {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {13568#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:16:15,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {13568#(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; {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:16:15,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:16:15,299 INFO L272 TraceCheckUtils]: 40: Hoare triple {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,300 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13530#true} {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #62#return; {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:16:15,300 INFO L272 TraceCheckUtils]: 45: Hoare triple {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,300 INFO L290 TraceCheckUtils]: 46: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,300 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13530#true} {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #64#return; {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:16:15,300 INFO L272 TraceCheckUtils]: 50: Hoare triple {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,301 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13530#true} {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #66#return; {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:16:15,301 INFO L272 TraceCheckUtils]: 55: Hoare triple {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) 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)); {13530#true} is VALID [2022-04-28 11:16:15,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,301 INFO L290 TraceCheckUtils]: 58: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,302 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13530#true} {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #68#return; {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:16:15,302 INFO L272 TraceCheckUtils]: 60: Hoare triple {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,302 INFO L290 TraceCheckUtils]: 61: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,302 INFO L290 TraceCheckUtils]: 62: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,302 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13530#true} {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #70#return; {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:16:15,303 INFO L290 TraceCheckUtils]: 65: Hoare triple {13650#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) 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; {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:15,303 INFO L290 TraceCheckUtils]: 66: Hoare triple {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} assume !false; {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:15,303 INFO L272 TraceCheckUtils]: 67: Hoare triple {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,303 INFO L290 TraceCheckUtils]: 68: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,303 INFO L290 TraceCheckUtils]: 69: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,303 INFO L290 TraceCheckUtils]: 70: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,304 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13530#true} {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #62#return; {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:15,304 INFO L272 TraceCheckUtils]: 72: Hoare triple {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,304 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13530#true} {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #64#return; {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:15,304 INFO L272 TraceCheckUtils]: 77: Hoare triple {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,305 INFO L290 TraceCheckUtils]: 78: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,305 INFO L290 TraceCheckUtils]: 79: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,305 INFO L290 TraceCheckUtils]: 80: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,305 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13530#true} {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #66#return; {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:15,305 INFO L272 TraceCheckUtils]: 82: Hoare triple {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~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)); {13530#true} is VALID [2022-04-28 11:16:15,305 INFO L290 TraceCheckUtils]: 83: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,305 INFO L290 TraceCheckUtils]: 84: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,305 INFO L290 TraceCheckUtils]: 85: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,306 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13530#true} {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #68#return; {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:15,306 INFO L272 TraceCheckUtils]: 87: Hoare triple {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,306 INFO L290 TraceCheckUtils]: 88: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,306 INFO L290 TraceCheckUtils]: 89: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,306 INFO L290 TraceCheckUtils]: 90: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,306 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13530#true} {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} #70#return; {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~0 8))} is VALID [2022-04-28 11:16:15,307 INFO L290 TraceCheckUtils]: 92: Hoare triple {13732#(and (= main_~n~0 2) (= 19 main_~y~0) (= main_~x~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; {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:16:15,307 INFO L290 TraceCheckUtils]: 93: Hoare triple {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} assume !false; {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:16:15,307 INFO L272 TraceCheckUtils]: 94: Hoare triple {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,307 INFO L290 TraceCheckUtils]: 95: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,308 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13530#true} {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} #62#return; {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:16:15,308 INFO L272 TraceCheckUtils]: 99: Hoare triple {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,308 INFO L290 TraceCheckUtils]: 100: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,308 INFO L290 TraceCheckUtils]: 101: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,308 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13530#true} {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} #64#return; {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} is VALID [2022-04-28 11:16:15,309 INFO L272 TraceCheckUtils]: 104: Hoare triple {13814#(and (= 2 (+ (- 1) main_~n~0)) (= (+ main_~x~0 (- 19)) 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13851#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:15,309 INFO L290 TraceCheckUtils]: 105: Hoare triple {13851#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13855#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:15,310 INFO L290 TraceCheckUtils]: 106: Hoare triple {13855#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13531#false} is VALID [2022-04-28 11:16:15,310 INFO L290 TraceCheckUtils]: 107: Hoare triple {13531#false} assume !false; {13531#false} is VALID [2022-04-28 11:16:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 34 proven. 33 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:16:15,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:15,649 INFO L290 TraceCheckUtils]: 107: Hoare triple {13531#false} assume !false; {13531#false} is VALID [2022-04-28 11:16:15,649 INFO L290 TraceCheckUtils]: 106: Hoare triple {13855#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13531#false} is VALID [2022-04-28 11:16:15,650 INFO L290 TraceCheckUtils]: 105: Hoare triple {13851#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13855#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:15,650 INFO L272 TraceCheckUtils]: 104: Hoare triple {13871#(= (* 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)); {13851#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:15,651 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {13530#true} {13871#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {13871#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:16:15,651 INFO L290 TraceCheckUtils]: 102: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,651 INFO L290 TraceCheckUtils]: 101: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,651 INFO L290 TraceCheckUtils]: 100: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,651 INFO L272 TraceCheckUtils]: 99: Hoare triple {13871#(= (* 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)); {13530#true} is VALID [2022-04-28 11:16:15,651 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {13530#true} {13871#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {13871#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:16:15,651 INFO L290 TraceCheckUtils]: 97: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,651 INFO L290 TraceCheckUtils]: 96: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,651 INFO L290 TraceCheckUtils]: 95: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,651 INFO L272 TraceCheckUtils]: 94: Hoare triple {13871#(= (* 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)); {13530#true} is VALID [2022-04-28 11:16:15,652 INFO L290 TraceCheckUtils]: 93: Hoare triple {13871#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {13871#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:16:15,654 INFO L290 TraceCheckUtils]: 92: Hoare triple {13908#(= (* (+ 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; {13871#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:16:15,654 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {13530#true} {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:15,654 INFO L290 TraceCheckUtils]: 90: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,654 INFO L290 TraceCheckUtils]: 89: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,654 INFO L290 TraceCheckUtils]: 88: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,654 INFO L272 TraceCheckUtils]: 87: Hoare triple {13908#(= (* (+ 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)); {13530#true} is VALID [2022-04-28 11:16:15,655 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13530#true} {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:15,655 INFO L290 TraceCheckUtils]: 85: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,655 INFO L290 TraceCheckUtils]: 84: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,655 INFO L290 TraceCheckUtils]: 83: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,655 INFO L272 TraceCheckUtils]: 82: Hoare triple {13908#(= (* (+ 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)); {13530#true} is VALID [2022-04-28 11:16:15,655 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {13530#true} {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:15,655 INFO L290 TraceCheckUtils]: 80: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,656 INFO L290 TraceCheckUtils]: 79: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,656 INFO L290 TraceCheckUtils]: 78: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,656 INFO L272 TraceCheckUtils]: 77: Hoare triple {13908#(= (* (+ 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)); {13530#true} is VALID [2022-04-28 11:16:15,656 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {13530#true} {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:15,656 INFO L290 TraceCheckUtils]: 75: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,656 INFO L290 TraceCheckUtils]: 74: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,656 INFO L290 TraceCheckUtils]: 73: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,656 INFO L272 TraceCheckUtils]: 72: Hoare triple {13908#(= (* (+ 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)); {13530#true} is VALID [2022-04-28 11:16:15,657 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13530#true} {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:15,657 INFO L290 TraceCheckUtils]: 70: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,657 INFO L290 TraceCheckUtils]: 69: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,657 INFO L290 TraceCheckUtils]: 68: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,657 INFO L272 TraceCheckUtils]: 67: Hoare triple {13908#(= (* (+ 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)); {13530#true} is VALID [2022-04-28 11:16:15,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:15,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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; {13908#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:16:15,660 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13530#true} {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:16:15,660 INFO L290 TraceCheckUtils]: 63: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,660 INFO L272 TraceCheckUtils]: 60: Hoare triple {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,660 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13530#true} {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:16:15,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,661 INFO L272 TraceCheckUtils]: 55: Hoare triple {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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)); {13530#true} is VALID [2022-04-28 11:16:15,661 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13530#true} {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:16:15,661 INFO L290 TraceCheckUtils]: 53: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,661 INFO L272 TraceCheckUtils]: 50: Hoare triple {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,662 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {13530#true} {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:16:15,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,662 INFO L272 TraceCheckUtils]: 45: Hoare triple {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,662 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {13530#true} {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:16:15,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,663 INFO L272 TraceCheckUtils]: 40: Hoare triple {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:16:15,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~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; {13990#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:16:15,666 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13530#true} {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #70#return; {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:16:15,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,666 INFO L272 TraceCheckUtils]: 33: Hoare triple {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,667 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13530#true} {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #68#return; {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:16:15,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,667 INFO L272 TraceCheckUtils]: 28: Hoare triple {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~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)); {13530#true} is VALID [2022-04-28 11:16:15,668 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13530#true} {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #66#return; {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:16:15,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,668 INFO L272 TraceCheckUtils]: 23: Hoare triple {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,668 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13530#true} {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #64#return; {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:16:15,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,668 INFO L272 TraceCheckUtils]: 18: Hoare triple {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,669 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13530#true} {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #62#return; {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:16:15,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,669 INFO L272 TraceCheckUtils]: 13: Hoare triple {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} assume !false; {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:16:15,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {13530#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14072#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:16:15,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13530#true} {13530#true} #60#return; {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {13530#true} assume !(0 == ~cond); {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {13530#true} ~cond := #in~cond; {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {13530#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {13530#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; {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {13530#true} call #t~ret5 := main(); {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13530#true} {13530#true} #84#return; {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {13530#true} assume true; {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {13530#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); {13530#true} is VALID [2022-04-28 11:16:15,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {13530#true} call ULTIMATE.init(); {13530#true} is VALID [2022-04-28 11:16:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 34 proven. 33 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-28 11:16:15,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:15,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451156922] [2022-04-28 11:16:15,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:15,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802677312] [2022-04-28 11:16:15,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802677312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:15,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:15,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-28 11:16:15,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:15,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [294353660] [2022-04-28 11:16:15,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [294353660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:15,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:15,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 11:16:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120895565] [2022-04-28 11:16:15,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:15,672 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 108 [2022-04-28 11:16:15,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:15,672 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:15,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:15,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 11:16:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:15,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 11:16:15,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 11:16:15,721 INFO L87 Difference]: Start difference. First operand 123 states and 133 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:17,102 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2022-04-28 11:16:17,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 11:16:17,102 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 108 [2022-04-28 11:16:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:16:17,103 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-04-28 11:16:17,104 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2022-04-28 11:16:17,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 106 transitions. [2022-04-28 11:16:17,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:17,221 INFO L225 Difference]: With dead ends: 139 [2022-04-28 11:16:17,221 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 11:16:17,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 11:16:17,222 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 11:16:17,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 259 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 11:16:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 11:16:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2022-04-28 11:16:17,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:16:17,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:16:17,308 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:16:17,308 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:16:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:17,313 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:16:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:16:17,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:17,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:17,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 137 states. [2022-04-28 11:16:17,314 INFO L87 Difference]: Start difference. First operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 137 states. [2022-04-28 11:16:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:16:17,316 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-04-28 11:16:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2022-04-28 11:16:17,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:16:17,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:16:17,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:16:17,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:16:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 74 states have (on average 1.027027027027027) internal successors, (76), 76 states have internal predecessors, (76), 32 states have call successors, (32), 22 states have call predecessors, (32), 21 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:16:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-04-28 11:16:17,318 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 108 [2022-04-28 11:16:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:16:17,318 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-04-28 11:16:17,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-28 11:16:17,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 138 transitions. [2022-04-28 11:16:17,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-04-28 11:16:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 11:16:17,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:16:17,466 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:16:17,482 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-28 11:16:17,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 11:16:17,679 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:16:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:16:17,680 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 17 times [2022-04-28 11:16:17,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:17,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338822390] [2022-04-28 11:16:17,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:16:17,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:16:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash 34642523, now seen corresponding path program 18 times [2022-04-28 11:16:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:16:17,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683370857] [2022-04-28 11:16:17,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:16:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:16:17,872 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:16:17,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512481985] [2022-04-28 11:16:17,872 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:16:17,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:16:17,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:16:17,873 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-28 11:16:17,876 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-28 11:16:18,553 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:16:18,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:16:18,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 11:16:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:16:18,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:16:28,967 WARN L833 $PredicateComparison]: unable to prove that (or (and (exists ((aux_div_v_main_~z~0_BEFORE_CALL_264_35 Int)) (not (let ((.cse1 (* 3 aux_div_v_main_~z~0_BEFORE_CALL_264_35 aux_div_v_main_~z~0_BEFORE_CALL_264_35))) (= (+ (* (- 36) aux_div_v_main_~z~0_BEFORE_CALL_264_35) (* 18 (let ((.cse0 (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (- 6)) 6))) (* .cse0 .cse0 .cse0))) (* .cse1 12) 18) (+ (* 12 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (* (* (+ .cse1 (* (- 3) aux_div_v_main_~z~0_BEFORE_CALL_264_35) 1) aux_div_v_main_~z~0_BEFORE_CALL_264_35) 6)))))) (<= 0 |c___VERIFIER_assert_#in~cond|)) (<= 1 |c___VERIFIER_assert_#in~cond|)) is different from false [2022-04-28 11:16:36,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {14999#true} call ULTIMATE.init(); {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {14999#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); {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14999#true} {14999#true} #84#return; {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {14999#true} call #t~ret5 := main(); {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {14999#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; {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {14999#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14999#true} {14999#true} #60#return; {14999#true} is VALID [2022-04-28 11:16:36,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {14999#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {14999#true} assume !false; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L272 TraceCheckUtils]: 13: Hoare triple {14999#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14999#true} {14999#true} #62#return; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L272 TraceCheckUtils]: 18: Hoare triple {14999#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14999#true} {14999#true} #64#return; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L272 TraceCheckUtils]: 23: Hoare triple {14999#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14999#true} {14999#true} #66#return; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L272 TraceCheckUtils]: 28: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14999#true} {14999#true} #68#return; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L272 TraceCheckUtils]: 33: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14999#true} {14999#true} #70#return; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {14999#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; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {14999#true} assume !false; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L272 TraceCheckUtils]: 40: Hoare triple {14999#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 41: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14999#true} {14999#true} #62#return; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L272 TraceCheckUtils]: 45: Hoare triple {14999#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14999#true} {14999#true} #64#return; {14999#true} is VALID [2022-04-28 11:16:36,559 INFO L272 TraceCheckUtils]: 50: Hoare triple {14999#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14999#true} {14999#true} #66#return; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L272 TraceCheckUtils]: 55: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 56: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 57: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 58: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14999#true} {14999#true} #68#return; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L272 TraceCheckUtils]: 60: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 61: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 62: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14999#true} {14999#true} #70#return; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {14999#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; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 66: Hoare triple {14999#true} assume !false; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L272 TraceCheckUtils]: 67: Hoare triple {14999#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 68: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 69: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,560 INFO L290 TraceCheckUtils]: 70: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14999#true} {14999#true} #62#return; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L272 TraceCheckUtils]: 72: Hoare triple {14999#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L290 TraceCheckUtils]: 73: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L290 TraceCheckUtils]: 74: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L290 TraceCheckUtils]: 75: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14999#true} {14999#true} #64#return; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L272 TraceCheckUtils]: 77: Hoare triple {14999#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L290 TraceCheckUtils]: 80: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14999#true} {14999#true} #66#return; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L272 TraceCheckUtils]: 82: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L290 TraceCheckUtils]: 83: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L290 TraceCheckUtils]: 85: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14999#true} {14999#true} #68#return; {14999#true} is VALID [2022-04-28 11:16:36,561 INFO L272 TraceCheckUtils]: 87: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,562 INFO L290 TraceCheckUtils]: 88: Hoare triple {14999#true} ~cond := #in~cond; {15268#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:36,562 INFO L290 TraceCheckUtils]: 89: Hoare triple {15268#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:36,562 INFO L290 TraceCheckUtils]: 90: Hoare triple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:36,563 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} {14999#true} #70#return; {15279#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:16:36,564 INFO L290 TraceCheckUtils]: 92: Hoare triple {15279#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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; {15279#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:16:36,565 INFO L290 TraceCheckUtils]: 93: Hoare triple {15279#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} assume !false; {15279#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:16:36,565 INFO L272 TraceCheckUtils]: 94: Hoare triple {15279#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,565 INFO L290 TraceCheckUtils]: 95: Hoare triple {14999#true} ~cond := #in~cond; {15268#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:36,565 INFO L290 TraceCheckUtils]: 96: Hoare triple {15268#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:36,566 INFO L290 TraceCheckUtils]: 97: Hoare triple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:36,566 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} {15279#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} #62#return; {15301#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:16:36,566 INFO L272 TraceCheckUtils]: 99: Hoare triple {15301#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* 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)); {14999#true} is VALID [2022-04-28 11:16:36,566 INFO L290 TraceCheckUtils]: 100: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:36,566 INFO L290 TraceCheckUtils]: 101: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:36,566 INFO L290 TraceCheckUtils]: 102: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:36,567 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14999#true} {15301#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} #64#return; {15301#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} is VALID [2022-04-28 11:16:36,567 INFO L272 TraceCheckUtils]: 104: Hoare triple {15301#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:36,567 INFO L290 TraceCheckUtils]: 105: Hoare triple {14999#true} ~cond := #in~cond; {15268#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:36,567 INFO L290 TraceCheckUtils]: 106: Hoare triple {15268#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:36,568 INFO L290 TraceCheckUtils]: 107: Hoare triple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:38,569 WARN L284 TraceCheckUtils]: 108: Hoare quadruple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} {15301#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0))} #66#return; {15332#(and (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} is UNKNOWN [2022-04-28 11:16:38,865 INFO L272 TraceCheckUtils]: 109: Hoare triple {15332#(and (= main_~x~0 (* (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6) (div (+ main_~z~0 (- 6)) 6))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {15336#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~z~0_BEFORE_CALL_264_35 Int)) (not (= (+ (* (- 36) aux_div_v_main_~z~0_BEFORE_CALL_264_35) (* 18 (* (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (- 6)) 6) (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (- 6)) 6) (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (- 6)) 6))) (* (* 3 aux_div_v_main_~z~0_BEFORE_CALL_264_35 aux_div_v_main_~z~0_BEFORE_CALL_264_35) 12) 18) (+ (* 12 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (* (* (+ (* 3 aux_div_v_main_~z~0_BEFORE_CALL_264_35 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (* (- 3) aux_div_v_main_~z~0_BEFORE_CALL_264_35) 1) aux_div_v_main_~z~0_BEFORE_CALL_264_35) 6)))))) (<= 1 |__VERIFIER_assert_#in~cond|))} is VALID [2022-04-28 11:16:40,866 WARN L290 TraceCheckUtils]: 110: Hoare triple {15336#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~z~0_BEFORE_CALL_264_35 Int)) (not (= (+ (* (- 36) aux_div_v_main_~z~0_BEFORE_CALL_264_35) (* 18 (* (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (- 6)) 6) (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (- 6)) 6) (div (+ (* 6 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (- 6)) 6))) (* (* 3 aux_div_v_main_~z~0_BEFORE_CALL_264_35 aux_div_v_main_~z~0_BEFORE_CALL_264_35) 12) 18) (+ (* 12 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (* (* (+ (* 3 aux_div_v_main_~z~0_BEFORE_CALL_264_35 aux_div_v_main_~z~0_BEFORE_CALL_264_35) (* (- 3) aux_div_v_main_~z~0_BEFORE_CALL_264_35) 1) aux_div_v_main_~z~0_BEFORE_CALL_264_35) 6)))))) (<= 1 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {15340#(<= 1 __VERIFIER_assert_~cond)} is UNKNOWN [2022-04-28 11:16:40,867 INFO L290 TraceCheckUtils]: 111: Hoare triple {15340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15000#false} is VALID [2022-04-28 11:16:40,867 INFO L290 TraceCheckUtils]: 112: Hoare triple {15000#false} assume !false; {15000#false} is VALID [2022-04-28 11:16:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 179 proven. 9 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 11:16:40,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:16:45,671 INFO L290 TraceCheckUtils]: 112: Hoare triple {15000#false} assume !false; {15000#false} is VALID [2022-04-28 11:16:45,672 INFO L290 TraceCheckUtils]: 111: Hoare triple {15340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15000#false} is VALID [2022-04-28 11:16:45,672 INFO L290 TraceCheckUtils]: 110: Hoare triple {15353#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15340#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:16:45,672 INFO L272 TraceCheckUtils]: 109: Hoare triple {15357#(= (+ (* 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)); {15353#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:16:45,673 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} {15361#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #66#return; {15357#(= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0)))} is VALID [2022-04-28 11:16:45,673 INFO L290 TraceCheckUtils]: 107: Hoare triple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:45,674 INFO L290 TraceCheckUtils]: 106: Hoare triple {15371#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:45,674 INFO L290 TraceCheckUtils]: 105: Hoare triple {14999#true} ~cond := #in~cond; {15371#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:45,674 INFO L272 TraceCheckUtils]: 104: Hoare triple {15361#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* 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)); {14999#true} is VALID [2022-04-28 11:16:45,674 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {14999#true} {15361#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #64#return; {15361#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:16:45,674 INFO L290 TraceCheckUtils]: 102: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:45,675 INFO L290 TraceCheckUtils]: 101: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:45,675 INFO L290 TraceCheckUtils]: 100: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:45,675 INFO L272 TraceCheckUtils]: 99: Hoare triple {15361#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* 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)); {14999#true} is VALID [2022-04-28 11:16:45,675 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} {15393#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} #62#return; {15361#(or (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:16:45,676 INFO L290 TraceCheckUtils]: 97: Hoare triple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:45,676 INFO L290 TraceCheckUtils]: 96: Hoare triple {15371#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:45,676 INFO L290 TraceCheckUtils]: 95: Hoare triple {14999#true} ~cond := #in~cond; {15371#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:45,676 INFO L272 TraceCheckUtils]: 94: Hoare triple {15393#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* 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)); {14999#true} is VALID [2022-04-28 11:16:45,677 INFO L290 TraceCheckUtils]: 93: Hoare triple {15393#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} assume !false; {15393#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is VALID [2022-04-28 11:16:47,678 WARN L290 TraceCheckUtils]: 92: Hoare triple {15412#(or (= (+ (* (* main_~n~0 main_~n~0 main_~n~0) 18) (* (* main_~n~0 main_~n~0) 54) (* 42 main_~n~0)) (+ (* 6 (* main_~n~0 main_~z~0)) (* (* main_~n~0 main_~y~0) 6))) (not (= (+ (* main_~n~0 6) 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; {15393#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))))} is UNKNOWN [2022-04-28 11:16:47,690 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} {14999#true} #70#return; {15412#(or (= (+ (* (* main_~n~0 main_~n~0 main_~n~0) 18) (* (* main_~n~0 main_~n~0) 54) (* 42 main_~n~0)) (+ (* 6 (* main_~n~0 main_~z~0)) (* (* main_~n~0 main_~y~0) 6))) (not (= (+ (* main_~n~0 6) 6) main_~z~0)))} is VALID [2022-04-28 11:16:47,691 INFO L290 TraceCheckUtils]: 90: Hoare triple {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:47,691 INFO L290 TraceCheckUtils]: 89: Hoare triple {15371#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {15272#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:16:47,691 INFO L290 TraceCheckUtils]: 88: Hoare triple {14999#true} ~cond := #in~cond; {15371#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:16:47,691 INFO L272 TraceCheckUtils]: 87: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,691 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14999#true} {14999#true} #68#return; {14999#true} is VALID [2022-04-28 11:16:47,691 INFO L290 TraceCheckUtils]: 85: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,691 INFO L290 TraceCheckUtils]: 84: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,691 INFO L290 TraceCheckUtils]: 83: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L272 TraceCheckUtils]: 82: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14999#true} {14999#true} #66#return; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 80: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 79: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 78: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L272 TraceCheckUtils]: 77: Hoare triple {14999#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {14999#true} {14999#true} #64#return; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 75: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 74: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 73: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L272 TraceCheckUtils]: 72: Hoare triple {14999#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14999#true} {14999#true} #62#return; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 70: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 69: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 68: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L272 TraceCheckUtils]: 67: Hoare triple {14999#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 66: Hoare triple {14999#true} assume !false; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 65: Hoare triple {14999#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; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14999#true} {14999#true} #70#return; {14999#true} is VALID [2022-04-28 11:16:47,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L272 TraceCheckUtils]: 60: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14999#true} {14999#true} #68#return; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L272 TraceCheckUtils]: 55: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14999#true} {14999#true} #66#return; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 53: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 52: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 51: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L272 TraceCheckUtils]: 50: Hoare triple {14999#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {14999#true} {14999#true} #64#return; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L272 TraceCheckUtils]: 45: Hoare triple {14999#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {14999#true} {14999#true} #62#return; {14999#true} is VALID [2022-04-28 11:16:47,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 41: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L272 TraceCheckUtils]: 40: Hoare triple {14999#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {14999#true} assume !false; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {14999#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; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14999#true} {14999#true} #70#return; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L272 TraceCheckUtils]: 33: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14999#true} {14999#true} #68#return; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 29: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L272 TraceCheckUtils]: 28: Hoare triple {14999#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14999#true} {14999#true} #66#return; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,694 INFO L272 TraceCheckUtils]: 23: Hoare triple {14999#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {14999#true} {14999#true} #64#return; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L272 TraceCheckUtils]: 18: Hoare triple {14999#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {14999#true} {14999#true} #62#return; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L272 TraceCheckUtils]: 13: Hoare triple {14999#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {14999#true} assume !false; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {14999#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14999#true} {14999#true} #60#return; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {14999#true} assume !(0 == ~cond); {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {14999#true} ~cond := #in~cond; {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {14999#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {14999#true} is VALID [2022-04-28 11:16:47,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {14999#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; {14999#true} is VALID [2022-04-28 11:16:47,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {14999#true} call #t~ret5 := main(); {14999#true} is VALID [2022-04-28 11:16:47,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14999#true} {14999#true} #84#return; {14999#true} is VALID [2022-04-28 11:16:47,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {14999#true} assume true; {14999#true} is VALID [2022-04-28 11:16:47,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {14999#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); {14999#true} is VALID [2022-04-28 11:16:47,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {14999#true} call ULTIMATE.init(); {14999#true} is VALID [2022-04-28 11:16:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 179 proven. 9 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2022-04-28 11:16:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:16:47,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683370857] [2022-04-28 11:16:47,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:16:47,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512481985] [2022-04-28 11:16:47,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512481985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:16:47,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:16:47,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2022-04-28 11:16:47,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:16:47,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338822390] [2022-04-28 11:16:47,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338822390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:16:47,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:16:47,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:16:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378095516] [2022-04-28 11:16:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:16:47,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-04-28 11:16:47,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:16:47,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:16:52,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:16:52,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:16:52,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:16:52,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:16:52,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=140, Unknown=3, NotChecked=24, Total=210 [2022-04-28 11:16:52,336 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:16:56,652 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-28 11:16:58,653 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-28 11:17:00,657 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-28 11:17:02,659 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-28 11:17:06,027 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-28 11:17:08,032 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-28 11:17:14,858 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-28 11:17:19,209 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-28 11:17:21,210 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-28 11:17:23,213 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-28 11:17:25,216 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-28 11:17:29,292 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-28 11:17:31,295 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-28 11:17:33,297 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-28 11:17:36,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:17:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:36,585 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-04-28 11:17:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:17:36,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-04-28 11:17:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:17:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:17:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 11:17:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:17:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-28 11:17:36,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-28 11:17:40,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:40,862 INFO L225 Difference]: With dead ends: 136 [2022-04-28 11:17:40,862 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 11:17:40,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=65, Invalid=208, Unknown=3, NotChecked=30, Total=306 [2022-04-28 11:17:40,862 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 32 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:17:40,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 114 Invalid, 14 Unknown, 38 Unchecked, 30.7s Time] [2022-04-28 11:17:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 11:17:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-04-28 11:17:40,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:17:40,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:17:40,940 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:17:40,941 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:17:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:40,942 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-04-28 11:17:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-04-28 11:17:40,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:40,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:40,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 134 states. [2022-04-28 11:17:40,943 INFO L87 Difference]: Start difference. First operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 134 states. [2022-04-28 11:17:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:17:40,945 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-04-28 11:17:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-04-28 11:17:40,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:17:40,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:17:40,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:17:40,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:17:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 80 states have internal predecessors, (81), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:17:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2022-04-28 11:17:40,948 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 113 [2022-04-28 11:17:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:17:40,948 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2022-04-28 11:17:40,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-28 11:17:40,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 143 transitions. [2022-04-28 11:17:45,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 141 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:17:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-04-28 11:17:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 11:17:45,152 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:17:45,153 INFO L195 NwaCegarLoop]: trace histogram [22, 21, 21, 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, 1, 1, 1, 1] [2022-04-28 11:17:45,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 11:17:45,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 11:17:45,353 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:17:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:17:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 5 times [2022-04-28 11:17:45,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:45,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939471636] [2022-04-28 11:17:45,593 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:17:45,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:17:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2063139367, now seen corresponding path program 6 times [2022-04-28 11:17:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:17:45,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790307985] [2022-04-28 11:17:45,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:17:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:17:45,601 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:17:45,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570852076] [2022-04-28 11:17:45,602 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:17:45,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:17:45,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:17:45,611 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-28 11:17:45,612 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-28 11:17:46,012 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 11:17:46,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:17:46,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 11:17:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:17:46,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:17:49,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {16507#true} call ULTIMATE.init(); {16507#true} is VALID [2022-04-28 11:17:49,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {16507#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); {16507#true} is VALID [2022-04-28 11:17:49,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16507#true} {16507#true} #84#return; {16507#true} is VALID [2022-04-28 11:17:49,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {16507#true} call #t~ret5 := main(); {16507#true} is VALID [2022-04-28 11:17:49,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {16507#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; {16507#true} is VALID [2022-04-28 11:17:49,544 INFO L272 TraceCheckUtils]: 6: Hoare triple {16507#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {16507#true} ~cond := #in~cond; {16533#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:17:49,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {16533#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {16537#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:17:49,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {16537#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {16537#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:17:49,545 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16537#(not (= |assume_abort_if_not_#in~cond| 0))} {16507#true} #60#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,546 INFO L272 TraceCheckUtils]: 13: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,547 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,547 INFO L272 TraceCheckUtils]: 18: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,547 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,547 INFO L272 TraceCheckUtils]: 23: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,548 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,548 INFO L272 TraceCheckUtils]: 28: Hoare triple {16544#(and (<= main_~a~0 100) (<= 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)); {16507#true} is VALID [2022-04-28 11:17:49,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,548 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,548 INFO L272 TraceCheckUtils]: 33: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,549 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 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; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,549 INFO L290 TraceCheckUtils]: 39: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,550 INFO L272 TraceCheckUtils]: 40: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,550 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,550 INFO L272 TraceCheckUtils]: 45: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,551 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,551 INFO L272 TraceCheckUtils]: 50: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,551 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,551 INFO L272 TraceCheckUtils]: 55: Hoare triple {16544#(and (<= main_~a~0 100) (<= 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)); {16507#true} is VALID [2022-04-28 11:17:49,551 INFO L290 TraceCheckUtils]: 56: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,551 INFO L290 TraceCheckUtils]: 57: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,551 INFO L290 TraceCheckUtils]: 58: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,552 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,552 INFO L272 TraceCheckUtils]: 60: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,552 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,553 INFO L290 TraceCheckUtils]: 65: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 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; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,553 INFO L290 TraceCheckUtils]: 66: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,553 INFO L272 TraceCheckUtils]: 67: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,553 INFO L290 TraceCheckUtils]: 68: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,553 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,553 INFO L272 TraceCheckUtils]: 72: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,554 INFO L290 TraceCheckUtils]: 73: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,554 INFO L290 TraceCheckUtils]: 74: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,554 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,554 INFO L272 TraceCheckUtils]: 77: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,554 INFO L290 TraceCheckUtils]: 78: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,554 INFO L290 TraceCheckUtils]: 80: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,554 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,555 INFO L272 TraceCheckUtils]: 82: Hoare triple {16544#(and (<= main_~a~0 100) (<= 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)); {16507#true} is VALID [2022-04-28 11:17:49,555 INFO L290 TraceCheckUtils]: 83: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,555 INFO L290 TraceCheckUtils]: 84: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,555 INFO L290 TraceCheckUtils]: 85: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,555 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,555 INFO L272 TraceCheckUtils]: 87: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,555 INFO L290 TraceCheckUtils]: 88: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,555 INFO L290 TraceCheckUtils]: 89: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,555 INFO L290 TraceCheckUtils]: 90: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,556 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {16507#true} {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {16544#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,556 INFO L290 TraceCheckUtils]: 92: Hoare triple {16544#(and (<= main_~a~0 100) (<= 0 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; {16791#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,557 INFO L290 TraceCheckUtils]: 93: Hoare triple {16791#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {16791#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,557 INFO L272 TraceCheckUtils]: 94: Hoare triple {16791#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,557 INFO L290 TraceCheckUtils]: 95: Hoare triple {16507#true} ~cond := #in~cond; {16801#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:49,557 INFO L290 TraceCheckUtils]: 96: Hoare triple {16801#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16805#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:49,557 INFO L290 TraceCheckUtils]: 97: Hoare triple {16805#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16805#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:17:49,558 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16805#(not (= |__VERIFIER_assert_#in~cond| 0))} {16791#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,558 INFO L272 TraceCheckUtils]: 99: Hoare triple {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,558 INFO L290 TraceCheckUtils]: 100: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,558 INFO L290 TraceCheckUtils]: 101: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,558 INFO L290 TraceCheckUtils]: 102: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,558 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {16507#true} {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,559 INFO L272 TraceCheckUtils]: 104: Hoare triple {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,559 INFO L290 TraceCheckUtils]: 105: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,559 INFO L290 TraceCheckUtils]: 106: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,559 INFO L290 TraceCheckUtils]: 107: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,559 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {16507#true} {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,559 INFO L272 TraceCheckUtils]: 109: Hoare triple {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 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)); {16507#true} is VALID [2022-04-28 11:17:49,559 INFO L290 TraceCheckUtils]: 110: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,559 INFO L290 TraceCheckUtils]: 111: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,559 INFO L290 TraceCheckUtils]: 112: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,560 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {16507#true} {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,560 INFO L272 TraceCheckUtils]: 114: Hoare triple {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {16507#true} is VALID [2022-04-28 11:17:49,560 INFO L290 TraceCheckUtils]: 115: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,560 INFO L290 TraceCheckUtils]: 116: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,560 INFO L290 TraceCheckUtils]: 117: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,560 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {16507#true} {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:17:49,561 INFO L290 TraceCheckUtils]: 119: Hoare triple {16812#(and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {16876#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:17:49,561 INFO L272 TraceCheckUtils]: 120: Hoare triple {16876#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 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)); {16507#true} is VALID [2022-04-28 11:17:49,561 INFO L290 TraceCheckUtils]: 121: Hoare triple {16507#true} ~cond := #in~cond; {16507#true} is VALID [2022-04-28 11:17:49,561 INFO L290 TraceCheckUtils]: 122: Hoare triple {16507#true} assume !(0 == ~cond); {16507#true} is VALID [2022-04-28 11:17:49,561 INFO L290 TraceCheckUtils]: 123: Hoare triple {16507#true} assume true; {16507#true} is VALID [2022-04-28 11:17:49,562 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {16507#true} {16876#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {16876#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:17:51,285 INFO L272 TraceCheckUtils]: 125: Hoare triple {16876#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (<= main_~a~0 100) (<= 0 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)); {16895#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:17:51,285 INFO L290 TraceCheckUtils]: 126: Hoare triple {16895#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16899#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:17:51,286 INFO L290 TraceCheckUtils]: 127: Hoare triple {16899#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16508#false} is VALID [2022-04-28 11:17:51,286 INFO L290 TraceCheckUtils]: 128: Hoare triple {16508#false} assume !false; {16508#false} is VALID [2022-04-28 11:17:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 107 proven. 16 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-04-28 11:17:51,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:17:53,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:17:53,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790307985] [2022-04-28 11:17:53,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:17:53,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570852076] [2022-04-28 11:17:53,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570852076] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:17:53,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:17:53,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 11:17:53,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:17:53,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939471636] [2022-04-28 11:17:53,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939471636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:17:53,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:17:53,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 11:17:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352567835] [2022-04-28 11:17:53,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:17:53,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-28 11:17:53,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:17:53,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:17:53,783 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-28 11:17:53,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 11:17:53,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:17:53,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 11:17:53,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=127, Unknown=1, NotChecked=0, Total=156 [2022-04-28 11:17:53,784 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:18:01,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:18:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:07,824 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2022-04-28 11:18:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 11:18:07,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 129 [2022-04-28 11:18:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:18:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:18:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:18:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 46 transitions. [2022-04-28 11:18:07,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 46 transitions. [2022-04-28 11:18:09,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:09,870 INFO L225 Difference]: With dead ends: 140 [2022-04-28 11:18:09,870 INFO L226 Difference]: Without dead ends: 138 [2022-04-28 11:18:09,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=50, Invalid=221, Unknown=1, NotChecked=0, Total=272 [2022-04-28 11:18:09,871 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:09,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 91 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 11:18:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-04-28 11:18:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-04-28 11:18:10,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:10,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:10,040 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:10,040 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:10,042 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-04-28 11:18:10,042 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-04-28 11:18:10,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:10,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:10,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 138 states. [2022-04-28 11:18:10,043 INFO L87 Difference]: Start difference. First operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 138 states. [2022-04-28 11:18:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:10,045 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-04-28 11:18:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-04-28 11:18:10,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:10,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:10,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:10,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 82 states have (on average 1.024390243902439) internal successors, (84), 83 states have internal predecessors, (84), 32 states have call successors, (32), 25 states have call predecessors, (32), 23 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2022-04-28 11:18:10,047 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 129 [2022-04-28 11:18:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:10,047 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2022-04-28 11:18:10,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 11:18:10,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 146 transitions. [2022-04-28 11:18:14,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 144 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-04-28 11:18:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 11:18:14,495 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:14,495 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 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, 1, 1, 1, 1, 1, 1] [2022-04-28 11:18:14,500 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-28 11:18:14,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:14,695 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:14,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 5 times [2022-04-28 11:18:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:14,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [739047327] [2022-04-28 11:18:14,931 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:14,932 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash -262683944, now seen corresponding path program 6 times [2022-04-28 11:18:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:14,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784284084] [2022-04-28 11:18:14,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:14,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:14,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633281875] [2022-04-28 11:18:14,940 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:18:14,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:14,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:14,941 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-28 11:18:14,941 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-28 11:18:16,342 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:18:16,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:16,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 11:18:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:16,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:27,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {17761#true} call ULTIMATE.init(); {17761#true} is VALID [2022-04-28 11:18:27,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {17761#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); {17761#true} is VALID [2022-04-28 11:18:27,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17761#true} {17761#true} #84#return; {17761#true} is VALID [2022-04-28 11:18:27,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {17761#true} call #t~ret5 := main(); {17761#true} is VALID [2022-04-28 11:18:27,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {17761#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; {17781#(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)))} is VALID [2022-04-28 11:18:27,809 INFO L272 TraceCheckUtils]: 6: Hoare triple {17781#(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)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {17761#true} ~cond := #in~cond; {17788#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 11:18:27,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {17788#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17792#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:18:27,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {17792#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17792#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 11:18:27,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17792#(not (= |assume_abort_if_not_#in~cond| 0))} {17781#(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)))} #60#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,811 INFO L272 TraceCheckUtils]: 13: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,812 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17761#true} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,812 INFO L272 TraceCheckUtils]: 18: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,812 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17761#true} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,812 INFO L272 TraceCheckUtils]: 23: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,813 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17761#true} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,813 INFO L272 TraceCheckUtils]: 28: Hoare triple {17799#(and (<= main_~a~0 100) (<= 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)); {17761#true} is VALID [2022-04-28 11:18:27,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,814 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17761#true} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,814 INFO L272 TraceCheckUtils]: 33: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,814 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17761#true} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 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; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,815 INFO L272 TraceCheckUtils]: 40: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,815 INFO L290 TraceCheckUtils]: 43: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,816 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17761#true} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,816 INFO L272 TraceCheckUtils]: 45: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,816 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17761#true} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #64#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,816 INFO L272 TraceCheckUtils]: 50: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,816 INFO L290 TraceCheckUtils]: 52: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,816 INFO L290 TraceCheckUtils]: 53: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,817 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17761#true} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #66#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,817 INFO L272 TraceCheckUtils]: 55: Hoare triple {17799#(and (<= main_~a~0 100) (<= 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)); {17761#true} is VALID [2022-04-28 11:18:27,817 INFO L290 TraceCheckUtils]: 56: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,817 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17761#true} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #68#return; {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,817 INFO L272 TraceCheckUtils]: 60: Hoare triple {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {17761#true} ~cond := #in~cond; {17953#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:27,818 INFO L290 TraceCheckUtils]: 62: Hoare triple {17953#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:27,818 INFO L290 TraceCheckUtils]: 63: Hoare triple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:27,819 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} {17799#(and (<= main_~a~0 100) (<= 0 main_~a~0))} #70#return; {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,821 INFO L290 TraceCheckUtils]: 65: Hoare triple {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 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; {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} assume !false; {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,821 INFO L272 TraceCheckUtils]: 67: Hoare triple {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,821 INFO L290 TraceCheckUtils]: 68: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,821 INFO L290 TraceCheckUtils]: 70: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,822 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17761#true} {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #62#return; {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,822 INFO L272 TraceCheckUtils]: 72: Hoare triple {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,822 INFO L290 TraceCheckUtils]: 73: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,822 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17761#true} {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #64#return; {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,822 INFO L272 TraceCheckUtils]: 77: Hoare triple {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,822 INFO L290 TraceCheckUtils]: 78: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,822 INFO L290 TraceCheckUtils]: 79: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,823 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17761#true} {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #66#return; {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,823 INFO L272 TraceCheckUtils]: 82: Hoare triple {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 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)); {17761#true} is VALID [2022-04-28 11:18:27,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,824 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17761#true} {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #68#return; {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,824 INFO L272 TraceCheckUtils]: 87: Hoare triple {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,824 INFO L290 TraceCheckUtils]: 88: Hoare triple {17761#true} ~cond := #in~cond; {17953#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:27,824 INFO L290 TraceCheckUtils]: 89: Hoare triple {17953#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:27,825 INFO L290 TraceCheckUtils]: 90: Hoare triple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:27,825 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} #70#return; {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,827 INFO L290 TraceCheckUtils]: 92: Hoare triple {17964#(and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (<= 0 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; {18049#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,827 INFO L290 TraceCheckUtils]: 93: Hoare triple {18049#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0))} assume !false; {18049#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,827 INFO L272 TraceCheckUtils]: 94: Hoare triple {18049#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,828 INFO L290 TraceCheckUtils]: 95: Hoare triple {17761#true} ~cond := #in~cond; {17953#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:27,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {17953#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:27,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:27,829 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} {18049#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0))} #62#return; {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,829 INFO L272 TraceCheckUtils]: 99: Hoare triple {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,829 INFO L290 TraceCheckUtils]: 100: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,829 INFO L290 TraceCheckUtils]: 101: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,829 INFO L290 TraceCheckUtils]: 102: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,830 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17761#true} {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #64#return; {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,830 INFO L272 TraceCheckUtils]: 104: Hoare triple {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,830 INFO L290 TraceCheckUtils]: 105: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,830 INFO L290 TraceCheckUtils]: 106: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,830 INFO L290 TraceCheckUtils]: 107: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,830 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17761#true} {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #66#return; {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,830 INFO L272 TraceCheckUtils]: 109: Hoare triple {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 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)); {17761#true} is VALID [2022-04-28 11:18:27,830 INFO L290 TraceCheckUtils]: 110: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,830 INFO L290 TraceCheckUtils]: 111: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,830 INFO L290 TraceCheckUtils]: 112: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,831 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17761#true} {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #68#return; {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,831 INFO L272 TraceCheckUtils]: 114: Hoare triple {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:27,831 INFO L290 TraceCheckUtils]: 115: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,831 INFO L290 TraceCheckUtils]: 116: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,831 INFO L290 TraceCheckUtils]: 117: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,832 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17761#true} {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} #70#return; {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} is VALID [2022-04-28 11:18:27,832 INFO L290 TraceCheckUtils]: 119: Hoare triple {18068#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0))} assume !(~n~0 <= ~a~0); {18132#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:18:27,833 INFO L272 TraceCheckUtils]: 120: Hoare triple {18132#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 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)); {17761#true} is VALID [2022-04-28 11:18:27,833 INFO L290 TraceCheckUtils]: 121: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,833 INFO L290 TraceCheckUtils]: 122: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,833 INFO L290 TraceCheckUtils]: 123: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,833 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17761#true} {18132#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {18132#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:18:27,833 INFO L272 TraceCheckUtils]: 125: Hoare triple {18132#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 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)); {17761#true} is VALID [2022-04-28 11:18:27,833 INFO L290 TraceCheckUtils]: 126: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:27,833 INFO L290 TraceCheckUtils]: 127: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:27,833 INFO L290 TraceCheckUtils]: 128: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:27,834 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17761#true} {18132#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #74#return; {18132#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:18:27,948 INFO L272 TraceCheckUtils]: 130: Hoare triple {18132#(and (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= main_~a~0 100) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {18166#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:27,949 INFO L290 TraceCheckUtils]: 131: Hoare triple {18166#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18170#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:27,949 INFO L290 TraceCheckUtils]: 132: Hoare triple {18170#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17762#false} is VALID [2022-04-28 11:18:27,949 INFO L290 TraceCheckUtils]: 133: Hoare triple {17762#false} assume !false; {17762#false} is VALID [2022-04-28 11:18:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 181 proven. 69 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-04-28 11:18:27,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:32,526 INFO L290 TraceCheckUtils]: 133: Hoare triple {17762#false} assume !false; {17762#false} is VALID [2022-04-28 11:18:32,526 INFO L290 TraceCheckUtils]: 132: Hoare triple {18170#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17762#false} is VALID [2022-04-28 11:18:32,527 INFO L290 TraceCheckUtils]: 131: Hoare triple {18166#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18170#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:32,527 INFO L272 TraceCheckUtils]: 130: Hoare triple {18186#(= (+ (* 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)); {18166#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:32,527 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {17761#true} {18186#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #74#return; {18186#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:18:32,527 INFO L290 TraceCheckUtils]: 128: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:32,528 INFO L290 TraceCheckUtils]: 127: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:32,528 INFO L290 TraceCheckUtils]: 126: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:32,528 INFO L272 TraceCheckUtils]: 125: Hoare triple {18186#(= (+ (* 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)); {17761#true} is VALID [2022-04-28 11:18:32,528 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {17761#true} {18186#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} #72#return; {18186#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:18:32,528 INFO L290 TraceCheckUtils]: 123: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:32,528 INFO L290 TraceCheckUtils]: 122: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:32,528 INFO L290 TraceCheckUtils]: 121: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:32,528 INFO L272 TraceCheckUtils]: 120: Hoare triple {18186#(= (+ (* 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)); {17761#true} is VALID [2022-04-28 11:18:32,529 INFO L290 TraceCheckUtils]: 119: Hoare triple {18220#(or (= (+ (* 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); {18186#(= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))} is VALID [2022-04-28 11:18:32,529 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {17761#true} {18220#(or (= (+ (* 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))} #70#return; {18220#(or (= (+ (* 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-28 11:18:32,529 INFO L290 TraceCheckUtils]: 117: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:32,529 INFO L290 TraceCheckUtils]: 116: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:32,529 INFO L290 TraceCheckUtils]: 115: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:32,529 INFO L272 TraceCheckUtils]: 114: Hoare triple {18220#(or (= (+ (* 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)); {17761#true} is VALID [2022-04-28 11:18:32,530 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17761#true} {18220#(or (= (+ (* 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))} #68#return; {18220#(or (= (+ (* 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-28 11:18:32,530 INFO L290 TraceCheckUtils]: 112: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:32,530 INFO L290 TraceCheckUtils]: 111: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:32,530 INFO L290 TraceCheckUtils]: 110: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:32,530 INFO L272 TraceCheckUtils]: 109: Hoare triple {18220#(or (= (+ (* 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)); {17761#true} is VALID [2022-04-28 11:18:32,530 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {17761#true} {18220#(or (= (+ (* 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))} #66#return; {18220#(or (= (+ (* 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-28 11:18:32,530 INFO L290 TraceCheckUtils]: 107: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:32,530 INFO L290 TraceCheckUtils]: 106: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:32,530 INFO L290 TraceCheckUtils]: 105: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:32,530 INFO L272 TraceCheckUtils]: 104: Hoare triple {18220#(or (= (+ (* 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)); {17761#true} is VALID [2022-04-28 11:18:32,531 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {17761#true} {18220#(or (= (+ (* 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))} #64#return; {18220#(or (= (+ (* 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-28 11:18:32,531 INFO L290 TraceCheckUtils]: 102: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:32,531 INFO L290 TraceCheckUtils]: 101: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:32,531 INFO L290 TraceCheckUtils]: 100: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:32,531 INFO L272 TraceCheckUtils]: 99: Hoare triple {18220#(or (= (+ (* 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)); {17761#true} is VALID [2022-04-28 11:18:32,531 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} {18284#(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))} #62#return; {18220#(or (= (+ (* 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-28 11:18:32,532 INFO L290 TraceCheckUtils]: 97: Hoare triple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:32,532 INFO L290 TraceCheckUtils]: 96: Hoare triple {18294#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:32,532 INFO L290 TraceCheckUtils]: 95: Hoare triple {17761#true} ~cond := #in~cond; {18294#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:18:32,532 INFO L272 TraceCheckUtils]: 94: Hoare triple {18284#(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 ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:32,533 INFO L290 TraceCheckUtils]: 93: Hoare triple {18284#(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 !false; {18284#(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-28 11:18:32,535 INFO L290 TraceCheckUtils]: 92: Hoare triple {18304#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 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; {18284#(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-28 11:18:33,489 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} {17761#true} #70#return; {18304#(or (not (<= (div (+ main_~z~0 (- 6)) 6) main_~a~0)) (not (= (mod main_~z~0 6) 0)) (<= (+ (div (+ main_~z~0 (- 6)) 6) 1) main_~a~0) (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12)))} is VALID [2022-04-28 11:18:33,490 INFO L290 TraceCheckUtils]: 90: Hoare triple {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:33,490 INFO L290 TraceCheckUtils]: 89: Hoare triple {18294#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17957#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:18:33,490 INFO L290 TraceCheckUtils]: 88: Hoare triple {17761#true} ~cond := #in~cond; {18294#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:18:33,490 INFO L272 TraceCheckUtils]: 87: Hoare triple {17761#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,490 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17761#true} {17761#true} #68#return; {17761#true} is VALID [2022-04-28 11:18:33,490 INFO L290 TraceCheckUtils]: 85: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,490 INFO L290 TraceCheckUtils]: 84: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,490 INFO L290 TraceCheckUtils]: 83: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L272 TraceCheckUtils]: 82: Hoare triple {17761#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17761#true} {17761#true} #66#return; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 80: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 79: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 78: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L272 TraceCheckUtils]: 77: Hoare triple {17761#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {17761#true} {17761#true} #64#return; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 75: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 74: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 73: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L272 TraceCheckUtils]: 72: Hoare triple {17761#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17761#true} {17761#true} #62#return; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 70: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 69: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 68: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L272 TraceCheckUtils]: 67: Hoare triple {17761#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 66: Hoare triple {17761#true} assume !false; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 65: Hoare triple {17761#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; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {17761#true} {17761#true} #70#return; {17761#true} is VALID [2022-04-28 11:18:33,491 INFO L290 TraceCheckUtils]: 63: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 62: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 61: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L272 TraceCheckUtils]: 60: Hoare triple {17761#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17761#true} {17761#true} #68#return; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 56: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L272 TraceCheckUtils]: 55: Hoare triple {17761#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17761#true} {17761#true} #66#return; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L272 TraceCheckUtils]: 50: Hoare triple {17761#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {17761#true} {17761#true} #64#return; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L272 TraceCheckUtils]: 45: Hoare triple {17761#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17761#true} {17761#true} #62#return; {17761#true} is VALID [2022-04-28 11:18:33,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L272 TraceCheckUtils]: 40: Hoare triple {17761#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {17761#true} assume !false; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {17761#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; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {17761#true} {17761#true} #70#return; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L272 TraceCheckUtils]: 33: Hoare triple {17761#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17761#true} {17761#true} #68#return; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L272 TraceCheckUtils]: 28: Hoare triple {17761#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17761#true} {17761#true} #66#return; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,493 INFO L272 TraceCheckUtils]: 23: Hoare triple {17761#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {17761#true} {17761#true} #64#return; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L272 TraceCheckUtils]: 18: Hoare triple {17761#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {17761#true} {17761#true} #62#return; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L272 TraceCheckUtils]: 13: Hoare triple {17761#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {17761#true} assume !false; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {17761#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17761#true} {17761#true} #60#return; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {17761#true} assume !(0 == ~cond); {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {17761#true} ~cond := #in~cond; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L272 TraceCheckUtils]: 6: Hoare triple {17761#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {17761#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; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {17761#true} call #t~ret5 := main(); {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17761#true} {17761#true} #84#return; {17761#true} is VALID [2022-04-28 11:18:33,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {17761#true} assume true; {17761#true} is VALID [2022-04-28 11:18:33,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {17761#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); {17761#true} is VALID [2022-04-28 11:18:33,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {17761#true} call ULTIMATE.init(); {17761#true} is VALID [2022-04-28 11:18:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 148 proven. 39 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2022-04-28 11:18:33,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:33,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784284084] [2022-04-28 11:18:33,495 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:33,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633281875] [2022-04-28 11:18:33,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633281875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:33,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:33,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-28 11:18:33,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:33,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [739047327] [2022-04-28 11:18:33,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [739047327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:33,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:33,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 11:18:33,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437456150] [2022-04-28 11:18:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:33,496 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 134 [2022-04-28 11:18:33,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:33,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:18:34,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:34,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 11:18:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 11:18:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 11:18:34,072 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:18:40,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 11:18:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:52,392 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2022-04-28 11:18:52,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:18:52,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 134 [2022-04-28 11:18:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:18:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:18:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-28 11:18:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:18:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2022-04-28 11:18:52,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2022-04-28 11:18:52,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:52,934 INFO L225 Difference]: With dead ends: 144 [2022-04-28 11:18:52,934 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 11:18:52,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2022-04-28 11:18:52,935 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-28 11:18:52,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 97 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-04-28 11:18:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 11:18:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2022-04-28 11:18:53,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:18:53,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:53,069 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:53,069 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:53,072 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-04-28 11:18:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2022-04-28 11:18:53,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:53,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:53,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 142 states. [2022-04-28 11:18:53,072 INFO L87 Difference]: Start difference. First operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand 142 states. [2022-04-28 11:18:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:18:53,074 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2022-04-28 11:18:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2022-04-28 11:18:53,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:18:53,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:18:53,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:18:53,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:18:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 85 states have internal predecessors, (85), 32 states have call successors, (32), 25 states have call predecessors, (32), 24 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-28 11:18:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2022-04-28 11:18:53,077 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 134 [2022-04-28 11:18:53,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:18:53,077 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2022-04-28 11:18:53,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-28 11:18:53,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 147 transitions. [2022-04-28 11:18:58,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 146 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:18:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2022-04-28 11:18:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 11:18:58,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:18:58,244 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:18:58,253 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-28 11:18:58,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:58,445 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:18:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:18:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 19 times [2022-04-28 11:18:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:18:58,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1844673409] [2022-04-28 11:18:58,683 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:18:58,683 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:18:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1923910469, now seen corresponding path program 20 times [2022-04-28 11:18:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:18:58,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422404125] [2022-04-28 11:18:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:18:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:18:58,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:18:58,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218963928] [2022-04-28 11:18:58,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:18:58,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:18:58,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:18:58,725 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:18:58,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 11:18:58,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:18:58,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:18:58,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 11:18:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:18:58,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:18:59,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {19443#true} call ULTIMATE.init(); {19443#true} is VALID [2022-04-28 11:18:59,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {19443#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); {19443#true} is VALID [2022-04-28 11:18:59,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19443#true} {19443#true} #84#return; {19443#true} is VALID [2022-04-28 11:18:59,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {19443#true} call #t~ret5 := main(); {19443#true} is VALID [2022-04-28 11:18:59,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {19443#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; {19443#true} is VALID [2022-04-28 11:18:59,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {19443#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19443#true} {19443#true} #60#return; {19443#true} is VALID [2022-04-28 11:18:59,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {19443#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:59,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:59,372 INFO L272 TraceCheckUtils]: 13: Hoare triple {19481#(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)); {19443#true} is VALID [2022-04-28 11:18:59,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,373 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19443#true} {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:59,373 INFO L272 TraceCheckUtils]: 18: Hoare triple {19481#(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)); {19443#true} is VALID [2022-04-28 11:18:59,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,373 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19443#true} {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:59,373 INFO L272 TraceCheckUtils]: 23: Hoare triple {19481#(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)); {19443#true} is VALID [2022-04-28 11:18:59,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,374 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19443#true} {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:59,374 INFO L272 TraceCheckUtils]: 28: Hoare triple {19481#(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)); {19443#true} is VALID [2022-04-28 11:18:59,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,374 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19443#true} {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:59,375 INFO L272 TraceCheckUtils]: 33: Hoare triple {19481#(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)); {19443#true} is VALID [2022-04-28 11:18:59,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,375 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19443#true} {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {19481#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:18:59,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {19481#(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; {19563#(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-28 11:18:59,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {19563#(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 !false; {19563#(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-28 11:18:59,376 INFO L272 TraceCheckUtils]: 40: Hoare triple {19563#(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)); {19443#true} is VALID [2022-04-28 11:18:59,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,376 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19443#true} {19563#(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))} #62#return; {19563#(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-28 11:18:59,376 INFO L272 TraceCheckUtils]: 45: Hoare triple {19563#(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)); {19443#true} is VALID [2022-04-28 11:18:59,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,377 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19443#true} {19563#(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))} #64#return; {19563#(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-28 11:18:59,377 INFO L272 TraceCheckUtils]: 50: Hoare triple {19563#(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)); {19443#true} is VALID [2022-04-28 11:18:59,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,387 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19443#true} {19563#(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))} #66#return; {19563#(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-28 11:18:59,388 INFO L272 TraceCheckUtils]: 55: Hoare triple {19563#(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)); {19443#true} is VALID [2022-04-28 11:18:59,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,388 INFO L290 TraceCheckUtils]: 57: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,388 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19443#true} {19563#(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))} #68#return; {19563#(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-28 11:18:59,388 INFO L272 TraceCheckUtils]: 60: Hoare triple {19563#(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)); {19443#true} is VALID [2022-04-28 11:18:59,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,388 INFO L290 TraceCheckUtils]: 63: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,389 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19443#true} {19563#(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))} #70#return; {19563#(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-28 11:18:59,389 INFO L290 TraceCheckUtils]: 65: Hoare triple {19563#(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; {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} is VALID [2022-04-28 11:18:59,390 INFO L290 TraceCheckUtils]: 66: Hoare triple {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} assume !false; {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} is VALID [2022-04-28 11:18:59,390 INFO L272 TraceCheckUtils]: 67: Hoare triple {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,390 INFO L290 TraceCheckUtils]: 68: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,390 INFO L290 TraceCheckUtils]: 69: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,390 INFO L290 TraceCheckUtils]: 70: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,390 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19443#true} {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} #62#return; {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} is VALID [2022-04-28 11:18:59,390 INFO L272 TraceCheckUtils]: 72: Hoare triple {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,390 INFO L290 TraceCheckUtils]: 73: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,390 INFO L290 TraceCheckUtils]: 74: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,390 INFO L290 TraceCheckUtils]: 75: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,391 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19443#true} {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} #64#return; {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} is VALID [2022-04-28 11:18:59,391 INFO L272 TraceCheckUtils]: 77: Hoare triple {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,391 INFO L290 TraceCheckUtils]: 78: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,391 INFO L290 TraceCheckUtils]: 79: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,391 INFO L290 TraceCheckUtils]: 80: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,391 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19443#true} {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} #66#return; {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} is VALID [2022-04-28 11:18:59,391 INFO L272 TraceCheckUtils]: 82: Hoare triple {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,392 INFO L290 TraceCheckUtils]: 83: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,392 INFO L290 TraceCheckUtils]: 84: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,392 INFO L290 TraceCheckUtils]: 85: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,392 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19443#true} {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} #68#return; {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} is VALID [2022-04-28 11:18:59,392 INFO L272 TraceCheckUtils]: 87: Hoare triple {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,392 INFO L290 TraceCheckUtils]: 88: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,392 INFO L290 TraceCheckUtils]: 89: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,392 INFO L290 TraceCheckUtils]: 90: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,393 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19443#true} {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} #70#return; {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 1))} is VALID [2022-04-28 11:18:59,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {19645#(and (= (+ main_~x~0 (* main_~z~0 3) (- 24) (* (- 2) main_~y~0)) 0) (= (+ main_~z~0 (- 12)) 6) (= (+ (- 1) main_~n~0) 1) (= (+ (* (- 2) main_~z~0) main_~y~0 18) 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; {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} is VALID [2022-04-28 11:18:59,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} assume !false; {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} is VALID [2022-04-28 11:18:59,393 INFO L272 TraceCheckUtils]: 94: Hoare triple {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,393 INFO L290 TraceCheckUtils]: 95: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,393 INFO L290 TraceCheckUtils]: 96: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,393 INFO L290 TraceCheckUtils]: 97: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,394 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19443#true} {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} #62#return; {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} is VALID [2022-04-28 11:18:59,394 INFO L272 TraceCheckUtils]: 99: Hoare triple {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,394 INFO L290 TraceCheckUtils]: 101: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,394 INFO L290 TraceCheckUtils]: 102: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,394 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19443#true} {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} #64#return; {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} is VALID [2022-04-28 11:18:59,394 INFO L272 TraceCheckUtils]: 104: Hoare triple {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,394 INFO L290 TraceCheckUtils]: 105: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,395 INFO L290 TraceCheckUtils]: 106: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,395 INFO L290 TraceCheckUtils]: 107: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,395 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19443#true} {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} #66#return; {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} is VALID [2022-04-28 11:18:59,395 INFO L272 TraceCheckUtils]: 109: Hoare triple {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~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)); {19443#true} is VALID [2022-04-28 11:18:59,395 INFO L290 TraceCheckUtils]: 110: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,395 INFO L290 TraceCheckUtils]: 111: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,396 INFO L290 TraceCheckUtils]: 112: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,396 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19443#true} {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} #68#return; {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} is VALID [2022-04-28 11:18:59,396 INFO L272 TraceCheckUtils]: 114: Hoare triple {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,396 INFO L290 TraceCheckUtils]: 115: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,396 INFO L290 TraceCheckUtils]: 116: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,396 INFO L290 TraceCheckUtils]: 117: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,397 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19443#true} {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} #70#return; {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~0) 0))} is VALID [2022-04-28 11:18:59,397 INFO L290 TraceCheckUtils]: 119: Hoare triple {19727#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~y~0 37) (= (+ (- 27) main_~x~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; {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:59,397 INFO L290 TraceCheckUtils]: 120: Hoare triple {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} assume !false; {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:59,397 INFO L272 TraceCheckUtils]: 121: Hoare triple {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,398 INFO L290 TraceCheckUtils]: 122: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,398 INFO L290 TraceCheckUtils]: 123: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,398 INFO L290 TraceCheckUtils]: 124: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,398 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19443#true} {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} #62#return; {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:59,398 INFO L272 TraceCheckUtils]: 126: Hoare triple {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,398 INFO L290 TraceCheckUtils]: 127: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,398 INFO L290 TraceCheckUtils]: 128: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,398 INFO L290 TraceCheckUtils]: 129: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,399 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19443#true} {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} #64#return; {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} is VALID [2022-04-28 11:18:59,399 INFO L272 TraceCheckUtils]: 131: Hoare triple {19809#(and (= main_~n~0 4) (= 64 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19846#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:59,399 INFO L290 TraceCheckUtils]: 132: Hoare triple {19846#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19850#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:59,400 INFO L290 TraceCheckUtils]: 133: Hoare triple {19850#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19444#false} is VALID [2022-04-28 11:18:59,400 INFO L290 TraceCheckUtils]: 134: Hoare triple {19444#false} assume !false; {19444#false} is VALID [2022-04-28 11:18:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 44 proven. 58 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:18:59,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:18:59,939 INFO L290 TraceCheckUtils]: 134: Hoare triple {19444#false} assume !false; {19444#false} is VALID [2022-04-28 11:18:59,940 INFO L290 TraceCheckUtils]: 133: Hoare triple {19850#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19444#false} is VALID [2022-04-28 11:18:59,940 INFO L290 TraceCheckUtils]: 132: Hoare triple {19846#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19850#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:18:59,941 INFO L272 TraceCheckUtils]: 131: Hoare triple {19866#(= (* 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)); {19846#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:18:59,941 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {19443#true} {19866#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {19866#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:59,941 INFO L290 TraceCheckUtils]: 129: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,941 INFO L290 TraceCheckUtils]: 128: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,941 INFO L290 TraceCheckUtils]: 127: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,941 INFO L272 TraceCheckUtils]: 126: Hoare triple {19866#(= (* 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)); {19443#true} is VALID [2022-04-28 11:18:59,942 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {19443#true} {19866#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {19866#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:59,942 INFO L290 TraceCheckUtils]: 124: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,942 INFO L290 TraceCheckUtils]: 123: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,942 INFO L290 TraceCheckUtils]: 122: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,942 INFO L272 TraceCheckUtils]: 121: Hoare triple {19866#(= (* 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)); {19443#true} is VALID [2022-04-28 11:18:59,942 INFO L290 TraceCheckUtils]: 120: Hoare triple {19866#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {19866#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:59,945 INFO L290 TraceCheckUtils]: 119: Hoare triple {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 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; {19866#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:18:59,945 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {19443#true} {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #70#return; {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:59,945 INFO L290 TraceCheckUtils]: 117: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,945 INFO L290 TraceCheckUtils]: 116: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,945 INFO L290 TraceCheckUtils]: 115: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,945 INFO L272 TraceCheckUtils]: 114: Hoare triple {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 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)); {19443#true} is VALID [2022-04-28 11:18:59,946 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19443#true} {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #68#return; {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:59,946 INFO L290 TraceCheckUtils]: 112: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,946 INFO L290 TraceCheckUtils]: 111: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,946 INFO L290 TraceCheckUtils]: 110: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,946 INFO L272 TraceCheckUtils]: 109: Hoare triple {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 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)); {19443#true} is VALID [2022-04-28 11:18:59,947 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19443#true} {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #66#return; {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:59,947 INFO L290 TraceCheckUtils]: 107: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,947 INFO L290 TraceCheckUtils]: 106: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,947 INFO L290 TraceCheckUtils]: 105: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,947 INFO L272 TraceCheckUtils]: 104: Hoare triple {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,947 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {19443#true} {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #64#return; {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:59,947 INFO L290 TraceCheckUtils]: 102: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,947 INFO L290 TraceCheckUtils]: 101: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,947 INFO L290 TraceCheckUtils]: 100: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,947 INFO L272 TraceCheckUtils]: 99: Hoare triple {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 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)); {19443#true} is VALID [2022-04-28 11:18:59,948 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {19443#true} {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} #62#return; {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:59,948 INFO L290 TraceCheckUtils]: 97: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,948 INFO L290 TraceCheckUtils]: 96: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,948 INFO L290 TraceCheckUtils]: 95: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,948 INFO L272 TraceCheckUtils]: 94: Hoare triple {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,948 INFO L290 TraceCheckUtils]: 93: Hoare triple {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} assume !false; {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:59,950 INFO L290 TraceCheckUtils]: 92: Hoare triple {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~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; {19903#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 main_~n~0 main_~n~0) (* main_~n~0 3) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:18:59,951 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {19443#true} {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #70#return; {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:18:59,951 INFO L290 TraceCheckUtils]: 90: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,951 INFO L290 TraceCheckUtils]: 89: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,951 INFO L290 TraceCheckUtils]: 88: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,951 INFO L272 TraceCheckUtils]: 87: Hoare triple {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,952 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19443#true} {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #68#return; {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:18:59,952 INFO L290 TraceCheckUtils]: 85: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,952 INFO L290 TraceCheckUtils]: 84: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,952 INFO L290 TraceCheckUtils]: 83: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,952 INFO L272 TraceCheckUtils]: 82: Hoare triple {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~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)); {19443#true} is VALID [2022-04-28 11:18:59,952 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19443#true} {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #66#return; {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:18:59,952 INFO L290 TraceCheckUtils]: 80: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,952 INFO L290 TraceCheckUtils]: 79: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,952 INFO L272 TraceCheckUtils]: 77: Hoare triple {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,953 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19443#true} {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #64#return; {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:18:59,953 INFO L290 TraceCheckUtils]: 75: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,953 INFO L290 TraceCheckUtils]: 74: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,953 INFO L290 TraceCheckUtils]: 73: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,953 INFO L272 TraceCheckUtils]: 72: Hoare triple {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,954 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19443#true} {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} #62#return; {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:18:59,954 INFO L290 TraceCheckUtils]: 70: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,954 INFO L290 TraceCheckUtils]: 69: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,954 INFO L290 TraceCheckUtils]: 68: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,954 INFO L272 TraceCheckUtils]: 67: Hoare triple {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} assume !false; {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:18:59,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 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; {19985#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (+ (* main_~n~0 12) (* main_~n~0 main_~n~0 main_~n~0) (* 6 (* main_~n~0 main_~n~0)) 8))} is VALID [2022-04-28 11:18:59,957 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {19443#true} {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #70#return; {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:18:59,957 INFO L290 TraceCheckUtils]: 63: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,957 INFO L290 TraceCheckUtils]: 62: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,958 INFO L272 TraceCheckUtils]: 60: Hoare triple {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,958 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19443#true} {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #68#return; {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:18:59,958 INFO L290 TraceCheckUtils]: 58: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,958 INFO L272 TraceCheckUtils]: 55: Hoare triple {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,959 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19443#true} {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #66#return; {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:18:59,959 INFO L290 TraceCheckUtils]: 53: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,959 INFO L290 TraceCheckUtils]: 51: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,959 INFO L272 TraceCheckUtils]: 50: Hoare triple {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,959 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {19443#true} {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #64#return; {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:18:59,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,960 INFO L272 TraceCheckUtils]: 45: Hoare triple {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,960 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19443#true} {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} #62#return; {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:18:59,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,960 INFO L272 TraceCheckUtils]: 40: Hoare triple {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} assume !false; {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:18:59,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 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; {20067#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ (* main_~n~0 12) (* 6 (* (+ main_~n~0 1) (+ main_~n~0 1))) (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) 20))} is VALID [2022-04-28 11:18:59,964 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19443#true} {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #70#return; {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:18:59,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,964 INFO L272 TraceCheckUtils]: 33: Hoare triple {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,964 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19443#true} {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #68#return; {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:18:59,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,964 INFO L272 TraceCheckUtils]: 28: Hoare triple {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,965 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19443#true} {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #66#return; {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:18:59,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,965 INFO L272 TraceCheckUtils]: 23: Hoare triple {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,966 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {19443#true} {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #64#return; {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:18:59,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,966 INFO L272 TraceCheckUtils]: 18: Hoare triple {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,966 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {19443#true} {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} #62#return; {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:18:59,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,966 INFO L272 TraceCheckUtils]: 13: Hoare triple {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} assume !false; {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:18:59,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {19443#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {20149#(= (+ (* main_~n~0 12) 32 (* 6 (* (+ main_~n~0 2) (+ main_~n~0 2))) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2))) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))} is VALID [2022-04-28 11:18:59,967 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19443#true} {19443#true} #60#return; {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {19443#true} assume !(0 == ~cond); {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {19443#true} ~cond := #in~cond; {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L272 TraceCheckUtils]: 6: Hoare triple {19443#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {19443#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; {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {19443#true} call #t~ret5 := main(); {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19443#true} {19443#true} #84#return; {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {19443#true} assume true; {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {19443#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); {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {19443#true} call ULTIMATE.init(); {19443#true} is VALID [2022-04-28 11:18:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 44 proven. 58 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-04-28 11:18:59,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:18:59,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422404125] [2022-04-28 11:18:59,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:18:59,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218963928] [2022-04-28 11:18:59,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218963928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:18:59,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:18:59,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 11:18:59,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:18:59,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1844673409] [2022-04-28 11:18:59,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1844673409] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:18:59,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:18:59,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 11:18:59,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099907133] [2022-04-28 11:18:59,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:18:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:18:59,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:18:59,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:19:00,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:00,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 11:19:00,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:00,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 11:19:00,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 11:19:00,043 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:19:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:02,394 INFO L93 Difference]: Finished difference Result 180 states and 202 transitions. [2022-04-28 11:19:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 11:19:02,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 135 [2022-04-28 11:19:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:19:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-04-28 11:19:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:19:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2022-04-28 11:19:02,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 130 transitions. [2022-04-28 11:19:02,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:02,508 INFO L225 Difference]: With dead ends: 180 [2022-04-28 11:19:02,508 INFO L226 Difference]: Without dead ends: 172 [2022-04-28 11:19:02,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-04-28 11:19:02,508 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:02,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 301 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 11:19:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-28 11:19:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2022-04-28 11:19:02,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:02,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:19:02,645 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:19:02,646 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:19:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:02,648 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2022-04-28 11:19:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2022-04-28 11:19:02,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:02,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:02,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 172 states. [2022-04-28 11:19:02,649 INFO L87 Difference]: Start difference. First operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 172 states. [2022-04-28 11:19:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:02,652 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2022-04-28 11:19:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2022-04-28 11:19:02,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:02,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:02,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:02,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 37 states have call successors, (37), 29 states have call predecessors, (37), 28 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-28 11:19:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2022-04-28 11:19:02,655 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 135 [2022-04-28 11:19:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:02,656 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2022-04-28 11:19:02,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 6 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2022-04-28 11:19:02,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 171 transitions. [2022-04-28 11:19:07,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 169 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:07,491 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2022-04-28 11:19:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-28 11:19:07,491 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:07,491 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 27, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:07,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:07,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:07,692 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 21 times [2022-04-28 11:19:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:07,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [305128510] [2022-04-28 11:19:07,930 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:07,930 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1219256746, now seen corresponding path program 22 times [2022-04-28 11:19:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:07,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623083954] [2022-04-28 11:19:07,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:07,944 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:07,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860360288] [2022-04-28 11:19:07,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:19:07,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:07,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:07,945 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:07,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 11:19:08,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:19:08,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:08,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 11:19:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:08,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:08,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {21298#true} call ULTIMATE.init(); {21298#true} is VALID [2022-04-28 11:19:08,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {21298#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); {21298#true} is VALID [2022-04-28 11:19:08,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21298#true} {21298#true} #84#return; {21298#true} is VALID [2022-04-28 11:19:08,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {21298#true} call #t~ret5 := main(); {21298#true} is VALID [2022-04-28 11:19:08,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {21298#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; {21298#true} is VALID [2022-04-28 11:19:08,767 INFO L272 TraceCheckUtils]: 6: Hoare triple {21298#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,768 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21298#true} {21298#true} #60#return; {21298#true} is VALID [2022-04-28 11:19:08,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {21298#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,768 INFO L272 TraceCheckUtils]: 13: Hoare triple {21336#(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)); {21298#true} is VALID [2022-04-28 11:19:08,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,769 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21298#true} {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,769 INFO L272 TraceCheckUtils]: 18: Hoare triple {21336#(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)); {21298#true} is VALID [2022-04-28 11:19:08,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,770 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21298#true} {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,770 INFO L272 TraceCheckUtils]: 23: Hoare triple {21336#(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)); {21298#true} is VALID [2022-04-28 11:19:08,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,770 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21298#true} {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,770 INFO L272 TraceCheckUtils]: 28: Hoare triple {21336#(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)); {21298#true} is VALID [2022-04-28 11:19:08,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,771 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21298#true} {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,771 INFO L272 TraceCheckUtils]: 33: Hoare triple {21336#(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)); {21298#true} is VALID [2022-04-28 11:19:08,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,771 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21298#true} {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {21336#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:08,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {21336#(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; {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:19:08,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:19:08,772 INFO L272 TraceCheckUtils]: 40: Hoare triple {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,773 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21298#true} {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #62#return; {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:19:08,773 INFO L272 TraceCheckUtils]: 45: Hoare triple {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,774 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21298#true} {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #64#return; {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:19:08,774 INFO L272 TraceCheckUtils]: 50: Hoare triple {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,774 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21298#true} {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #66#return; {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:19:08,774 INFO L272 TraceCheckUtils]: 55: Hoare triple {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) 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)); {21298#true} is VALID [2022-04-28 11:19:08,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,775 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21298#true} {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #68#return; {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:19:08,775 INFO L272 TraceCheckUtils]: 60: Hoare triple {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,776 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21298#true} {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} #70#return; {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 11:19:08,776 INFO L290 TraceCheckUtils]: 65: Hoare triple {21418#(and (= main_~z~0 (+ main_~y~0 6 (* (- 1) main_~x~0))) (= main_~x~0 1) (= (+ (- 1) main_~n~0) 0) (= 6 (+ main_~y~0 (* (- 1) 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; {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:08,776 INFO L290 TraceCheckUtils]: 66: Hoare triple {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} assume !false; {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:08,777 INFO L272 TraceCheckUtils]: 67: Hoare triple {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,777 INFO L290 TraceCheckUtils]: 68: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,777 INFO L290 TraceCheckUtils]: 69: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,777 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21298#true} {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} #62#return; {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:08,777 INFO L272 TraceCheckUtils]: 72: Hoare triple {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,777 INFO L290 TraceCheckUtils]: 73: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,777 INFO L290 TraceCheckUtils]: 74: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,777 INFO L290 TraceCheckUtils]: 75: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,778 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21298#true} {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} #64#return; {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:08,778 INFO L272 TraceCheckUtils]: 77: Hoare triple {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,778 INFO L290 TraceCheckUtils]: 78: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,778 INFO L290 TraceCheckUtils]: 79: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,778 INFO L290 TraceCheckUtils]: 80: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,778 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21298#true} {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} #66#return; {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:08,778 INFO L272 TraceCheckUtils]: 82: Hoare triple {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 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)); {21298#true} is VALID [2022-04-28 11:19:08,779 INFO L290 TraceCheckUtils]: 83: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,779 INFO L290 TraceCheckUtils]: 84: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,779 INFO L290 TraceCheckUtils]: 85: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,779 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21298#true} {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} #68#return; {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:08,779 INFO L272 TraceCheckUtils]: 87: Hoare triple {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 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)); {21298#true} is VALID [2022-04-28 11:19:08,779 INFO L290 TraceCheckUtils]: 88: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,779 INFO L290 TraceCheckUtils]: 89: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,779 INFO L290 TraceCheckUtils]: 90: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,780 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21298#true} {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} #70#return; {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) main_~n~0) 0))} is VALID [2022-04-28 11:19:08,780 INFO L290 TraceCheckUtils]: 92: Hoare triple {21500#(and (= 6 (+ (- 2) main_~x~0)) (= (+ main_~z~0 main_~x~0 (- 7)) main_~y~0) (= (+ main_~z~0 (- 6)) (+ main_~x~0 4)) (= (+ (- 2) 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; {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:19:08,780 INFO L290 TraceCheckUtils]: 93: Hoare triple {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} assume !false; {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:19:08,781 INFO L272 TraceCheckUtils]: 94: Hoare triple {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,781 INFO L290 TraceCheckUtils]: 95: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,781 INFO L290 TraceCheckUtils]: 96: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,781 INFO L290 TraceCheckUtils]: 97: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,781 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21298#true} {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #62#return; {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:19:08,781 INFO L272 TraceCheckUtils]: 99: Hoare triple {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,781 INFO L290 TraceCheckUtils]: 100: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,781 INFO L290 TraceCheckUtils]: 101: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,781 INFO L290 TraceCheckUtils]: 102: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,782 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21298#true} {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #64#return; {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:19:08,782 INFO L272 TraceCheckUtils]: 104: Hoare triple {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,782 INFO L290 TraceCheckUtils]: 105: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,782 INFO L290 TraceCheckUtils]: 106: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,782 INFO L290 TraceCheckUtils]: 107: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,782 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21298#true} {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #66#return; {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:19:08,782 INFO L272 TraceCheckUtils]: 109: Hoare triple {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,783 INFO L290 TraceCheckUtils]: 110: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,783 INFO L290 TraceCheckUtils]: 111: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,783 INFO L290 TraceCheckUtils]: 112: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,783 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21298#true} {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #68#return; {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:19:08,783 INFO L272 TraceCheckUtils]: 114: Hoare triple {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,783 INFO L290 TraceCheckUtils]: 115: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,783 INFO L290 TraceCheckUtils]: 116: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,783 INFO L290 TraceCheckUtils]: 117: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,784 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21298#true} {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #70#return; {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:19:08,784 INFO L290 TraceCheckUtils]: 119: Hoare triple {21582#(and (= main_~n~0 3) (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} is VALID [2022-04-28 11:19:08,784 INFO L290 TraceCheckUtils]: 120: Hoare triple {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} assume !false; {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} is VALID [2022-04-28 11:19:08,785 INFO L272 TraceCheckUtils]: 121: Hoare triple {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,785 INFO L290 TraceCheckUtils]: 122: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,785 INFO L290 TraceCheckUtils]: 123: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,785 INFO L290 TraceCheckUtils]: 124: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,785 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21298#true} {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} #62#return; {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} is VALID [2022-04-28 11:19:08,785 INFO L272 TraceCheckUtils]: 126: Hoare triple {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,785 INFO L290 TraceCheckUtils]: 127: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,785 INFO L290 TraceCheckUtils]: 128: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,785 INFO L290 TraceCheckUtils]: 129: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,786 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21298#true} {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} #64#return; {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} is VALID [2022-04-28 11:19:08,786 INFO L272 TraceCheckUtils]: 131: Hoare triple {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,786 INFO L290 TraceCheckUtils]: 132: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,786 INFO L290 TraceCheckUtils]: 133: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,786 INFO L290 TraceCheckUtils]: 134: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,786 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21298#true} {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} #66#return; {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} is VALID [2022-04-28 11:19:08,786 INFO L272 TraceCheckUtils]: 136: Hoare triple {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,786 INFO L290 TraceCheckUtils]: 137: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,786 INFO L290 TraceCheckUtils]: 138: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,787 INFO L290 TraceCheckUtils]: 139: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,787 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21298#true} {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} #68#return; {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} is VALID [2022-04-28 11:19:08,787 INFO L272 TraceCheckUtils]: 141: Hoare triple {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,787 INFO L290 TraceCheckUtils]: 142: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,787 INFO L290 TraceCheckUtils]: 143: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,787 INFO L290 TraceCheckUtils]: 144: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,788 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21298#true} {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} #70#return; {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} is VALID [2022-04-28 11:19:08,788 INFO L290 TraceCheckUtils]: 146: Hoare triple {21664#(and (= main_~n~0 4) (= (+ (- 37) main_~x~0) 27) (= main_~y~0 61))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} is VALID [2022-04-28 11:19:08,788 INFO L290 TraceCheckUtils]: 147: Hoare triple {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} assume !false; {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} is VALID [2022-04-28 11:19:08,788 INFO L272 TraceCheckUtils]: 148: Hoare triple {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,788 INFO L290 TraceCheckUtils]: 149: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,789 INFO L290 TraceCheckUtils]: 150: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,789 INFO L290 TraceCheckUtils]: 151: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,789 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21298#true} {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} #62#return; {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} is VALID [2022-04-28 11:19:08,789 INFO L272 TraceCheckUtils]: 153: Hoare triple {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:08,789 INFO L290 TraceCheckUtils]: 154: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:08,789 INFO L290 TraceCheckUtils]: 155: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:08,789 INFO L290 TraceCheckUtils]: 156: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:08,790 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21298#true} {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} #64#return; {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} is VALID [2022-04-28 11:19:08,790 INFO L272 TraceCheckUtils]: 158: Hoare triple {21746#(and (= (+ (- 1) main_~n~0) 4) (= 61 (+ (- 64) main_~x~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21783#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:08,790 INFO L290 TraceCheckUtils]: 159: Hoare triple {21783#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21787#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:08,791 INFO L290 TraceCheckUtils]: 160: Hoare triple {21787#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21299#false} is VALID [2022-04-28 11:19:08,791 INFO L290 TraceCheckUtils]: 161: Hoare triple {21299#false} assume !false; {21299#false} is VALID [2022-04-28 11:19:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 54 proven. 90 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-28 11:19:08,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:09,323 INFO L290 TraceCheckUtils]: 161: Hoare triple {21299#false} assume !false; {21299#false} is VALID [2022-04-28 11:19:09,323 INFO L290 TraceCheckUtils]: 160: Hoare triple {21787#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21299#false} is VALID [2022-04-28 11:19:09,324 INFO L290 TraceCheckUtils]: 159: Hoare triple {21783#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21787#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:09,324 INFO L272 TraceCheckUtils]: 158: Hoare triple {21803#(= (* 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)); {21783#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:09,324 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {21298#true} {21803#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #64#return; {21803#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:09,324 INFO L290 TraceCheckUtils]: 156: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,324 INFO L290 TraceCheckUtils]: 155: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,324 INFO L290 TraceCheckUtils]: 154: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,325 INFO L272 TraceCheckUtils]: 153: Hoare triple {21803#(= (* 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)); {21298#true} is VALID [2022-04-28 11:19:09,325 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {21298#true} {21803#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} #62#return; {21803#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:09,325 INFO L290 TraceCheckUtils]: 151: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,325 INFO L290 TraceCheckUtils]: 150: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,325 INFO L290 TraceCheckUtils]: 149: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,325 INFO L272 TraceCheckUtils]: 148: Hoare triple {21803#(= (* 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)); {21298#true} is VALID [2022-04-28 11:19:09,325 INFO L290 TraceCheckUtils]: 147: Hoare triple {21803#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} assume !false; {21803#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:09,327 INFO L290 TraceCheckUtils]: 146: Hoare triple {21840#(= (* (+ 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; {21803#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:19:09,327 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {21298#true} {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #70#return; {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:09,327 INFO L290 TraceCheckUtils]: 144: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,327 INFO L290 TraceCheckUtils]: 143: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,328 INFO L290 TraceCheckUtils]: 142: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,328 INFO L272 TraceCheckUtils]: 141: Hoare triple {21840#(= (* (+ 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)); {21298#true} is VALID [2022-04-28 11:19:09,328 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21298#true} {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #68#return; {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:09,328 INFO L290 TraceCheckUtils]: 139: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,328 INFO L290 TraceCheckUtils]: 138: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,328 INFO L290 TraceCheckUtils]: 137: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,328 INFO L272 TraceCheckUtils]: 136: Hoare triple {21840#(= (* (+ 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)); {21298#true} is VALID [2022-04-28 11:19:09,328 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {21298#true} {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #66#return; {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:09,328 INFO L290 TraceCheckUtils]: 134: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,328 INFO L290 TraceCheckUtils]: 133: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,329 INFO L290 TraceCheckUtils]: 132: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,329 INFO L272 TraceCheckUtils]: 131: Hoare triple {21840#(= (* (+ 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)); {21298#true} is VALID [2022-04-28 11:19:09,329 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {21298#true} {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #64#return; {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:09,329 INFO L290 TraceCheckUtils]: 129: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,329 INFO L290 TraceCheckUtils]: 128: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,329 INFO L290 TraceCheckUtils]: 127: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,329 INFO L272 TraceCheckUtils]: 126: Hoare triple {21840#(= (* (+ 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)); {21298#true} is VALID [2022-04-28 11:19:09,329 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {21298#true} {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} #62#return; {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:09,329 INFO L290 TraceCheckUtils]: 124: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,329 INFO L290 TraceCheckUtils]: 123: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,330 INFO L290 TraceCheckUtils]: 122: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,330 INFO L272 TraceCheckUtils]: 121: Hoare triple {21840#(= (* (+ 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)); {21298#true} is VALID [2022-04-28 11:19:09,330 INFO L290 TraceCheckUtils]: 120: Hoare triple {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} assume !false; {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:09,332 INFO L290 TraceCheckUtils]: 119: Hoare triple {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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; {21840#(= (* (+ main_~n~0 1) (+ main_~n~0 1) (+ main_~n~0 1)) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 11:19:09,332 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21298#true} {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #70#return; {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:09,333 INFO L290 TraceCheckUtils]: 117: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,333 INFO L290 TraceCheckUtils]: 116: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,333 INFO L290 TraceCheckUtils]: 115: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,333 INFO L272 TraceCheckUtils]: 114: Hoare triple {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,333 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21298#true} {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #68#return; {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:09,333 INFO L290 TraceCheckUtils]: 112: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,333 INFO L290 TraceCheckUtils]: 111: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,333 INFO L290 TraceCheckUtils]: 110: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,333 INFO L272 TraceCheckUtils]: 109: Hoare triple {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~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)); {21298#true} is VALID [2022-04-28 11:19:09,333 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21298#true} {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #66#return; {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:09,334 INFO L290 TraceCheckUtils]: 107: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,334 INFO L290 TraceCheckUtils]: 106: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,334 INFO L290 TraceCheckUtils]: 105: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,334 INFO L272 TraceCheckUtils]: 104: Hoare triple {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,334 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {21298#true} {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #64#return; {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:09,334 INFO L290 TraceCheckUtils]: 102: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,334 INFO L290 TraceCheckUtils]: 101: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,334 INFO L290 TraceCheckUtils]: 100: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,334 INFO L272 TraceCheckUtils]: 99: Hoare triple {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,335 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {21298#true} {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} #62#return; {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:09,335 INFO L290 TraceCheckUtils]: 97: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,335 INFO L290 TraceCheckUtils]: 96: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,335 INFO L290 TraceCheckUtils]: 95: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,335 INFO L272 TraceCheckUtils]: 94: Hoare triple {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,335 INFO L290 TraceCheckUtils]: 93: Hoare triple {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} assume !false; {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:09,337 INFO L290 TraceCheckUtils]: 92: Hoare triple {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~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; {21922#(= (+ main_~z~0 main_~x~0 (* main_~y~0 2)) (* (+ main_~n~0 2) (+ main_~n~0 2) (+ main_~n~0 2)))} is VALID [2022-04-28 11:19:09,337 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21298#true} {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #70#return; {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:09,337 INFO L290 TraceCheckUtils]: 90: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,337 INFO L290 TraceCheckUtils]: 89: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,337 INFO L290 TraceCheckUtils]: 88: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,337 INFO L272 TraceCheckUtils]: 87: Hoare triple {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,338 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21298#true} {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #68#return; {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:09,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,338 INFO L290 TraceCheckUtils]: 84: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,338 INFO L272 TraceCheckUtils]: 82: Hoare triple {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~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)); {21298#true} is VALID [2022-04-28 11:19:09,338 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21298#true} {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #66#return; {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:09,338 INFO L290 TraceCheckUtils]: 80: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,338 INFO L290 TraceCheckUtils]: 79: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,338 INFO L290 TraceCheckUtils]: 78: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,338 INFO L272 TraceCheckUtils]: 77: Hoare triple {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,339 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {21298#true} {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #64#return; {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:09,339 INFO L290 TraceCheckUtils]: 75: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,339 INFO L290 TraceCheckUtils]: 74: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,339 INFO L290 TraceCheckUtils]: 73: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,339 INFO L272 TraceCheckUtils]: 72: Hoare triple {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,339 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21298#true} {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} #62#return; {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:09,339 INFO L290 TraceCheckUtils]: 70: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,339 INFO L290 TraceCheckUtils]: 68: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,340 INFO L272 TraceCheckUtils]: 67: Hoare triple {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} assume !false; {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:09,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~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; {22004#(= (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (* (+ main_~n~0 3) (+ main_~n~0 3) (+ main_~n~0 3)))} is VALID [2022-04-28 11:19:09,343 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21298#true} {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #70#return; {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:19:09,343 INFO L290 TraceCheckUtils]: 63: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,343 INFO L272 TraceCheckUtils]: 60: Hoare triple {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,344 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21298#true} {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #68#return; {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:19:09,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,344 INFO L290 TraceCheckUtils]: 56: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,344 INFO L272 TraceCheckUtils]: 55: Hoare triple {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~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)); {21298#true} is VALID [2022-04-28 11:19:09,344 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21298#true} {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #66#return; {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:19:09,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,344 INFO L290 TraceCheckUtils]: 52: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,344 INFO L290 TraceCheckUtils]: 51: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,344 INFO L272 TraceCheckUtils]: 50: Hoare triple {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,345 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {21298#true} {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #64#return; {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:19:09,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,345 INFO L272 TraceCheckUtils]: 45: Hoare triple {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,345 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21298#true} {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} #62#return; {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:19:09,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,346 INFO L272 TraceCheckUtils]: 40: Hoare triple {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} assume !false; {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:19:09,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 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; {22086#(= (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24) (* (+ main_~n~0 4) (+ main_~n~0 4) (+ main_~n~0 4)))} is VALID [2022-04-28 11:19:09,370 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21298#true} {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #70#return; {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:19:09,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,370 INFO L272 TraceCheckUtils]: 33: Hoare triple {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,371 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21298#true} {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #68#return; {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:19:09,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,371 INFO L272 TraceCheckUtils]: 28: Hoare triple {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 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)); {21298#true} is VALID [2022-04-28 11:19:09,371 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {21298#true} {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #66#return; {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:19:09,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,371 INFO L272 TraceCheckUtils]: 23: Hoare triple {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,372 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {21298#true} {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #64#return; {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:19:09,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,372 INFO L272 TraceCheckUtils]: 18: Hoare triple {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,372 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {21298#true} {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} #62#return; {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:19:09,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,373 INFO L272 TraceCheckUtils]: 13: Hoare triple {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} assume !false; {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:19:09,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {21298#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {22168#(= (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (* (+ 5 main_~n~0) (+ 5 main_~n~0) (+ 5 main_~n~0)))} is VALID [2022-04-28 11:19:09,373 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21298#true} {21298#true} #60#return; {21298#true} is VALID [2022-04-28 11:19:09,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {21298#true} assume !(0 == ~cond); {21298#true} is VALID [2022-04-28 11:19:09,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {21298#true} ~cond := #in~cond; {21298#true} is VALID [2022-04-28 11:19:09,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {21298#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {21298#true} is VALID [2022-04-28 11:19:09,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {21298#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; {21298#true} is VALID [2022-04-28 11:19:09,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {21298#true} call #t~ret5 := main(); {21298#true} is VALID [2022-04-28 11:19:09,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21298#true} {21298#true} #84#return; {21298#true} is VALID [2022-04-28 11:19:09,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {21298#true} assume true; {21298#true} is VALID [2022-04-28 11:19:09,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {21298#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); {21298#true} is VALID [2022-04-28 11:19:09,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {21298#true} call ULTIMATE.init(); {21298#true} is VALID [2022-04-28 11:19:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 54 proven. 90 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2022-04-28 11:19:09,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:09,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623083954] [2022-04-28 11:19:09,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:09,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860360288] [2022-04-28 11:19:09,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860360288] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:19:09,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:19:09,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 11:19:09,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:09,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [305128510] [2022-04-28 11:19:09,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [305128510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:09,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:09,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:19:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015099829] [2022-04-28 11:19:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:09,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 162 [2022-04-28 11:19:09,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:09,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:19:09,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:09,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:19:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:19:09,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 11:19:09,436 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:19:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:13,237 INFO L93 Difference]: Finished difference Result 195 states and 220 transitions. [2022-04-28 11:19:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:19:13,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 162 [2022-04-28 11:19:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:19:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-04-28 11:19:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:19:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2022-04-28 11:19:13,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 142 transitions. [2022-04-28 11:19:13,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:13,456 INFO L225 Difference]: With dead ends: 195 [2022-04-28 11:19:13,456 INFO L226 Difference]: Without dead ends: 193 [2022-04-28 11:19:13,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-28 11:19:13,457 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 7 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:13,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 360 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 11:19:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-28 11:19:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2022-04-28 11:19:13,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:13,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:19:13,665 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:19:13,665 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:19:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:13,669 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2022-04-28 11:19:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2022-04-28 11:19:13,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:13,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:13,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 193 states. [2022-04-28 11:19:13,669 INFO L87 Difference]: Start difference. First operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 193 states. [2022-04-28 11:19:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:13,673 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2022-04-28 11:19:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2022-04-28 11:19:13,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:13,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:13,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:13,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 107 states have internal predecessors, (108), 42 states have call successors, (42), 31 states have call predecessors, (42), 30 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:19:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2022-04-28 11:19:13,677 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 162 [2022-04-28 11:19:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:13,677 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2022-04-28 11:19:13,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2022-04-28 11:19:13,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 178 states and 190 transitions. [2022-04-28 11:19:19,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 188 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2022-04-28 11:19:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-28 11:19:19,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:19,059 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:19,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:19,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 11:19:19,259 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 1 times [2022-04-28 11:19:19,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:19,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42403743] [2022-04-28 11:19:19,488 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:19,488 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1267842796, now seen corresponding path program 2 times [2022-04-28 11:19:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:19,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342729407] [2022-04-28 11:19:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:19,495 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:19,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1570427816] [2022-04-28 11:19:19,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 11:19:19,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:19,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:19,496 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:19,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 11:19:19,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 11:19:19,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:19,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 11:19:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:19,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:19:24,526 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 11:19:24,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {23419#true} call ULTIMATE.init(); {23419#true} is VALID [2022-04-28 11:19:24,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {23419#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); {23419#true} is VALID [2022-04-28 11:19:24,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23419#true} {23419#true} #84#return; {23419#true} is VALID [2022-04-28 11:19:24,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {23419#true} call #t~ret5 := main(); {23419#true} is VALID [2022-04-28 11:19:24,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {23419#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; {23419#true} is VALID [2022-04-28 11:19:24,613 INFO L272 TraceCheckUtils]: 6: Hoare triple {23419#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23419#true} {23419#true} #60#return; {23419#true} is VALID [2022-04-28 11:19:24,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {23419#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:24,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:24,614 INFO L272 TraceCheckUtils]: 13: Hoare triple {23457#(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)); {23419#true} is VALID [2022-04-28 11:19:24,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,615 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {23419#true} {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:24,615 INFO L272 TraceCheckUtils]: 18: Hoare triple {23457#(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)); {23419#true} is VALID [2022-04-28 11:19:24,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,616 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {23419#true} {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:24,616 INFO L272 TraceCheckUtils]: 23: Hoare triple {23457#(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)); {23419#true} is VALID [2022-04-28 11:19:24,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,616 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23419#true} {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:24,616 INFO L272 TraceCheckUtils]: 28: Hoare triple {23457#(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)); {23419#true} is VALID [2022-04-28 11:19:24,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,617 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23419#true} {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:24,617 INFO L272 TraceCheckUtils]: 33: Hoare triple {23457#(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)); {23419#true} is VALID [2022-04-28 11:19:24,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,617 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23419#true} {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {23457#(and (= main_~x~0 0) (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:19:24,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {23457#(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; {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:19:24,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} assume !false; {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:19:24,618 INFO L272 TraceCheckUtils]: 40: Hoare triple {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ 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)); {23419#true} is VALID [2022-04-28 11:19:24,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,619 INFO L290 TraceCheckUtils]: 42: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,619 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23419#true} {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #62#return; {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:19:24,619 INFO L272 TraceCheckUtils]: 45: Hoare triple {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ 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)); {23419#true} is VALID [2022-04-28 11:19:24,619 INFO L290 TraceCheckUtils]: 46: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,619 INFO L290 TraceCheckUtils]: 47: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,619 INFO L290 TraceCheckUtils]: 48: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,620 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {23419#true} {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #64#return; {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:19:24,620 INFO L272 TraceCheckUtils]: 50: Hoare triple {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ 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)); {23419#true} is VALID [2022-04-28 11:19:24,620 INFO L290 TraceCheckUtils]: 51: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,620 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23419#true} {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #66#return; {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:19:24,620 INFO L272 TraceCheckUtils]: 55: Hoare triple {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ 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)); {23419#true} is VALID [2022-04-28 11:19:24,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,621 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23419#true} {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #68#return; {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:19:24,621 INFO L272 TraceCheckUtils]: 60: Hoare triple {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ 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)); {23419#true} is VALID [2022-04-28 11:19:24,621 INFO L290 TraceCheckUtils]: 61: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,621 INFO L290 TraceCheckUtils]: 62: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,622 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23419#true} {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} #70#return; {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 11:19:24,622 INFO L290 TraceCheckUtils]: 65: Hoare triple {23539#(and (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 1) (= (+ main_~z~0 (- 6)) 6) (= (+ (- 1) main_~n~0) 0) (= (+ 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; {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:24,622 INFO L290 TraceCheckUtils]: 66: Hoare triple {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} assume !false; {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:24,623 INFO L272 TraceCheckUtils]: 67: Hoare triple {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,623 INFO L290 TraceCheckUtils]: 69: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,623 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {23419#true} {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #62#return; {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:24,623 INFO L272 TraceCheckUtils]: 72: Hoare triple {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,623 INFO L290 TraceCheckUtils]: 73: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,623 INFO L290 TraceCheckUtils]: 74: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,624 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {23419#true} {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #64#return; {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:24,624 INFO L272 TraceCheckUtils]: 77: Hoare triple {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,624 INFO L290 TraceCheckUtils]: 78: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,624 INFO L290 TraceCheckUtils]: 79: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,624 INFO L290 TraceCheckUtils]: 80: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,624 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {23419#true} {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #66#return; {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:24,624 INFO L272 TraceCheckUtils]: 82: Hoare triple {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~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)); {23419#true} is VALID [2022-04-28 11:19:24,624 INFO L290 TraceCheckUtils]: 83: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,625 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23419#true} {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #68#return; {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:24,625 INFO L272 TraceCheckUtils]: 87: Hoare triple {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,625 INFO L290 TraceCheckUtils]: 88: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,625 INFO L290 TraceCheckUtils]: 89: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,625 INFO L290 TraceCheckUtils]: 90: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,626 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23419#true} {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} #70#return; {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~0 8))} is VALID [2022-04-28 11:19:24,626 INFO L290 TraceCheckUtils]: 92: Hoare triple {23621#(and (= main_~z~0 18) (= 19 main_~y~0) (= (+ (- 2) main_~n~0) 0) (= main_~x~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; {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:19:24,627 INFO L290 TraceCheckUtils]: 93: Hoare triple {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} assume !false; {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:19:24,627 INFO L272 TraceCheckUtils]: 94: Hoare triple {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,627 INFO L290 TraceCheckUtils]: 95: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,627 INFO L290 TraceCheckUtils]: 96: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,627 INFO L290 TraceCheckUtils]: 97: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,627 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {23419#true} {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} #62#return; {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:19:24,627 INFO L272 TraceCheckUtils]: 99: Hoare triple {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,627 INFO L290 TraceCheckUtils]: 100: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,627 INFO L290 TraceCheckUtils]: 101: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,627 INFO L290 TraceCheckUtils]: 102: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,628 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {23419#true} {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} #64#return; {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:19:24,628 INFO L272 TraceCheckUtils]: 104: Hoare triple {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,628 INFO L290 TraceCheckUtils]: 105: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,628 INFO L290 TraceCheckUtils]: 106: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,628 INFO L290 TraceCheckUtils]: 107: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,629 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23419#true} {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} #66#return; {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:19:24,629 INFO L272 TraceCheckUtils]: 109: Hoare triple {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,629 INFO L290 TraceCheckUtils]: 110: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,629 INFO L290 TraceCheckUtils]: 111: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,629 INFO L290 TraceCheckUtils]: 112: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,629 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23419#true} {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} #68#return; {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:19:24,629 INFO L272 TraceCheckUtils]: 114: Hoare triple {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,629 INFO L290 TraceCheckUtils]: 115: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,629 INFO L290 TraceCheckUtils]: 116: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,629 INFO L290 TraceCheckUtils]: 117: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,630 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {23419#true} {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} #70#return; {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 0))} is VALID [2022-04-28 11:19:24,630 INFO L290 TraceCheckUtils]: 119: Hoare triple {23703#(and (= (+ main_~y~0 14 (* (- 1) main_~x~0)) main_~z~0) (= 18 (+ main_~y~0 (* (- 1) main_~x~0) 8)) (= 19 (+ main_~x~0 (- 8))) (= (+ main_~n~0 (- 3)) 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; {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,631 INFO L290 TraceCheckUtils]: 120: Hoare triple {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} assume !false; {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,631 INFO L272 TraceCheckUtils]: 121: Hoare triple {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,631 INFO L290 TraceCheckUtils]: 122: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,631 INFO L290 TraceCheckUtils]: 123: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,631 INFO L290 TraceCheckUtils]: 124: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,631 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {23419#true} {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} #62#return; {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,632 INFO L272 TraceCheckUtils]: 126: Hoare triple {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,632 INFO L290 TraceCheckUtils]: 127: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,632 INFO L290 TraceCheckUtils]: 128: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,632 INFO L290 TraceCheckUtils]: 129: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,632 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {23419#true} {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} #64#return; {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,632 INFO L272 TraceCheckUtils]: 131: Hoare triple {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,632 INFO L290 TraceCheckUtils]: 132: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,632 INFO L290 TraceCheckUtils]: 133: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,632 INFO L290 TraceCheckUtils]: 134: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,633 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {23419#true} {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} #66#return; {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,633 INFO L272 TraceCheckUtils]: 136: Hoare triple {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 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)); {23419#true} is VALID [2022-04-28 11:19:24,633 INFO L290 TraceCheckUtils]: 137: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,633 INFO L290 TraceCheckUtils]: 138: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,633 INFO L290 TraceCheckUtils]: 139: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,633 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {23419#true} {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} #68#return; {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,634 INFO L272 TraceCheckUtils]: 141: Hoare triple {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,634 INFO L290 TraceCheckUtils]: 142: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,634 INFO L290 TraceCheckUtils]: 143: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,634 INFO L290 TraceCheckUtils]: 144: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,634 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {23419#true} {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} #70#return; {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,635 INFO L290 TraceCheckUtils]: 146: Hoare triple {23785#(and (<= 3 main_~a~0) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (<= main_~n~0 4) (= 30 main_~z~0))} assume !(~n~0 <= ~a~0); {23867#(and (<= 3 main_~a~0) (< main_~a~0 4) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,635 INFO L272 TraceCheckUtils]: 147: Hoare triple {23867#(and (<= 3 main_~a~0) (< main_~a~0 4) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (= 30 main_~z~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,635 INFO L290 TraceCheckUtils]: 148: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,635 INFO L290 TraceCheckUtils]: 149: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,635 INFO L290 TraceCheckUtils]: 150: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,635 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {23419#true} {23867#(and (<= 3 main_~a~0) (< main_~a~0 4) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (= 30 main_~z~0))} #72#return; {23867#(and (<= 3 main_~a~0) (< main_~a~0 4) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,636 INFO L272 TraceCheckUtils]: 152: Hoare triple {23867#(and (<= 3 main_~a~0) (< main_~a~0 4) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,636 INFO L290 TraceCheckUtils]: 153: Hoare triple {23419#true} ~cond := #in~cond; {23889#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:24,636 INFO L290 TraceCheckUtils]: 154: Hoare triple {23889#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23893#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:24,636 INFO L290 TraceCheckUtils]: 155: Hoare triple {23893#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23893#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:19:24,637 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {23893#(not (= |__VERIFIER_assert_#in~cond| 0))} {23867#(and (<= 3 main_~a~0) (< main_~a~0 4) (= (+ main_~y~0 (- 42)) 19) (= main_~x~0 (+ (- 58) (* main_~y~0 2))) (= 30 main_~z~0))} #74#return; {23900#(and (= (+ main_~x~0 58) (* main_~y~0 2)) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,637 INFO L272 TraceCheckUtils]: 157: Hoare triple {23900#(and (= (+ main_~x~0 58) (* main_~y~0 2)) (= main_~y~0 61) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {23419#true} is VALID [2022-04-28 11:19:24,637 INFO L290 TraceCheckUtils]: 158: Hoare triple {23419#true} ~cond := #in~cond; {23419#true} is VALID [2022-04-28 11:19:24,637 INFO L290 TraceCheckUtils]: 159: Hoare triple {23419#true} assume !(0 == ~cond); {23419#true} is VALID [2022-04-28 11:19:24,637 INFO L290 TraceCheckUtils]: 160: Hoare triple {23419#true} assume true; {23419#true} is VALID [2022-04-28 11:19:24,638 INFO L284 TraceCheckUtils]: 161: Hoare quadruple {23419#true} {23900#(and (= (+ main_~x~0 58) (* main_~y~0 2)) (= main_~y~0 61) (= 30 main_~z~0))} #76#return; {23900#(and (= (+ main_~x~0 58) (* main_~y~0 2)) (= main_~y~0 61) (= 30 main_~z~0))} is VALID [2022-04-28 11:19:24,638 INFO L272 TraceCheckUtils]: 162: Hoare triple {23900#(and (= (+ main_~x~0 58) (* main_~y~0 2)) (= main_~y~0 61) (= 30 main_~z~0))} call __VERIFIER_assert((if 0 == 2 * ~y~0 * ~y~0 - 3 * ~x~0 * ~z~0 - 18 * ~x~0 - 10 * ~y~0 + 3 * ~z~0 - 10 then 1 else 0)); {23919#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:19:24,639 INFO L290 TraceCheckUtils]: 163: Hoare triple {23919#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23923#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:19:24,639 INFO L290 TraceCheckUtils]: 164: Hoare triple {23923#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23420#false} is VALID [2022-04-28 11:19:24,639 INFO L290 TraceCheckUtils]: 165: Hoare triple {23420#false} assume !false; {23420#false} is VALID [2022-04-28 11:19:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1638 backedges. 133 proven. 74 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2022-04-28 11:19:24,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:19:44,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:19:44,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342729407] [2022-04-28 11:19:44,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:19:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570427816] [2022-04-28 11:19:44,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570427816] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 11:19:44,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 11:19:44,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-28 11:19:44,504 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:19:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42403743] [2022-04-28 11:19:44,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42403743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:19:44,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:19:44,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:19:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251007192] [2022-04-28 11:19:44,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:19:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 166 [2022-04-28 11:19:44,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:19:44,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:19:44,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:44,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:19:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:44,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:19:44,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-04-28 11:19:44,591 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:19:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:47,301 INFO L93 Difference]: Finished difference Result 202 states and 215 transitions. [2022-04-28 11:19:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 11:19:47,301 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) Word has length 166 [2022-04-28 11:19:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:19:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:19:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2022-04-28 11:19:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:19:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2022-04-28 11:19:47,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 118 transitions. [2022-04-28 11:19:47,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:47,438 INFO L225 Difference]: With dead ends: 202 [2022-04-28 11:19:47,438 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 11:19:47,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-04-28 11:19:47,439 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 11:19:47,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 235 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 11:19:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 11:19:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-04-28 11:19:47,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:19:47,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:19:47,661 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:19:47,661 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:19:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:47,665 INFO L93 Difference]: Finished difference Result 186 states and 195 transitions. [2022-04-28 11:19:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2022-04-28 11:19:47,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:47,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:47,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 186 states. [2022-04-28 11:19:47,665 INFO L87 Difference]: Start difference. First operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand 186 states. [2022-04-28 11:19:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:19:47,668 INFO L93 Difference]: Finished difference Result 186 states and 195 transitions. [2022-04-28 11:19:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2022-04-28 11:19:47,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:19:47,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:19:47,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:19:47,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:19:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 42 states have call successors, (42), 33 states have call predecessors, (42), 32 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-28 11:19:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 195 transitions. [2022-04-28 11:19:47,671 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 195 transitions. Word has length 166 [2022-04-28 11:19:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:19:47,672 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 195 transitions. [2022-04-28 11:19:47,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 8 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 8 states have call predecessors, (30), 8 states have call successors, (30) [2022-04-28 11:19:47,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 195 transitions. [2022-04-28 11:19:53,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 193 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:19:53,514 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 195 transitions. [2022-04-28 11:19:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-28 11:19:53,515 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:19:53,515 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 32, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:19:53,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 11:19:53,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 11:19:53,716 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:19:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:19:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 23 times [2022-04-28 11:19:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:19:53,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1650344614] [2022-04-28 11:19:53,943 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:19:53,943 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:19:53,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1777251365, now seen corresponding path program 24 times [2022-04-28 11:19:53,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:19:53,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793610757] [2022-04-28 11:19:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:19:53,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:19:53,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:19:53,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [775982571] [2022-04-28 11:19:53,951 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:19:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:19:53,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:19:53,952 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:19:53,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 11:19:54,783 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:19:54,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:19:54,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 11:19:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:19:55,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:20:17,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {25232#true} call ULTIMATE.init(); {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {25232#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); {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25232#true} {25232#true} #84#return; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {25232#true} call #t~ret5 := main(); {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L272 TraceCheckUtils]: 6: Hoare triple {25232#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25232#true} {25232#true} #60#return; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {25232#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L272 TraceCheckUtils]: 13: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:20:17,111 INFO L272 TraceCheckUtils]: 18: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L272 TraceCheckUtils]: 23: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L272 TraceCheckUtils]: 28: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L272 TraceCheckUtils]: 33: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25232#true} {25232#true} #70#return; {25232#true} is VALID [2022-04-28 11:20:17,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 39: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L272 TraceCheckUtils]: 40: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 43: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L272 TraceCheckUtils]: 45: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 47: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 48: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L272 TraceCheckUtils]: 50: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 51: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 52: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L272 TraceCheckUtils]: 55: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 57: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L272 TraceCheckUtils]: 60: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 61: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 62: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 63: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25232#true} {25232#true} #70#return; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 65: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 66: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L272 TraceCheckUtils]: 67: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 68: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 69: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L272 TraceCheckUtils]: 72: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 73: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:20:17,114 INFO L272 TraceCheckUtils]: 77: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 78: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 79: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L272 TraceCheckUtils]: 82: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 83: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 84: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 85: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L272 TraceCheckUtils]: 87: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 88: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 89: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 90: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25232#true} {25232#true} #70#return; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 92: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 93: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L272 TraceCheckUtils]: 94: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 95: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 96: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,115 INFO L290 TraceCheckUtils]: 97: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L272 TraceCheckUtils]: 99: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 100: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 101: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 102: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L272 TraceCheckUtils]: 104: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 105: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 106: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 107: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L272 TraceCheckUtils]: 109: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 110: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 111: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 112: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L272 TraceCheckUtils]: 114: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 115: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,116 INFO L290 TraceCheckUtils]: 116: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 117: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25232#true} {25232#true} #70#return; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 119: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 120: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L272 TraceCheckUtils]: 121: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 122: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 123: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 124: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L272 TraceCheckUtils]: 126: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 127: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 128: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 129: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L272 TraceCheckUtils]: 131: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 132: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 133: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L290 TraceCheckUtils]: 134: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:20:17,117 INFO L272 TraceCheckUtils]: 136: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,118 INFO L290 TraceCheckUtils]: 137: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,118 INFO L290 TraceCheckUtils]: 138: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,118 INFO L290 TraceCheckUtils]: 139: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,118 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:20:17,118 INFO L272 TraceCheckUtils]: 141: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,118 INFO L290 TraceCheckUtils]: 142: Hoare triple {25232#true} ~cond := #in~cond; {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:17,118 INFO L290 TraceCheckUtils]: 143: Hoare triple {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,119 INFO L290 TraceCheckUtils]: 144: Hoare triple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,119 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} {25232#true} #70#return; {25674#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))} is VALID [2022-04-28 11:20:17,121 INFO L290 TraceCheckUtils]: 146: Hoare triple {25674#(= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* 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; {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} is VALID [2022-04-28 11:20:17,121 INFO L290 TraceCheckUtils]: 147: Hoare triple {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} assume !false; {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} is VALID [2022-04-28 11:20:17,121 INFO L272 TraceCheckUtils]: 148: Hoare triple {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,121 INFO L290 TraceCheckUtils]: 149: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,121 INFO L290 TraceCheckUtils]: 150: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,121 INFO L290 TraceCheckUtils]: 151: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,121 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25232#true} {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} #62#return; {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} is VALID [2022-04-28 11:20:17,122 INFO L272 TraceCheckUtils]: 153: Hoare triple {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,122 INFO L290 TraceCheckUtils]: 154: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,122 INFO L290 TraceCheckUtils]: 155: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,122 INFO L290 TraceCheckUtils]: 156: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,122 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25232#true} {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} #64#return; {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} is VALID [2022-04-28 11:20:17,122 INFO L272 TraceCheckUtils]: 158: Hoare triple {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,122 INFO L290 TraceCheckUtils]: 159: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:20:17,122 INFO L290 TraceCheckUtils]: 160: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:20:17,122 INFO L290 TraceCheckUtils]: 161: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:20:17,123 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25232#true} {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} #66#return; {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} is VALID [2022-04-28 11:20:17,123 INFO L272 TraceCheckUtils]: 163: Hoare triple {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) 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)); {25232#true} is VALID [2022-04-28 11:20:17,123 INFO L290 TraceCheckUtils]: 164: Hoare triple {25232#true} ~cond := #in~cond; {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:17,123 INFO L290 TraceCheckUtils]: 165: Hoare triple {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,124 INFO L290 TraceCheckUtils]: 166: Hoare triple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,124 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} {25678#(exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))} #68#return; {25742#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0))))} is VALID [2022-04-28 11:20:17,124 INFO L272 TraceCheckUtils]: 168: Hoare triple {25742#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:17,125 INFO L290 TraceCheckUtils]: 169: Hoare triple {25232#true} ~cond := #in~cond; {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:17,125 INFO L290 TraceCheckUtils]: 170: Hoare triple {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,125 INFO L290 TraceCheckUtils]: 171: Hoare triple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:17,126 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} {25742#(and (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0))))} #70#return; {25758#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0))))} is VALID [2022-04-28 11:20:19,134 WARN L290 TraceCheckUtils]: 173: Hoare triple {25758#(and (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) 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; {25762#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 12)) (<= (+ v_main_~y~0_253 main_~z~0 v_main_~z~0_264) (+ main_~y~0 6)))))} is UNKNOWN [2022-04-28 11:20:19,138 INFO L290 TraceCheckUtils]: 174: Hoare triple {25762#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 12)) (<= (+ v_main_~y~0_253 main_~z~0 v_main_~z~0_264) (+ main_~y~0 6)))))} assume !false; {25762#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 12)) (<= (+ v_main_~y~0_253 main_~z~0 v_main_~z~0_264) (+ main_~y~0 6)))))} is VALID [2022-04-28 11:20:19,138 INFO L272 TraceCheckUtils]: 175: Hoare triple {25762#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 12)) (<= (+ v_main_~y~0_253 main_~z~0 v_main_~z~0_264) (+ main_~y~0 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:19,139 INFO L290 TraceCheckUtils]: 176: Hoare triple {25232#true} ~cond := #in~cond; {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:19,139 INFO L290 TraceCheckUtils]: 177: Hoare triple {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:19,139 INFO L290 TraceCheckUtils]: 178: Hoare triple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:19,147 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} {25762#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 12)) (<= (+ v_main_~y~0_253 main_~z~0 v_main_~z~0_264) (+ main_~y~0 6)))))} #62#return; {25781#(and (= (+ (* main_~x~0 18) 6 (* main_~n~0 36) (* main_~y~0 (- 6))) (+ (* main_~n~0 12) (* (+ main_~y~0 (* main_~n~0 (- 6))) (* main_~n~0 6)))) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= (+ v_main_~y~0_253 v_main_~z~0_264 (* main_~n~0 6)) main_~y~0) (<= (* main_~n~0 6) (+ v_main_~z~0_264 6)))) (= (+ (* main_~y~0 12) (* main_~n~0 (- 36))) (+ (* (* main_~n~0 6) (* main_~n~0 6)) 12)))} is VALID [2022-04-28 11:20:19,147 INFO L272 TraceCheckUtils]: 180: Hoare triple {25781#(and (= (+ (* main_~x~0 18) 6 (* main_~n~0 36) (* main_~y~0 (- 6))) (+ (* main_~n~0 12) (* (+ main_~y~0 (* main_~n~0 (- 6))) (* main_~n~0 6)))) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= (+ v_main_~y~0_253 v_main_~z~0_264 (* main_~n~0 6)) main_~y~0) (<= (* main_~n~0 6) (+ v_main_~z~0_264 6)))) (= (+ (* main_~y~0 12) (* main_~n~0 (- 36))) (+ (* (* main_~n~0 6) (* main_~n~0 6)) 12)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:20:19,147 INFO L290 TraceCheckUtils]: 181: Hoare triple {25232#true} ~cond := #in~cond; {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:19,148 INFO L290 TraceCheckUtils]: 182: Hoare triple {25663#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:19,148 INFO L290 TraceCheckUtils]: 183: Hoare triple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:20:19,154 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} {25781#(and (= (+ (* main_~x~0 18) 6 (* main_~n~0 36) (* main_~y~0 (- 6))) (+ (* main_~n~0 12) (* (+ main_~y~0 (* main_~n~0 (- 6))) (* main_~n~0 6)))) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= (+ v_main_~y~0_253 v_main_~z~0_264 (* main_~n~0 6)) main_~y~0) (<= (* main_~n~0 6) (+ v_main_~z~0_264 6)))) (= (+ (* main_~y~0 12) (* main_~n~0 (- 36))) (+ (* (* main_~n~0 6) (* main_~n~0 6)) 12)))} #64#return; {25797#(and (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= (+ v_main_~y~0_253 v_main_~z~0_264 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) 1)) (<= (* main_~n~0 6) (+ v_main_~z~0_264 6)))) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} is VALID [2022-04-28 11:20:19,154 INFO L272 TraceCheckUtils]: 185: Hoare triple {25797#(and (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= (+ v_main_~y~0_253 v_main_~z~0_264 (* main_~n~0 3)) (+ (* 3 (* main_~n~0 main_~n~0)) 1)) (<= (* main_~n~0 6) (+ v_main_~z~0_264 6)))) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25801#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:20:19,155 INFO L290 TraceCheckUtils]: 186: Hoare triple {25801#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25805#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:20:19,155 INFO L290 TraceCheckUtils]: 187: Hoare triple {25805#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25233#false} is VALID [2022-04-28 11:20:19,155 INFO L290 TraceCheckUtils]: 188: Hoare triple {25233#false} assume !false; {25233#false} is VALID [2022-04-28 11:20:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 514 proven. 16 refuted. 2 times theorem prover too weak. 1645 trivial. 0 not checked. [2022-04-28 11:20:19,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:23:48,303 INFO L290 TraceCheckUtils]: 188: Hoare triple {25233#false} assume !false; {25233#false} is VALID [2022-04-28 11:23:48,304 INFO L290 TraceCheckUtils]: 187: Hoare triple {25805#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25233#false} is VALID [2022-04-28 11:23:48,304 INFO L290 TraceCheckUtils]: 186: Hoare triple {25801#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25805#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:23:48,304 INFO L272 TraceCheckUtils]: 185: Hoare triple {25821#(= (* 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)); {25801#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:23:48,305 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} {25825#(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))} #64#return; {25821#(= (* main_~n~0 main_~n~0 main_~n~0) main_~x~0)} is VALID [2022-04-28 11:23:48,305 INFO L290 TraceCheckUtils]: 183: Hoare triple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:48,306 INFO L290 TraceCheckUtils]: 182: Hoare triple {25835#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:48,306 INFO L290 TraceCheckUtils]: 181: Hoare triple {25232#true} ~cond := #in~cond; {25835#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:23:48,306 INFO L272 TraceCheckUtils]: 180: Hoare triple {25825#(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)); {25232#true} is VALID [2022-04-28 11:23:48,307 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} {25842#(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))} #62#return; {25825#(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-28 11:23:48,307 INFO L290 TraceCheckUtils]: 178: Hoare triple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:48,307 INFO L290 TraceCheckUtils]: 177: Hoare triple {25835#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:48,307 INFO L290 TraceCheckUtils]: 176: Hoare triple {25232#true} ~cond := #in~cond; {25835#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:23:48,307 INFO L272 TraceCheckUtils]: 175: Hoare triple {25842#(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)); {25232#true} is VALID [2022-04-28 11:23:48,308 INFO L290 TraceCheckUtils]: 174: Hoare triple {25842#(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 !false; {25842#(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-28 11:23:48,459 INFO L290 TraceCheckUtils]: 173: Hoare triple {25861#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 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; {25842#(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-28 11:23:48,460 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {25232#true} {25861#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) (+ main_~y~0 main_~x~0)))} #70#return; {25861#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 11:23:48,460 INFO L290 TraceCheckUtils]: 171: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:48,460 INFO L290 TraceCheckUtils]: 170: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:48,460 INFO L290 TraceCheckUtils]: 169: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:48,460 INFO L272 TraceCheckUtils]: 168: Hoare triple {25861#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 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)); {25232#true} is VALID [2022-04-28 11:23:50,462 WARN L284 TraceCheckUtils]: 167: Hoare quadruple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} {25232#true} #68#return; {25861#(or (not (= (mod main_~z~0 6) 0)) (not (= (+ main_~z~0 main_~y~0) (+ (* (div (+ main_~z~0 (- 6)) 6) 3) 4 (* (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) 3)))) (= (* (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1) (+ (div (+ main_~z~0 (- 6)) 6) 1)) (+ main_~y~0 main_~x~0)))} is UNKNOWN [2022-04-28 11:23:50,462 INFO L290 TraceCheckUtils]: 166: Hoare triple {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:50,463 INFO L290 TraceCheckUtils]: 165: Hoare triple {25835#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25667#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:23:50,463 INFO L290 TraceCheckUtils]: 164: Hoare triple {25232#true} ~cond := #in~cond; {25835#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:23:50,463 INFO L272 TraceCheckUtils]: 163: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,463 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:23:50,463 INFO L290 TraceCheckUtils]: 161: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,463 INFO L290 TraceCheckUtils]: 160: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,463 INFO L290 TraceCheckUtils]: 159: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,463 INFO L272 TraceCheckUtils]: 158: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,463 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:23:50,463 INFO L290 TraceCheckUtils]: 156: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 155: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 154: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L272 TraceCheckUtils]: 153: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 151: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 150: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 149: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L272 TraceCheckUtils]: 148: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 147: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 146: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {25232#true} {25232#true} #70#return; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 144: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 143: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 142: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L272 TraceCheckUtils]: 141: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 139: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 138: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L290 TraceCheckUtils]: 137: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,464 INFO L272 TraceCheckUtils]: 136: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 134: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 133: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 132: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L272 TraceCheckUtils]: 131: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 129: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 128: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 127: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L272 TraceCheckUtils]: 126: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 124: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 123: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 122: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L272 TraceCheckUtils]: 121: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 120: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 119: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {25232#true} {25232#true} #70#return; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 117: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 116: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,465 INFO L290 TraceCheckUtils]: 115: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L272 TraceCheckUtils]: 114: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 112: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 111: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 110: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L272 TraceCheckUtils]: 109: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 107: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 106: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 105: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L272 TraceCheckUtils]: 104: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 102: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 101: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 100: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L272 TraceCheckUtils]: 99: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 97: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 96: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,466 INFO L290 TraceCheckUtils]: 95: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L272 TraceCheckUtils]: 94: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 93: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 92: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25232#true} {25232#true} #70#return; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 90: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 89: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 88: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L272 TraceCheckUtils]: 87: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 85: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 84: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 83: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L272 TraceCheckUtils]: 82: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 80: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L272 TraceCheckUtils]: 77: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:23:50,467 INFO L290 TraceCheckUtils]: 75: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L272 TraceCheckUtils]: 72: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L272 TraceCheckUtils]: 67: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 66: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 65: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25232#true} {25232#true} #70#return; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 63: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L272 TraceCheckUtils]: 60: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L290 TraceCheckUtils]: 56: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L272 TraceCheckUtils]: 55: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,468 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L272 TraceCheckUtils]: 50: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L272 TraceCheckUtils]: 45: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 41: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L272 TraceCheckUtils]: 40: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25232#true} {25232#true} #70#return; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,469 INFO L272 TraceCheckUtils]: 33: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25232#true} {25232#true} #68#return; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L272 TraceCheckUtils]: 28: Hoare triple {25232#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {25232#true} {25232#true} #66#return; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L272 TraceCheckUtils]: 23: Hoare triple {25232#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {25232#true} {25232#true} #64#return; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L272 TraceCheckUtils]: 18: Hoare triple {25232#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {25232#true} {25232#true} #62#return; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L272 TraceCheckUtils]: 13: Hoare triple {25232#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {25232#true} assume !false; {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {25232#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25232#true} {25232#true} #60#return; {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {25232#true} assume !(0 == ~cond); {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {25232#true} ~cond := #in~cond; {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {25232#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {25232#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; {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {25232#true} call #t~ret5 := main(); {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25232#true} {25232#true} #84#return; {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {25232#true} assume true; {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {25232#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); {25232#true} is VALID [2022-04-28 11:23:50,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {25232#true} call ULTIMATE.init(); {25232#true} is VALID [2022-04-28 11:23:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2177 backedges. 353 proven. 6 refuted. 0 times theorem prover too weak. 1818 trivial. 0 not checked. [2022-04-28 11:23:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:23:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793610757] [2022-04-28 11:23:50,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:23:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775982571] [2022-04-28 11:23:50,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775982571] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:23:50,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:23:50,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-28 11:23:50,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:23:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1650344614] [2022-04-28 11:23:50,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1650344614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:23:50,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:23:50,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 11:23:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110143314] [2022-04-28 11:23:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:23:50,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 189 [2022-04-28 11:23:50,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:23:50,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 11:23:52,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:23:52,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 11:23:52,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:23:52,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 11:23:52,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=241, Unknown=8, NotChecked=0, Total=306 [2022-04-28 11:23:52,604 INFO L87 Difference]: Start difference. First operand 186 states and 195 transitions. Second operand has 13 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 11:24:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:13,988 INFO L93 Difference]: Finished difference Result 192 states and 200 transitions. [2022-04-28 11:24:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 11:24:13,988 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) Word has length 189 [2022-04-28 11:24:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 11:24:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-28 11:24:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 11:24:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2022-04-28 11:24:13,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2022-04-28 11:24:16,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:16,180 INFO L225 Difference]: With dead ends: 192 [2022-04-28 11:24:16,180 INFO L226 Difference]: Without dead ends: 190 [2022-04-28 11:24:16,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 359 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=101, Invalid=440, Unknown=11, NotChecked=0, Total=552 [2022-04-28 11:24:16,181 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:16,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 214 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 222 Unchecked, 0.1s Time] [2022-04-28 11:24:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-28 11:24:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2022-04-28 11:24:16,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:16,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 182 states, 110 states have (on average 1.018181818181818) internal successors, (112), 111 states have internal predecessors, (112), 39 states have call successors, (39), 33 states have call predecessors, (39), 32 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:24:16,450 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 182 states, 110 states have (on average 1.018181818181818) internal successors, (112), 111 states have internal predecessors, (112), 39 states have call successors, (39), 33 states have call predecessors, (39), 32 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:24:16,451 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 182 states, 110 states have (on average 1.018181818181818) internal successors, (112), 111 states have internal predecessors, (112), 39 states have call successors, (39), 33 states have call predecessors, (39), 32 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:24:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:16,453 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-04-28 11:24:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 198 transitions. [2022-04-28 11:24:16,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:16,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:16,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 110 states have (on average 1.018181818181818) internal successors, (112), 111 states have internal predecessors, (112), 39 states have call successors, (39), 33 states have call predecessors, (39), 32 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 190 states. [2022-04-28 11:24:16,453 INFO L87 Difference]: Start difference. First operand has 182 states, 110 states have (on average 1.018181818181818) internal successors, (112), 111 states have internal predecessors, (112), 39 states have call successors, (39), 33 states have call predecessors, (39), 32 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand 190 states. [2022-04-28 11:24:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:16,456 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-04-28 11:24:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 198 transitions. [2022-04-28 11:24:16,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:16,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:16,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:16,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 110 states have (on average 1.018181818181818) internal successors, (112), 111 states have internal predecessors, (112), 39 states have call successors, (39), 33 states have call predecessors, (39), 32 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-28 11:24:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 188 transitions. [2022-04-28 11:24:16,458 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 188 transitions. Word has length 189 [2022-04-28 11:24:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:16,459 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 188 transitions. [2022-04-28 11:24:16,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.2) internal successors, (22), 7 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 7 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-28 11:24:16,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 188 transitions. [2022-04-28 11:24:22,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 186 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 188 transitions. [2022-04-28 11:24:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-04-28 11:24:22,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:22,325 INFO L195 NwaCegarLoop]: trace histogram [34, 33, 33, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:22,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:22,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:22,525 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:22,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2044699673, now seen corresponding path program 3 times [2022-04-28 11:24:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:22,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1355368419] [2022-04-28 11:24:22,763 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:22,763 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:22,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2044699673, now seen corresponding path program 4 times [2022-04-28 11:24:22,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:22,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535747126] [2022-04-28 11:24:22,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:22,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:22,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:22,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843517867] [2022-04-28 11:24:22,772 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 11:24:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:22,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:22,784 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:22,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 11:24:22,886 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 11:24:22,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:22,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 11:24:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:22,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:24:23,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {27524#true} call ULTIMATE.init(); {27524#true} is VALID [2022-04-28 11:24:23,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {27524#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); {27524#true} is VALID [2022-04-28 11:24:23,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27524#true} {27524#true} #84#return; {27524#true} is VALID [2022-04-28 11:24:23,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {27524#true} call #t~ret5 := main(); {27524#true} is VALID [2022-04-28 11:24:23,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {27524#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; {27524#true} is VALID [2022-04-28 11:24:23,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {27524#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,657 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27524#true} {27524#true} #60#return; {27524#true} is VALID [2022-04-28 11:24:23,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {27524#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:23,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:23,657 INFO L272 TraceCheckUtils]: 13: Hoare triple {27562#(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)); {27524#true} is VALID [2022-04-28 11:24:23,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,658 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27524#true} {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:23,658 INFO L272 TraceCheckUtils]: 18: Hoare triple {27562#(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)); {27524#true} is VALID [2022-04-28 11:24:23,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,659 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27524#true} {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:23,659 INFO L272 TraceCheckUtils]: 23: Hoare triple {27562#(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)); {27524#true} is VALID [2022-04-28 11:24:23,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,659 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {27524#true} {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:23,660 INFO L272 TraceCheckUtils]: 28: Hoare triple {27562#(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)); {27524#true} is VALID [2022-04-28 11:24:23,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,660 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27524#true} {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #68#return; {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:23,660 INFO L272 TraceCheckUtils]: 33: Hoare triple {27562#(and (= main_~x~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)); {27524#true} is VALID [2022-04-28 11:24:23,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,661 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {27524#true} {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #70#return; {27562#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-28 11:24:23,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {27562#(and (= main_~x~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; {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 11:24:23,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} assume !false; {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 11:24:23,662 INFO L272 TraceCheckUtils]: 40: Hoare triple {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,662 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27524#true} {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} #62#return; {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 11:24:23,662 INFO L272 TraceCheckUtils]: 45: Hoare triple {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,662 INFO L290 TraceCheckUtils]: 46: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,663 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {27524#true} {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} #64#return; {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 11:24:23,663 INFO L272 TraceCheckUtils]: 50: Hoare triple {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,664 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {27524#true} {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} #66#return; {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 11:24:23,664 INFO L272 TraceCheckUtils]: 55: Hoare triple {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~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)); {27524#true} is VALID [2022-04-28 11:24:23,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,664 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27524#true} {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} #68#return; {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 11:24:23,664 INFO L272 TraceCheckUtils]: 60: Hoare triple {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,665 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27524#true} {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} #70#return; {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 11:24:23,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {27644#(and (= main_~z~0 12) (= 7 main_~y~0) (= main_~x~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; {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:24:23,666 INFO L290 TraceCheckUtils]: 66: Hoare triple {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} assume !false; {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:24:23,666 INFO L272 TraceCheckUtils]: 67: Hoare triple {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,666 INFO L290 TraceCheckUtils]: 68: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,666 INFO L290 TraceCheckUtils]: 70: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,666 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27524#true} {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #62#return; {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:24:23,666 INFO L272 TraceCheckUtils]: 72: Hoare triple {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,666 INFO L290 TraceCheckUtils]: 74: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,666 INFO L290 TraceCheckUtils]: 75: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,667 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {27524#true} {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #64#return; {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:24:23,667 INFO L272 TraceCheckUtils]: 77: Hoare triple {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,667 INFO L290 TraceCheckUtils]: 78: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,667 INFO L290 TraceCheckUtils]: 79: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,667 INFO L290 TraceCheckUtils]: 80: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,668 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {27524#true} {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #66#return; {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:24:23,668 INFO L272 TraceCheckUtils]: 82: Hoare triple {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~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)); {27524#true} is VALID [2022-04-28 11:24:23,668 INFO L290 TraceCheckUtils]: 83: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,668 INFO L290 TraceCheckUtils]: 84: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,668 INFO L290 TraceCheckUtils]: 85: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,668 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {27524#true} {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #68#return; {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:24:23,668 INFO L272 TraceCheckUtils]: 87: Hoare triple {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,668 INFO L290 TraceCheckUtils]: 88: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,668 INFO L290 TraceCheckUtils]: 89: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,668 INFO L290 TraceCheckUtils]: 90: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,669 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {27524#true} {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} #70#return; {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~0 (- 7))))} is VALID [2022-04-28 11:24:23,669 INFO L290 TraceCheckUtils]: 92: Hoare triple {27726#(and (= (+ main_~x~0 (- 7)) 1) (= main_~z~0 (+ (- 1) main_~y~0)) (= 12 (+ main_~y~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; {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:24:23,670 INFO L290 TraceCheckUtils]: 93: Hoare triple {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} assume !false; {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:24:23,670 INFO L272 TraceCheckUtils]: 94: Hoare triple {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,670 INFO L290 TraceCheckUtils]: 95: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,670 INFO L290 TraceCheckUtils]: 96: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,670 INFO L290 TraceCheckUtils]: 97: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,670 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {27524#true} {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #62#return; {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:24:23,670 INFO L272 TraceCheckUtils]: 99: Hoare triple {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,670 INFO L290 TraceCheckUtils]: 100: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,670 INFO L290 TraceCheckUtils]: 101: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,671 INFO L290 TraceCheckUtils]: 102: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,671 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {27524#true} {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #64#return; {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:24:23,671 INFO L272 TraceCheckUtils]: 104: Hoare triple {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,671 INFO L290 TraceCheckUtils]: 105: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,671 INFO L290 TraceCheckUtils]: 106: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,671 INFO L290 TraceCheckUtils]: 107: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,672 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27524#true} {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #66#return; {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:24:23,672 INFO L272 TraceCheckUtils]: 109: Hoare triple {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,672 INFO L290 TraceCheckUtils]: 110: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,672 INFO L290 TraceCheckUtils]: 111: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,672 INFO L290 TraceCheckUtils]: 112: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,672 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {27524#true} {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #68#return; {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:24:23,672 INFO L272 TraceCheckUtils]: 114: Hoare triple {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,672 INFO L290 TraceCheckUtils]: 115: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,672 INFO L290 TraceCheckUtils]: 116: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,672 INFO L290 TraceCheckUtils]: 117: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,673 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {27524#true} {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} #70#return; {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} is VALID [2022-04-28 11:24:23,673 INFO L290 TraceCheckUtils]: 119: Hoare triple {27808#(and (= main_~z~0 24) (= main_~x~0 27) (= main_~y~0 37))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} is VALID [2022-04-28 11:24:23,674 INFO L290 TraceCheckUtils]: 120: Hoare triple {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} assume !false; {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} is VALID [2022-04-28 11:24:23,674 INFO L272 TraceCheckUtils]: 121: Hoare triple {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,674 INFO L290 TraceCheckUtils]: 122: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,674 INFO L290 TraceCheckUtils]: 123: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,674 INFO L290 TraceCheckUtils]: 124: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,674 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {27524#true} {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} #62#return; {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} is VALID [2022-04-28 11:24:23,674 INFO L272 TraceCheckUtils]: 126: Hoare triple {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,675 INFO L290 TraceCheckUtils]: 127: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,675 INFO L290 TraceCheckUtils]: 128: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,675 INFO L290 TraceCheckUtils]: 129: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,675 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27524#true} {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} #64#return; {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} is VALID [2022-04-28 11:24:23,675 INFO L272 TraceCheckUtils]: 131: Hoare triple {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,675 INFO L290 TraceCheckUtils]: 132: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,675 INFO L290 TraceCheckUtils]: 133: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,675 INFO L290 TraceCheckUtils]: 134: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,676 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {27524#true} {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} #66#return; {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} is VALID [2022-04-28 11:24:23,676 INFO L272 TraceCheckUtils]: 136: Hoare triple {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,676 INFO L290 TraceCheckUtils]: 137: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,676 INFO L290 TraceCheckUtils]: 138: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,676 INFO L290 TraceCheckUtils]: 139: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,676 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {27524#true} {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} #68#return; {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} is VALID [2022-04-28 11:24:23,676 INFO L272 TraceCheckUtils]: 141: Hoare triple {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,677 INFO L290 TraceCheckUtils]: 142: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,677 INFO L290 TraceCheckUtils]: 143: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,677 INFO L290 TraceCheckUtils]: 144: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,677 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {27524#true} {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} #70#return; {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 24))} is VALID [2022-04-28 11:24:23,678 INFO L290 TraceCheckUtils]: 146: Hoare triple {27890#(and (= (+ main_~z~0 main_~x~0 (- 6) (* (- 1) main_~y~0)) 27) (= (+ main_~y~0 (* (- 1) main_~z~0) 6) 37) (= (+ main_~z~0 (- 6)) 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; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,678 INFO L290 TraceCheckUtils]: 147: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} assume !false; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,678 INFO L272 TraceCheckUtils]: 148: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,678 INFO L290 TraceCheckUtils]: 149: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,678 INFO L290 TraceCheckUtils]: 150: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,678 INFO L290 TraceCheckUtils]: 151: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,679 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {27524#true} {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} #62#return; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,679 INFO L272 TraceCheckUtils]: 153: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,679 INFO L290 TraceCheckUtils]: 154: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,679 INFO L290 TraceCheckUtils]: 155: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,679 INFO L290 TraceCheckUtils]: 156: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,679 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {27524#true} {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} #64#return; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,679 INFO L272 TraceCheckUtils]: 158: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,679 INFO L290 TraceCheckUtils]: 159: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,679 INFO L290 TraceCheckUtils]: 160: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,679 INFO L290 TraceCheckUtils]: 161: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,680 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {27524#true} {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} #66#return; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,680 INFO L272 TraceCheckUtils]: 163: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,680 INFO L290 TraceCheckUtils]: 164: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,680 INFO L290 TraceCheckUtils]: 165: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,680 INFO L290 TraceCheckUtils]: 166: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,681 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {27524#true} {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} #68#return; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,681 INFO L272 TraceCheckUtils]: 168: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,681 INFO L290 TraceCheckUtils]: 169: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,681 INFO L290 TraceCheckUtils]: 170: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,681 INFO L290 TraceCheckUtils]: 171: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,681 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {27524#true} {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} #70#return; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,682 INFO L290 TraceCheckUtils]: 173: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} assume !(~n~0 <= ~a~0); {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,682 INFO L272 TraceCheckUtils]: 174: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,682 INFO L290 TraceCheckUtils]: 175: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,682 INFO L290 TraceCheckUtils]: 176: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,682 INFO L290 TraceCheckUtils]: 177: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,682 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {27524#true} {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} #72#return; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,682 INFO L272 TraceCheckUtils]: 179: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,682 INFO L290 TraceCheckUtils]: 180: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,682 INFO L290 TraceCheckUtils]: 181: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,682 INFO L290 TraceCheckUtils]: 182: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,683 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {27524#true} {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} #74#return; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,683 INFO L272 TraceCheckUtils]: 184: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:23,683 INFO L290 TraceCheckUtils]: 185: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:23,683 INFO L290 TraceCheckUtils]: 186: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:23,683 INFO L290 TraceCheckUtils]: 187: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:23,684 INFO L284 TraceCheckUtils]: 188: Hoare quadruple {27524#true} {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} #76#return; {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} is VALID [2022-04-28 11:24:23,684 INFO L272 TraceCheckUtils]: 189: Hoare triple {27972#(and (= main_~y~0 (+ 19 (* main_~z~0 2))) (= (+ main_~z~0 89) main_~x~0) (= (+ main_~z~0 (- 12)) 24))} call __VERIFIER_assert((if 0 == 2 * ~y~0 * ~y~0 - 3 * ~x~0 * ~z~0 - 18 * ~x~0 - 10 * ~y~0 + 3 * ~z~0 - 10 then 1 else 0)); {28102#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:23,685 INFO L290 TraceCheckUtils]: 190: Hoare triple {28102#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28106#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:23,685 INFO L290 TraceCheckUtils]: 191: Hoare triple {28106#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27525#false} is VALID [2022-04-28 11:24:23,685 INFO L290 TraceCheckUtils]: 192: Hoare triple {27525#false} assume !false; {27525#false} is VALID [2022-04-28 11:24:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 66 proven. 105 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2022-04-28 11:24:23,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:24:32,575 INFO L290 TraceCheckUtils]: 192: Hoare triple {27525#false} assume !false; {27525#false} is VALID [2022-04-28 11:24:32,576 INFO L290 TraceCheckUtils]: 191: Hoare triple {28106#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27525#false} is VALID [2022-04-28 11:24:32,576 INFO L290 TraceCheckUtils]: 190: Hoare triple {28102#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28106#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:24:32,577 INFO L272 TraceCheckUtils]: 189: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if 0 == 2 * ~y~0 * ~y~0 - 3 * ~x~0 * ~z~0 - 18 * ~x~0 - 10 * ~y~0 + 3 * ~z~0 - 10 then 1 else 0)); {28102#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:24:32,577 INFO L284 TraceCheckUtils]: 188: Hoare quadruple {27524#true} {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #76#return; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,577 INFO L290 TraceCheckUtils]: 187: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,577 INFO L290 TraceCheckUtils]: 186: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,577 INFO L290 TraceCheckUtils]: 185: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,577 INFO L272 TraceCheckUtils]: 184: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:32,578 INFO L284 TraceCheckUtils]: 183: Hoare quadruple {27524#true} {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #74#return; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,578 INFO L290 TraceCheckUtils]: 182: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,578 INFO L290 TraceCheckUtils]: 181: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,578 INFO L290 TraceCheckUtils]: 180: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,578 INFO L272 TraceCheckUtils]: 179: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if 0 == 6 * ~a~0 * ~x~0 - ~x~0 * ~z~0 + 12 * ~x~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:32,578 INFO L284 TraceCheckUtils]: 178: Hoare quadruple {27524#true} {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #72#return; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,579 INFO L290 TraceCheckUtils]: 177: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,579 INFO L290 TraceCheckUtils]: 176: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,579 INFO L290 TraceCheckUtils]: 175: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,579 INFO L272 TraceCheckUtils]: 174: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:32,579 INFO L290 TraceCheckUtils]: 173: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} assume !(~n~0 <= ~a~0); {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,580 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {27524#true} {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #70#return; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,580 INFO L290 TraceCheckUtils]: 171: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,580 INFO L290 TraceCheckUtils]: 170: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,580 INFO L290 TraceCheckUtils]: 169: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,580 INFO L272 TraceCheckUtils]: 168: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:32,580 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {27524#true} {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #68#return; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,580 INFO L290 TraceCheckUtils]: 166: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,580 INFO L290 TraceCheckUtils]: 165: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,580 INFO L290 TraceCheckUtils]: 164: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,580 INFO L272 TraceCheckUtils]: 163: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~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)); {27524#true} is VALID [2022-04-28 11:24:32,581 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {27524#true} {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #66#return; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,581 INFO L290 TraceCheckUtils]: 161: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,581 INFO L290 TraceCheckUtils]: 160: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,581 INFO L290 TraceCheckUtils]: 159: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,581 INFO L272 TraceCheckUtils]: 158: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:32,581 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {27524#true} {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #64#return; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,581 INFO L290 TraceCheckUtils]: 156: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,582 INFO L290 TraceCheckUtils]: 155: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,582 INFO L290 TraceCheckUtils]: 154: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,582 INFO L272 TraceCheckUtils]: 153: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:32,582 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {27524#true} {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} #62#return; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,582 INFO L290 TraceCheckUtils]: 151: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,582 INFO L290 TraceCheckUtils]: 150: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,582 INFO L290 TraceCheckUtils]: 149: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,582 INFO L272 TraceCheckUtils]: 148: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:32,583 INFO L290 TraceCheckUtils]: 147: Hoare triple {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} assume !false; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,812 INFO L290 TraceCheckUtils]: 146: Hoare triple {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ 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; {28122#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:32,812 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {27524#true} {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} #70#return; {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:24:32,813 INFO L290 TraceCheckUtils]: 144: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,813 INFO L290 TraceCheckUtils]: 143: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,813 INFO L290 TraceCheckUtils]: 142: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,813 INFO L272 TraceCheckUtils]: 141: Hoare triple {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ 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)); {27524#true} is VALID [2022-04-28 11:24:32,813 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {27524#true} {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} #68#return; {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:24:32,813 INFO L290 TraceCheckUtils]: 139: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,813 INFO L290 TraceCheckUtils]: 138: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,813 INFO L290 TraceCheckUtils]: 137: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,813 INFO L272 TraceCheckUtils]: 136: Hoare triple {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ 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)); {27524#true} is VALID [2022-04-28 11:24:32,814 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {27524#true} {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} #66#return; {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:24:32,814 INFO L290 TraceCheckUtils]: 134: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,814 INFO L290 TraceCheckUtils]: 133: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,814 INFO L290 TraceCheckUtils]: 132: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,814 INFO L272 TraceCheckUtils]: 131: Hoare triple {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:32,814 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {27524#true} {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} #64#return; {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:24:32,814 INFO L290 TraceCheckUtils]: 129: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,814 INFO L290 TraceCheckUtils]: 128: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,815 INFO L290 TraceCheckUtils]: 127: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,815 INFO L272 TraceCheckUtils]: 126: Hoare triple {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ 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)); {27524#true} is VALID [2022-04-28 11:24:32,815 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {27524#true} {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} #62#return; {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:24:32,815 INFO L290 TraceCheckUtils]: 124: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:32,815 INFO L290 TraceCheckUtils]: 123: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:32,815 INFO L290 TraceCheckUtils]: 122: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:32,815 INFO L272 TraceCheckUtils]: 121: Hoare triple {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:32,816 INFO L290 TraceCheckUtils]: 120: Hoare triple {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} assume !false; {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:24:34,922 WARN L290 TraceCheckUtils]: 119: Hoare triple {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28252#(= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0)))))} is UNKNOWN [2022-04-28 11:24:34,922 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {27524#true} {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} #70#return; {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} is VALID [2022-04-28 11:24:34,922 INFO L290 TraceCheckUtils]: 117: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:34,922 INFO L290 TraceCheckUtils]: 116: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:34,922 INFO L290 TraceCheckUtils]: 115: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:34,922 INFO L272 TraceCheckUtils]: 114: Hoare triple {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:34,923 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {27524#true} {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} #68#return; {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} is VALID [2022-04-28 11:24:34,923 INFO L290 TraceCheckUtils]: 112: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:34,923 INFO L290 TraceCheckUtils]: 111: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:34,923 INFO L290 TraceCheckUtils]: 110: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:34,923 INFO L272 TraceCheckUtils]: 109: Hoare triple {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:34,924 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27524#true} {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} #66#return; {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} is VALID [2022-04-28 11:24:34,924 INFO L290 TraceCheckUtils]: 107: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:34,924 INFO L290 TraceCheckUtils]: 106: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:34,924 INFO L290 TraceCheckUtils]: 105: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:34,924 INFO L272 TraceCheckUtils]: 104: Hoare triple {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:34,924 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {27524#true} {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} #64#return; {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} is VALID [2022-04-28 11:24:34,924 INFO L290 TraceCheckUtils]: 102: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:34,924 INFO L290 TraceCheckUtils]: 101: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:34,924 INFO L290 TraceCheckUtils]: 100: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:34,924 INFO L272 TraceCheckUtils]: 99: Hoare triple {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:34,925 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {27524#true} {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} #62#return; {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} is VALID [2022-04-28 11:24:34,925 INFO L290 TraceCheckUtils]: 97: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:34,925 INFO L290 TraceCheckUtils]: 96: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:34,925 INFO L290 TraceCheckUtils]: 95: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:34,925 INFO L272 TraceCheckUtils]: 94: Hoare triple {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:34,926 INFO L290 TraceCheckUtils]: 93: Hoare triple {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} assume !false; {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} is VALID [2022-04-28 11:24:36,973 WARN L290 TraceCheckUtils]: 92: Hoare triple {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} assume !!(~n~0 <= ~a~0);~n~0 := 1 + ~n~0;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + ~z~0;~z~0 := 6 + ~z~0; {28334#(= (+ (* main_~x~0 18) (* main_~y~0 46) (* main_~z~0 38) 70 (* (* (+ main_~z~0 12) (+ main_~z~0 main_~x~0 (* main_~y~0 2))) 3)) (+ (* (* (+ main_~y~0 6 (* main_~z~0 2)) (+ main_~y~0 6 (* main_~z~0 2))) 2) (* main_~z~0 3) 36))} is UNKNOWN [2022-04-28 11:24:36,974 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {27524#true} {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} #70#return; {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} is VALID [2022-04-28 11:24:36,974 INFO L290 TraceCheckUtils]: 90: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:36,974 INFO L290 TraceCheckUtils]: 89: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:36,974 INFO L290 TraceCheckUtils]: 88: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:36,974 INFO L272 TraceCheckUtils]: 87: Hoare triple {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:36,974 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {27524#true} {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} #68#return; {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} is VALID [2022-04-28 11:24:36,975 INFO L290 TraceCheckUtils]: 85: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:36,975 INFO L290 TraceCheckUtils]: 84: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:36,975 INFO L290 TraceCheckUtils]: 83: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:36,975 INFO L272 TraceCheckUtils]: 82: Hoare triple {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:36,975 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {27524#true} {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} #66#return; {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} is VALID [2022-04-28 11:24:36,975 INFO L290 TraceCheckUtils]: 80: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:36,975 INFO L290 TraceCheckUtils]: 79: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:36,975 INFO L290 TraceCheckUtils]: 78: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:36,975 INFO L272 TraceCheckUtils]: 77: Hoare triple {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:36,976 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {27524#true} {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} #64#return; {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} is VALID [2022-04-28 11:24:36,976 INFO L290 TraceCheckUtils]: 75: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:36,976 INFO L290 TraceCheckUtils]: 74: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:36,976 INFO L290 TraceCheckUtils]: 73: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:36,976 INFO L272 TraceCheckUtils]: 72: Hoare triple {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:36,976 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27524#true} {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} #62#return; {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} is VALID [2022-04-28 11:24:36,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:36,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:36,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:36,977 INFO L272 TraceCheckUtils]: 67: Hoare triple {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:36,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} assume !false; {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} is VALID [2022-04-28 11:24:38,979 WARN L290 TraceCheckUtils]: 65: Hoare triple {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~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; {28416#(= (+ (* main_~z~0 3) (* 2 (* (+ main_~y~0 (* main_~z~0 3) 18) (+ main_~y~0 (* main_~z~0 3) 18))) 54) (+ (* main_~x~0 18) (* 64 main_~y~0) (* 84 main_~z~0) (* 3 (* (+ main_~x~0 6 (* main_~z~0 3) (* main_~y~0 3)) (+ main_~z~0 18))) 298))} is UNKNOWN [2022-04-28 11:24:38,980 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27524#true} {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} #70#return; {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:38,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:38,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:38,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:38,980 INFO L272 TraceCheckUtils]: 60: Hoare triple {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:38,980 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27524#true} {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} #68#return; {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:38,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:38,980 INFO L290 TraceCheckUtils]: 57: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:38,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:38,980 INFO L272 TraceCheckUtils]: 55: Hoare triple {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~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)); {27524#true} is VALID [2022-04-28 11:24:38,981 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {27524#true} {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} #66#return; {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:38,981 INFO L290 TraceCheckUtils]: 53: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:38,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:38,981 INFO L290 TraceCheckUtils]: 51: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:38,981 INFO L272 TraceCheckUtils]: 50: Hoare triple {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:38,982 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {27524#true} {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} #64#return; {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:38,982 INFO L290 TraceCheckUtils]: 48: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:38,982 INFO L290 TraceCheckUtils]: 47: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:38,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:38,982 INFO L272 TraceCheckUtils]: 45: Hoare triple {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:38,982 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27524#true} {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} #62#return; {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:38,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:38,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:38,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:38,982 INFO L272 TraceCheckUtils]: 40: Hoare triple {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:38,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} assume !false; {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} is VALID [2022-04-28 11:24:40,985 WARN L290 TraceCheckUtils]: 38: Hoare triple {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~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; {28498#(= (+ (* main_~x~0 18) (* main_~y~0 82) (* 148 main_~z~0) (* 3 (* (+ main_~z~0 24) (+ main_~x~0 (* main_~z~0 6) (* main_~y~0 4) 24))) 802) (+ 72 (* 2 (* (+ (* main_~z~0 4) main_~y~0 36) (+ (* main_~z~0 4) main_~y~0 36))) (* main_~z~0 3)))} is UNKNOWN [2022-04-28 11:24:40,986 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {27524#true} {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} #70#return; {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} is VALID [2022-04-28 11:24:40,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:40,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:40,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:40,986 INFO L272 TraceCheckUtils]: 33: Hoare triple {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:40,987 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27524#true} {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} #68#return; {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} is VALID [2022-04-28 11:24:40,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:40,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:40,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:40,987 INFO L272 TraceCheckUtils]: 28: Hoare triple {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~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)); {27524#true} is VALID [2022-04-28 11:24:40,987 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {27524#true} {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} #66#return; {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} is VALID [2022-04-28 11:24:40,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:40,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:40,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:40,987 INFO L272 TraceCheckUtils]: 23: Hoare triple {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:40,988 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {27524#true} {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} #64#return; {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} is VALID [2022-04-28 11:24:40,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:40,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:40,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:40,988 INFO L272 TraceCheckUtils]: 18: Hoare triple {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:40,989 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27524#true} {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} #62#return; {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} is VALID [2022-04-28 11:24:40,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:40,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:40,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:40,989 INFO L272 TraceCheckUtils]: 13: Hoare triple {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:40,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} assume !false; {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} is VALID [2022-04-28 11:24:40,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {27524#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {28580#(= (+ (* 2 (* (+ (* 5 main_~z~0) main_~y~0 60) (+ (* 5 main_~z~0) main_~y~0 60))) (* main_~z~0 3) 90) (+ (* main_~x~0 18) (* main_~z~0 230) (* main_~y~0 100) 1690 (* (* (+ (* main_~z~0 10) (* 5 main_~y~0) main_~x~0 60) (+ 30 main_~z~0)) 3)))} is VALID [2022-04-28 11:24:40,990 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27524#true} {27524#true} #60#return; {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {27524#true} assume !(0 == ~cond); {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {27524#true} ~cond := #in~cond; {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {27524#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {27524#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; {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {27524#true} call #t~ret5 := main(); {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27524#true} {27524#true} #84#return; {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {27524#true} assume true; {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {27524#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); {27524#true} is VALID [2022-04-28 11:24:40,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {27524#true} call ULTIMATE.init(); {27524#true} is VALID [2022-04-28 11:24:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 66 proven. 105 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2022-04-28 11:24:40,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:24:40,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535747126] [2022-04-28 11:24:40,992 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:24:40,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843517867] [2022-04-28 11:24:40,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843517867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:24:40,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:24:40,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 11:24:40,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:24:40,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1355368419] [2022-04-28 11:24:40,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1355368419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:24:40,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:24:40,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 11:24:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840364281] [2022-04-28 11:24:40,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:24:40,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 7 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 7 states have call predecessors, (35), 7 states have call successors, (35) Word has length 193 [2022-04-28 11:24:40,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:24:40,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 7 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 7 states have call predecessors, (35), 7 states have call successors, (35) [2022-04-28 11:24:41,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:41,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 11:24:41,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:41,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 11:24:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=174, Unknown=1, NotChecked=0, Total=240 [2022-04-28 11:24:41,083 INFO L87 Difference]: Start difference. First operand 182 states and 188 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 7 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 7 states have call predecessors, (35), 7 states have call successors, (35) [2022-04-28 11:24:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:42,953 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2022-04-28 11:24:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 11:24:42,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 7 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 7 states have call predecessors, (35), 7 states have call successors, (35) Word has length 193 [2022-04-28 11:24:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:24:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 7 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 7 states have call predecessors, (35), 7 states have call successors, (35) [2022-04-28 11:24:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-04-28 11:24:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 7 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 7 states have call predecessors, (35), 7 states have call successors, (35) [2022-04-28 11:24:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2022-04-28 11:24:42,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 130 transitions. [2022-04-28 11:24:43,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:43,089 INFO L225 Difference]: With dead ends: 209 [2022-04-28 11:24:43,089 INFO L226 Difference]: Without dead ends: 197 [2022-04-28 11:24:43,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=69, Invalid=202, Unknown=1, NotChecked=0, Total=272 [2022-04-28 11:24:43,089 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 5 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 11:24:43,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 390 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 11:24:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-28 11:24:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-04-28 11:24:43,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:24:43,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 197 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 119 states have internal predecessors, (120), 44 states have call successors, (44), 35 states have call predecessors, (44), 34 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-28 11:24:43,385 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 197 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 119 states have internal predecessors, (120), 44 states have call successors, (44), 35 states have call predecessors, (44), 34 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-28 11:24:43,385 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 197 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 119 states have internal predecessors, (120), 44 states have call successors, (44), 35 states have call predecessors, (44), 34 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-28 11:24:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:43,387 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2022-04-28 11:24:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 206 transitions. [2022-04-28 11:24:43,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:43,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:43,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 119 states have internal predecessors, (120), 44 states have call successors, (44), 35 states have call predecessors, (44), 34 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 197 states. [2022-04-28 11:24:43,388 INFO L87 Difference]: Start difference. First operand has 197 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 119 states have internal predecessors, (120), 44 states have call successors, (44), 35 states have call predecessors, (44), 34 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand 197 states. [2022-04-28 11:24:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:24:43,390 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2022-04-28 11:24:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 206 transitions. [2022-04-28 11:24:43,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:24:43,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:24:43,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:24:43,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:24:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 119 states have internal predecessors, (120), 44 states have call successors, (44), 35 states have call predecessors, (44), 34 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-28 11:24:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 206 transitions. [2022-04-28 11:24:43,394 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 206 transitions. Word has length 193 [2022-04-28 11:24:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:24:43,394 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 206 transitions. [2022-04-28 11:24:43,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 7 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (35), 7 states have call predecessors, (35), 7 states have call successors, (35) [2022-04-28 11:24:43,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 197 states and 206 transitions. [2022-04-28 11:24:48,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 204 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 11:24:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 206 transitions. [2022-04-28 11:24:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-04-28 11:24:48,924 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 11:24:48,924 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 38, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 11:24:48,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 11:24:49,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:49,125 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 11:24:49,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 11:24:49,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1606256116, now seen corresponding path program 5 times [2022-04-28 11:24:49,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 11:24:49,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334136763] [2022-04-28 11:24:49,378 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 11:24:49,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 11:24:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1606256116, now seen corresponding path program 6 times [2022-04-28 11:24:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 11:24:49,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110081960] [2022-04-28 11:24:49,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 11:24:49,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 11:24:49,386 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 11:24:49,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1754337921] [2022-04-28 11:24:49,387 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 11:24:49,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 11:24:49,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 11:24:49,400 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 11:24:49,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 11:24:50,259 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 11:24:50,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 11:24:50,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 11:24:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 11:24:51,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 11:25:35,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {29905#true} call ULTIMATE.init(); {29905#true} is VALID [2022-04-28 11:25:35,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {29905#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); {29913#(= (select (select |#memory_int| 1) 1) 0)} is VALID [2022-04-28 11:25:35,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {29913#(= (select (select |#memory_int| 1) 1) 0)} assume true; {29913#(= (select (select |#memory_int| 1) 1) 0)} is VALID [2022-04-28 11:25:35,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29913#(= (select (select |#memory_int| 1) 1) 0)} {29905#true} #84#return; {29905#true} is VALID [2022-04-28 11:25:35,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {29905#true} call #t~ret5 := main(); {29905#true} is VALID [2022-04-28 11:25:35,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {29905#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; {29926#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} is VALID [2022-04-28 11:25:35,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {29926#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29905#true} {29926#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} #60#return; {29926#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} is VALID [2022-04-28 11:25:35,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {29926#(or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0)))} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} is VALID [2022-04-28 11:25:35,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} assume !false; {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} is VALID [2022-04-28 11:25:35,578 INFO L272 TraceCheckUtils]: 13: Hoare triple {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,578 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29905#true} {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} #62#return; {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} is VALID [2022-04-28 11:25:35,578 INFO L272 TraceCheckUtils]: 18: Hoare triple {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,579 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29905#true} {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} #64#return; {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} is VALID [2022-04-28 11:25:35,579 INFO L272 TraceCheckUtils]: 23: Hoare triple {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,579 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29905#true} {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} #66#return; {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} is VALID [2022-04-28 11:25:35,580 INFO L272 TraceCheckUtils]: 28: Hoare triple {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 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)); {29905#true} is VALID [2022-04-28 11:25:35,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,580 INFO L290 TraceCheckUtils]: 31: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,580 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29905#true} {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} #68#return; {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} is VALID [2022-04-28 11:25:35,580 INFO L272 TraceCheckUtils]: 33: Hoare triple {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,581 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29905#true} {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} #70#return; {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 main_~n~0))} is VALID [2022-04-28 11:25:35,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {29945#(and (or (and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0)) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) (* (- 1) main_~a~0)) 65536) 1)) (< main_~a~0 0))) (<= 0 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; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} assume !false; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,582 INFO L272 TraceCheckUtils]: 40: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,583 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #62#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,583 INFO L272 TraceCheckUtils]: 45: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,583 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #64#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,583 INFO L272 TraceCheckUtils]: 50: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,584 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #66#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,584 INFO L272 TraceCheckUtils]: 55: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 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)); {29905#true} is VALID [2022-04-28 11:25:35,584 INFO L290 TraceCheckUtils]: 56: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,584 INFO L290 TraceCheckUtils]: 57: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,584 INFO L290 TraceCheckUtils]: 58: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,584 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #68#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,585 INFO L272 TraceCheckUtils]: 60: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,585 INFO L290 TraceCheckUtils]: 62: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,585 INFO L290 TraceCheckUtils]: 63: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,585 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #70#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,585 INFO L290 TraceCheckUtils]: 65: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 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; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,586 INFO L290 TraceCheckUtils]: 66: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} assume !false; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,586 INFO L272 TraceCheckUtils]: 67: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,586 INFO L290 TraceCheckUtils]: 69: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,586 INFO L290 TraceCheckUtils]: 70: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,586 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #62#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,586 INFO L272 TraceCheckUtils]: 72: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,586 INFO L290 TraceCheckUtils]: 73: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,587 INFO L290 TraceCheckUtils]: 74: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,587 INFO L290 TraceCheckUtils]: 75: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,587 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #64#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,587 INFO L272 TraceCheckUtils]: 77: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,587 INFO L290 TraceCheckUtils]: 78: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,587 INFO L290 TraceCheckUtils]: 79: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,587 INFO L290 TraceCheckUtils]: 80: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,588 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #66#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,588 INFO L272 TraceCheckUtils]: 82: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 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)); {29905#true} is VALID [2022-04-28 11:25:35,588 INFO L290 TraceCheckUtils]: 83: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,588 INFO L290 TraceCheckUtils]: 84: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,588 INFO L290 TraceCheckUtils]: 85: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,588 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #68#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,588 INFO L272 TraceCheckUtils]: 87: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,588 INFO L290 TraceCheckUtils]: 88: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,588 INFO L290 TraceCheckUtils]: 89: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,588 INFO L290 TraceCheckUtils]: 90: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,589 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #70#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,589 INFO L290 TraceCheckUtils]: 92: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 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; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,589 INFO L290 TraceCheckUtils]: 93: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} assume !false; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,590 INFO L272 TraceCheckUtils]: 94: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,590 INFO L290 TraceCheckUtils]: 95: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,590 INFO L290 TraceCheckUtils]: 96: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,590 INFO L290 TraceCheckUtils]: 97: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,590 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #62#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,590 INFO L272 TraceCheckUtils]: 99: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,590 INFO L290 TraceCheckUtils]: 100: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,590 INFO L290 TraceCheckUtils]: 101: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,591 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #64#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,591 INFO L272 TraceCheckUtils]: 104: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,591 INFO L290 TraceCheckUtils]: 105: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,591 INFO L290 TraceCheckUtils]: 106: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,591 INFO L290 TraceCheckUtils]: 107: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,591 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #66#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,591 INFO L272 TraceCheckUtils]: 109: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 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)); {29905#true} is VALID [2022-04-28 11:25:35,591 INFO L290 TraceCheckUtils]: 110: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,591 INFO L290 TraceCheckUtils]: 111: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,592 INFO L290 TraceCheckUtils]: 112: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,592 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #68#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,592 INFO L272 TraceCheckUtils]: 114: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,592 INFO L290 TraceCheckUtils]: 115: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,592 INFO L290 TraceCheckUtils]: 116: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,592 INFO L290 TraceCheckUtils]: 117: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,593 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #70#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,593 INFO L290 TraceCheckUtils]: 119: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 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; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,593 INFO L290 TraceCheckUtils]: 120: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} assume !false; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,593 INFO L272 TraceCheckUtils]: 121: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,593 INFO L290 TraceCheckUtils]: 122: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,593 INFO L290 TraceCheckUtils]: 123: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,593 INFO L290 TraceCheckUtils]: 124: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,594 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #62#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,594 INFO L272 TraceCheckUtils]: 126: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,594 INFO L290 TraceCheckUtils]: 127: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,594 INFO L290 TraceCheckUtils]: 128: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,594 INFO L290 TraceCheckUtils]: 129: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,594 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #64#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,595 INFO L272 TraceCheckUtils]: 131: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,595 INFO L290 TraceCheckUtils]: 132: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,595 INFO L290 TraceCheckUtils]: 133: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,595 INFO L290 TraceCheckUtils]: 134: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,595 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #66#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,595 INFO L272 TraceCheckUtils]: 136: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 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)); {29905#true} is VALID [2022-04-28 11:25:35,595 INFO L290 TraceCheckUtils]: 137: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,595 INFO L290 TraceCheckUtils]: 138: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,595 INFO L290 TraceCheckUtils]: 139: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,596 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {29905#true} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #68#return; {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,596 INFO L272 TraceCheckUtils]: 141: Hoare triple {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,596 INFO L290 TraceCheckUtils]: 142: Hoare triple {29905#true} ~cond := #in~cond; {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:35,596 INFO L290 TraceCheckUtils]: 143: Hoare triple {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,597 INFO L290 TraceCheckUtils]: 144: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,597 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30027#(and (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #70#return; {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,599 INFO L290 TraceCheckUtils]: 146: Hoare triple {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 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; {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,600 INFO L290 TraceCheckUtils]: 147: Hoare triple {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} assume !false; {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,600 INFO L272 TraceCheckUtils]: 148: Hoare triple {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,600 INFO L290 TraceCheckUtils]: 149: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,600 INFO L290 TraceCheckUtils]: 150: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,600 INFO L290 TraceCheckUtils]: 151: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,600 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {29905#true} {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} #62#return; {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,600 INFO L272 TraceCheckUtils]: 153: Hoare triple {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,600 INFO L290 TraceCheckUtils]: 154: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,601 INFO L290 TraceCheckUtils]: 155: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,601 INFO L290 TraceCheckUtils]: 156: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,601 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {29905#true} {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} #64#return; {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,601 INFO L272 TraceCheckUtils]: 158: Hoare triple {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,601 INFO L290 TraceCheckUtils]: 159: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,601 INFO L290 TraceCheckUtils]: 160: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,601 INFO L290 TraceCheckUtils]: 161: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,602 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {29905#true} {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} #66#return; {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,602 INFO L272 TraceCheckUtils]: 163: Hoare triple {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 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)); {29905#true} is VALID [2022-04-28 11:25:35,602 INFO L290 TraceCheckUtils]: 164: Hoare triple {29905#true} ~cond := #in~cond; {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:35,602 INFO L290 TraceCheckUtils]: 165: Hoare triple {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,603 INFO L290 TraceCheckUtils]: 166: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,603 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30351#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0))} #68#return; {30418#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,603 INFO L272 TraceCheckUtils]: 168: Hoare triple {30418#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,604 INFO L290 TraceCheckUtils]: 169: Hoare triple {29905#true} ~cond := #in~cond; {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:35,604 INFO L290 TraceCheckUtils]: 170: Hoare triple {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,604 INFO L290 TraceCheckUtils]: 171: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,604 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30418#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (< main_~a~0 65536) (<= 0 main_~a~0))} #70#return; {30418#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,609 INFO L290 TraceCheckUtils]: 173: Hoare triple {30418#(and (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~x~0 18) (* main_~y~0 12) 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (< main_~a~0 65536) (<= 0 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; {30437#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,609 INFO L290 TraceCheckUtils]: 174: Hoare triple {30437#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} assume !false; {30437#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} is VALID [2022-04-28 11:25:35,609 INFO L272 TraceCheckUtils]: 175: Hoare triple {30437#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,610 INFO L290 TraceCheckUtils]: 176: Hoare triple {29905#true} ~cond := #in~cond; {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:35,610 INFO L290 TraceCheckUtils]: 177: Hoare triple {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,610 INFO L290 TraceCheckUtils]: 178: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,612 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30437#(and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0))} #62#return; {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:25:35,612 INFO L272 TraceCheckUtils]: 180: Hoare triple {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,612 INFO L290 TraceCheckUtils]: 181: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,613 INFO L290 TraceCheckUtils]: 182: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,613 INFO L290 TraceCheckUtils]: 183: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,613 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {29905#true} {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #64#return; {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:25:35,613 INFO L272 TraceCheckUtils]: 185: Hoare triple {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,613 INFO L290 TraceCheckUtils]: 186: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,613 INFO L290 TraceCheckUtils]: 187: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,613 INFO L290 TraceCheckUtils]: 188: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,614 INFO L284 TraceCheckUtils]: 189: Hoare quadruple {29905#true} {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #66#return; {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:25:35,614 INFO L272 TraceCheckUtils]: 190: Hoare triple {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,614 INFO L290 TraceCheckUtils]: 191: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,614 INFO L290 TraceCheckUtils]: 192: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,614 INFO L290 TraceCheckUtils]: 193: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,614 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {29905#true} {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #68#return; {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:25:35,614 INFO L272 TraceCheckUtils]: 195: Hoare triple {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,615 INFO L290 TraceCheckUtils]: 196: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,615 INFO L290 TraceCheckUtils]: 197: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,615 INFO L290 TraceCheckUtils]: 198: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,615 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {29905#true} {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #70#return; {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:25:35,616 INFO L290 TraceCheckUtils]: 200: Hoare triple {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} assume !(~n~0 <= ~a~0); {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:25:35,616 INFO L272 TraceCheckUtils]: 201: Hoare triple {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 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)); {29905#true} is VALID [2022-04-28 11:25:35,616 INFO L290 TraceCheckUtils]: 202: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:25:35,616 INFO L290 TraceCheckUtils]: 203: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:25:35,616 INFO L290 TraceCheckUtils]: 204: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:25:35,616 INFO L284 TraceCheckUtils]: 205: Hoare quadruple {29905#true} {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #72#return; {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:25:35,616 INFO L272 TraceCheckUtils]: 206: Hoare triple {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 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)); {29905#true} is VALID [2022-04-28 11:25:35,617 INFO L290 TraceCheckUtils]: 207: Hoare triple {29905#true} ~cond := #in~cond; {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:35,617 INFO L290 TraceCheckUtils]: 208: Hoare triple {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,617 INFO L290 TraceCheckUtils]: 209: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,618 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30456#(and (= (+ (* main_~x~0 18) (* main_~z~0 6) (- 30) (* main_~y~0 (- 6))) (+ (- 12) (* main_~z~0 2) (* (+ main_~z~0 (- 6)) (+ main_~y~0 (* (- 1) main_~z~0) 6)))) (= (+ (* main_~y~0 12) (* main_~z~0 (- 6)) 36) (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) 12)) (<= (mod main_~a~0 65536) 32767) (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (= (mod main_~z~0 6) 0))} #74#return; {30550#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0) (= (mod main_~z~0 6) 0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} is VALID [2022-04-28 11:25:35,618 INFO L272 TraceCheckUtils]: 211: Hoare triple {30550#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0) (= (mod main_~z~0 6) 0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} call __VERIFIER_assert((if 0 == ~a~0 * ~z~0 - 6 * ~a~0 - 2 * ~y~0 + 2 * ~z~0 - 10 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:25:35,618 INFO L290 TraceCheckUtils]: 212: Hoare triple {29905#true} ~cond := #in~cond; {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:35,619 INFO L290 TraceCheckUtils]: 213: Hoare triple {30340#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,619 INFO L290 TraceCheckUtils]: 214: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:25:35,633 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30550#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (< main_~a~0 65536) (<= 0 main_~a~0) (= (mod main_~z~0 6) 0) (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6))))} #76#return; {30566#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (exists ((aux_mod_main_~a~0_21 Int) (aux_div_main_~a~0_21 Int)) (and (<= aux_mod_main_~a~0_21 32767) (= (+ (* main_~z~0 aux_mod_main_~a~0_21) (* (* main_~z~0 aux_div_main_~a~0_21) 65536) (* main_~z~0 2)) (+ (* 393216 aux_div_main_~a~0_21) (* main_~y~0 2) (* 6 aux_mod_main_~a~0_21) 10)) (<= 0 aux_mod_main_~a~0_21) (<= 0 (+ (* 65536 aux_div_main_~a~0_21) aux_mod_main_~a~0_21)) (< (+ (* 65536 aux_div_main_~a~0_21) aux_mod_main_~a~0_21) 65536))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} is VALID [2022-04-28 11:25:35,637 INFO L272 TraceCheckUtils]: 216: Hoare triple {30566#(and (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) (* main_~z~0 main_~z~0) 18)) (exists ((aux_mod_main_~a~0_21 Int) (aux_div_main_~a~0_21 Int)) (and (<= aux_mod_main_~a~0_21 32767) (= (+ (* main_~z~0 aux_mod_main_~a~0_21) (* (* main_~z~0 aux_div_main_~a~0_21) 65536) (* main_~z~0 2)) (+ (* 393216 aux_div_main_~a~0_21) (* main_~y~0 2) (* 6 aux_mod_main_~a~0_21) 10)) (<= 0 aux_mod_main_~a~0_21) (<= 0 (+ (* 65536 aux_div_main_~a~0_21) aux_mod_main_~a~0_21)) (< (+ (* 65536 aux_div_main_~a~0_21) aux_mod_main_~a~0_21) 65536))) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (mod main_~z~0 6) 0))} call __VERIFIER_assert((if 0 == 2 * ~y~0 * ~y~0 - 3 * ~x~0 * ~z~0 - 18 * ~x~0 - 10 * ~y~0 + 3 * ~z~0 - 10 then 1 else 0)); {30570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:25:35,637 INFO L290 TraceCheckUtils]: 217: Hoare triple {30570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:25:35,638 INFO L290 TraceCheckUtils]: 218: Hoare triple {30574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29906#false} is VALID [2022-04-28 11:25:35,638 INFO L290 TraceCheckUtils]: 219: Hoare triple {29906#false} assume !false; {29906#false} is VALID [2022-04-28 11:25:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 643 proven. 117 refuted. 0 times theorem prover too weak. 2275 trivial. 0 not checked. [2022-04-28 11:25:35,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 11:26:05,121 WARN L232 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 11:26:31,253 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (* 2 c_main_~z~0)) (.cse3 (* c_main_~y~0 c_main_~z~0))) (let ((.cse4 (div (+ .cse2 (- 6) (* (- 12) c_main_~y~0) .cse3) 18))) (let ((.cse1 (* 6 c_main_~y~0)) (.cse0 (* c_main_~z~0 c_main_~z~0)) (.cse5 (* .cse4 c_main_~z~0))) (or (not (= (+ 6 (* 6 c_main_~n~0)) c_main_~z~0)) (not (= (+ (* 6 c_main_~z~0) (* 12 c_main_~y~0)) (+ 12 .cse0))) (not (= (* 2 c_main_~y~0) (+ (* c_main_~a~0 c_main_~z~0) 2))) (not (= 0 (mod (+ .cse1 .cse2 12 .cse3) 18))) (not (= (+ .cse1 (* 6 (* .cse4 c_main_~a~0)) (* 6 (* c_main_~y~0 c_main_~a~0)) (* .cse4 6)) (+ .cse5 .cse3))) (= (+ (* 2 .cse0) (* 2 (* c_main_~y~0 c_main_~y~0)) 8 .cse3) (+ (* .cse4 36) (* .cse5 3) (* 46 c_main_~y~0) (* 7 c_main_~z~0))))))) is different from true [2022-04-28 11:28:00,402 INFO L290 TraceCheckUtils]: 219: Hoare triple {29906#false} assume !false; {29906#false} is VALID [2022-04-28 11:28:00,403 INFO L290 TraceCheckUtils]: 218: Hoare triple {30574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29906#false} is VALID [2022-04-28 11:28:00,403 INFO L290 TraceCheckUtils]: 217: Hoare triple {30570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 11:28:00,404 INFO L272 TraceCheckUtils]: 216: Hoare triple {30590#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} call __VERIFIER_assert((if 0 == 2 * ~y~0 * ~y~0 - 3 * ~x~0 * ~z~0 - 18 * ~x~0 - 10 * ~y~0 + 3 * ~z~0 - 10 then 1 else 0)); {30570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 11:28:00,404 INFO L284 TraceCheckUtils]: 215: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30594#(or (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} #76#return; {30590#(= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3)))} is VALID [2022-04-28 11:28:00,404 INFO L290 TraceCheckUtils]: 214: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:00,405 INFO L290 TraceCheckUtils]: 213: Hoare triple {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:00,405 INFO L290 TraceCheckUtils]: 212: Hoare triple {29905#true} ~cond := #in~cond; {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:28:00,405 INFO L272 TraceCheckUtils]: 211: Hoare triple {30594#(or (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* 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)); {29905#true} is VALID [2022-04-28 11:28:00,406 INFO L284 TraceCheckUtils]: 210: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} #74#return; {30594#(or (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is VALID [2022-04-28 11:28:00,406 INFO L290 TraceCheckUtils]: 209: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:00,406 INFO L290 TraceCheckUtils]: 208: Hoare triple {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:00,407 INFO L290 TraceCheckUtils]: 207: Hoare triple {29905#true} ~cond := #in~cond; {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:28:00,407 INFO L272 TraceCheckUtils]: 206: Hoare triple {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* 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)); {29905#true} is VALID [2022-04-28 11:28:00,407 INFO L284 TraceCheckUtils]: 205: Hoare quadruple {29905#true} {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} #72#return; {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is VALID [2022-04-28 11:28:00,407 INFO L290 TraceCheckUtils]: 204: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:00,407 INFO L290 TraceCheckUtils]: 203: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:00,407 INFO L290 TraceCheckUtils]: 202: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:00,407 INFO L272 TraceCheckUtils]: 201: Hoare triple {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* 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)); {29905#true} is VALID [2022-04-28 11:28:00,408 INFO L290 TraceCheckUtils]: 200: Hoare triple {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} assume !(~n~0 <= ~a~0); {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is VALID [2022-04-28 11:28:00,408 INFO L284 TraceCheckUtils]: 199: Hoare quadruple {29905#true} {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} #70#return; {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is VALID [2022-04-28 11:28:00,408 INFO L290 TraceCheckUtils]: 198: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:00,408 INFO L290 TraceCheckUtils]: 197: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:00,409 INFO L290 TraceCheckUtils]: 196: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:00,409 INFO L272 TraceCheckUtils]: 195: Hoare triple {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:00,409 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {29905#true} {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} #68#return; {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is VALID [2022-04-28 11:28:00,409 INFO L290 TraceCheckUtils]: 193: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:00,409 INFO L290 TraceCheckUtils]: 192: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:00,409 INFO L290 TraceCheckUtils]: 191: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:00,409 INFO L272 TraceCheckUtils]: 190: Hoare triple {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~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)); {29905#true} is VALID [2022-04-28 11:28:00,410 INFO L284 TraceCheckUtils]: 189: Hoare quadruple {29905#true} {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} #66#return; {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is VALID [2022-04-28 11:28:00,410 INFO L290 TraceCheckUtils]: 188: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:00,410 INFO L290 TraceCheckUtils]: 187: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:00,410 INFO L290 TraceCheckUtils]: 186: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:00,410 INFO L272 TraceCheckUtils]: 185: Hoare triple {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:00,410 INFO L284 TraceCheckUtils]: 184: Hoare quadruple {29905#true} {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} #64#return; {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is VALID [2022-04-28 11:28:00,410 INFO L290 TraceCheckUtils]: 183: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:00,411 INFO L290 TraceCheckUtils]: 182: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:00,411 INFO L290 TraceCheckUtils]: 181: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:00,411 INFO L272 TraceCheckUtils]: 180: Hoare triple {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:00,411 INFO L284 TraceCheckUtils]: 179: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30705#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} #62#return; {30611#(or (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is VALID [2022-04-28 11:28:00,412 INFO L290 TraceCheckUtils]: 178: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:00,412 INFO L290 TraceCheckUtils]: 177: Hoare triple {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:00,412 INFO L290 TraceCheckUtils]: 176: Hoare triple {29905#true} ~cond := #in~cond; {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:28:00,412 INFO L272 TraceCheckUtils]: 175: Hoare triple {30705#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* 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)); {29905#true} is VALID [2022-04-28 11:28:00,413 INFO L290 TraceCheckUtils]: 174: Hoare triple {30705#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} assume !false; {30705#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is VALID [2022-04-28 11:28:02,425 WARN L290 TraceCheckUtils]: 173: Hoare triple {30724#(or (not (<= main_~n~0 main_~a~0)) (not (= (+ (* 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)))) (= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0))))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12))) (not (= (+ (* main_~n~0 6) 12) (+ 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; {30705#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (* main_~z~0 main_~x~0) (+ (* main_~x~0 12) (* (* main_~a~0 main_~x~0) 6)))) (= (+ (* main_~x~0 18) (* (* main_~z~0 main_~x~0) 3) (* main_~y~0 10) 10) (+ (* 2 (* main_~y~0 main_~y~0)) (* main_~z~0 3))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) 10) (+ (* main_~a~0 main_~z~0) (* main_~z~0 2)))))} is UNKNOWN [2022-04-28 11:28:02,427 INFO L284 TraceCheckUtils]: 172: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30728#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (* main_~z~0 main_~x~0) 3) (* main_~x~0 36)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* main_~z~0 main_~x~0) (* main_~z~0 main_~y~0)) (+ (* (* main_~a~0 main_~x~0) 6) (* main_~x~0 6) (* main_~y~0 6) (* 6 (* main_~a~0 main_~y~0))))))} #70#return; {30724#(or (not (<= main_~n~0 main_~a~0)) (not (= (+ (* 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)))) (= (+ (* main_~x~0 18) (* main_~z~0 10) (* main_~y~0 28) 10 (* 3 (* (+ main_~z~0 6) (+ main_~y~0 main_~x~0)))) (+ (* main_~z~0 3) 18 (* 2 (* (+ main_~z~0 main_~y~0) (+ main_~z~0 main_~y~0))))) (not (= (+ (* main_~a~0 6) (* main_~y~0 2) (* main_~z~0 2) 10) (+ (* main_~a~0 (+ main_~z~0 6)) (* main_~z~0 2) 12))) (not (= (+ (* main_~n~0 6) 12) (+ main_~z~0 6))))} is VALID [2022-04-28 11:28:02,427 INFO L290 TraceCheckUtils]: 171: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:02,427 INFO L290 TraceCheckUtils]: 170: Hoare triple {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:02,427 INFO L290 TraceCheckUtils]: 169: Hoare triple {29905#true} ~cond := #in~cond; {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:28:02,428 INFO L272 TraceCheckUtils]: 168: Hoare triple {30728#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (* main_~z~0 main_~x~0) 3) (* main_~x~0 36)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* main_~z~0 main_~x~0) (* main_~z~0 main_~y~0)) (+ (* (* main_~a~0 main_~x~0) 6) (* main_~x~0 6) (* main_~y~0 6) (* 6 (* main_~a~0 main_~y~0))))))} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:04,433 WARN L284 TraceCheckUtils]: 167: Hoare quadruple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} #68#return; {30728#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (* main_~z~0 main_~x~0) 3) (* main_~x~0 36)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* main_~z~0 main_~x~0) (* main_~z~0 main_~y~0)) (+ (* (* main_~a~0 main_~x~0) 6) (* main_~x~0 6) (* main_~y~0 6) (* 6 (* main_~a~0 main_~y~0))))))} is UNKNOWN [2022-04-28 11:28:04,433 INFO L290 TraceCheckUtils]: 166: Hoare triple {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:04,433 INFO L290 TraceCheckUtils]: 165: Hoare triple {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 11:28:04,434 INFO L290 TraceCheckUtils]: 164: Hoare triple {29905#true} ~cond := #in~cond; {30604#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 11:28:04,434 INFO L272 TraceCheckUtils]: 163: Hoare triple {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* 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)); {29905#true} is VALID [2022-04-28 11:28:04,434 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {29905#true} {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} #66#return; {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:28:04,434 INFO L290 TraceCheckUtils]: 161: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:04,434 INFO L290 TraceCheckUtils]: 160: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:04,435 INFO L290 TraceCheckUtils]: 159: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:04,435 INFO L272 TraceCheckUtils]: 158: Hoare triple {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:04,435 INFO L284 TraceCheckUtils]: 157: Hoare quadruple {29905#true} {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} #64#return; {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:28:04,435 INFO L290 TraceCheckUtils]: 156: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:04,435 INFO L290 TraceCheckUtils]: 155: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:04,435 INFO L290 TraceCheckUtils]: 154: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:04,435 INFO L272 TraceCheckUtils]: 153: Hoare triple {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* 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)); {29905#true} is VALID [2022-04-28 11:28:04,436 INFO L284 TraceCheckUtils]: 152: Hoare quadruple {29905#true} {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} #62#return; {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:28:04,436 INFO L290 TraceCheckUtils]: 151: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:04,436 INFO L290 TraceCheckUtils]: 150: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:04,436 INFO L290 TraceCheckUtils]: 149: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:04,436 INFO L272 TraceCheckUtils]: 148: Hoare triple {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:04,437 INFO L290 TraceCheckUtils]: 147: Hoare triple {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} assume !false; {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} is VALID [2022-04-28 11:28:06,691 WARN L290 TraceCheckUtils]: 146: Hoare triple {29905#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; {30744#(or (= (+ (* 7 main_~z~0) (* main_~y~0 46) (* (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18) 36) (* (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 3)) (+ (* 2 (* main_~y~0 main_~y~0)) (* (* main_~z~0 main_~z~0) 2) 8 (* main_~z~0 main_~y~0))) (not (= (mod (+ (* main_~y~0 6) (* main_~z~0 2) 12 (* main_~z~0 main_~y~0)) 18) 0)) (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (not (= (+ (* main_~a~0 main_~z~0) 2) (* main_~y~0 2))) (not (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6)))) (not (= (+ (* 6 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~y~0 6) (* (* main_~a~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) 6) (* 6 (* main_~a~0 main_~y~0))) (+ (* main_~z~0 (div (+ (- 6) (* main_~y~0 (- 12)) (* main_~z~0 2) (* main_~z~0 main_~y~0)) 18)) (* main_~z~0 main_~y~0)))))} is UNKNOWN [2022-04-28 11:28:06,691 INFO L284 TraceCheckUtils]: 145: Hoare quadruple {29905#true} {29905#true} #70#return; {29905#true} is VALID [2022-04-28 11:28:06,691 INFO L290 TraceCheckUtils]: 144: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,691 INFO L290 TraceCheckUtils]: 143: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,691 INFO L290 TraceCheckUtils]: 142: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,691 INFO L272 TraceCheckUtils]: 141: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {29905#true} {29905#true} #68#return; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 139: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 138: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 137: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L272 TraceCheckUtils]: 136: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {29905#true} {29905#true} #66#return; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 134: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 133: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 132: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L272 TraceCheckUtils]: 131: Hoare triple {29905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29905#true} {29905#true} #64#return; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 129: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 128: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 127: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L272 TraceCheckUtils]: 126: Hoare triple {29905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {29905#true} {29905#true} #62#return; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 124: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 123: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L290 TraceCheckUtils]: 122: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,692 INFO L272 TraceCheckUtils]: 121: Hoare triple {29905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 120: Hoare triple {29905#true} assume !false; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 119: Hoare triple {29905#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; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {29905#true} {29905#true} #70#return; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 117: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 116: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 115: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L272 TraceCheckUtils]: 114: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {29905#true} {29905#true} #68#return; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 112: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 111: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 110: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L272 TraceCheckUtils]: 109: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29905#true} {29905#true} #66#return; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 107: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 106: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 105: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L272 TraceCheckUtils]: 104: Hoare triple {29905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {29905#true} {29905#true} #64#return; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 102: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 101: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,693 INFO L290 TraceCheckUtils]: 100: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L272 TraceCheckUtils]: 99: Hoare triple {29905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29905#true} {29905#true} #62#return; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 97: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 96: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 95: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L272 TraceCheckUtils]: 94: Hoare triple {29905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 93: Hoare triple {29905#true} assume !false; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 92: Hoare triple {29905#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; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {29905#true} {29905#true} #70#return; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 90: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 89: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 88: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L272 TraceCheckUtils]: 87: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {29905#true} {29905#true} #68#return; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 85: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 84: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 83: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L272 TraceCheckUtils]: 82: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29905#true} {29905#true} #66#return; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 80: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,694 INFO L290 TraceCheckUtils]: 79: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 78: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L272 TraceCheckUtils]: 77: Hoare triple {29905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {29905#true} {29905#true} #64#return; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 75: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 74: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 73: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L272 TraceCheckUtils]: 72: Hoare triple {29905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29905#true} {29905#true} #62#return; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 70: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 69: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L272 TraceCheckUtils]: 67: Hoare triple {29905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 66: Hoare triple {29905#true} assume !false; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 65: Hoare triple {29905#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; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29905#true} {29905#true} #70#return; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 63: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 62: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 61: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L272 TraceCheckUtils]: 60: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29905#true} {29905#true} #68#return; {29905#true} is VALID [2022-04-28 11:28:06,695 INFO L290 TraceCheckUtils]: 58: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 57: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L272 TraceCheckUtils]: 55: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29905#true} {29905#true} #66#return; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L272 TraceCheckUtils]: 50: Hoare triple {29905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {29905#true} {29905#true} #64#return; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 47: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 46: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L272 TraceCheckUtils]: 45: Hoare triple {29905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {29905#true} {29905#true} #62#return; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L272 TraceCheckUtils]: 40: Hoare triple {29905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {29905#true} assume !false; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {29905#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; {29905#true} is VALID [2022-04-28 11:28:06,696 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {29905#true} {29905#true} #70#return; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L272 TraceCheckUtils]: 33: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == 12 + (~z~0 * ~z~0 - 12 * ~y~0 - 6 * ~z~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {29905#true} {29905#true} #68#return; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L272 TraceCheckUtils]: 28: Hoare triple {29905#true} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29905#true} {29905#true} #66#return; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L272 TraceCheckUtils]: 23: Hoare triple {29905#true} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {29905#true} {29905#true} #64#return; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L272 TraceCheckUtils]: 18: Hoare triple {29905#true} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29905#true} {29905#true} #62#return; {29905#true} is VALID [2022-04-28 11:28:06,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L272 TraceCheckUtils]: 13: Hoare triple {29905#true} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {29905#true} assume !false; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {29905#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29905#true} {29905#true} #60#return; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {29905#true} assume !(0 == ~cond); {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {29905#true} ~cond := #in~cond; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {29905#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {29905#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; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {29905#true} call #t~ret5 := main(); {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29905#true} {29905#true} #84#return; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {29905#true} assume true; {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {29905#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); {29905#true} is VALID [2022-04-28 11:28:06,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {29905#true} call ULTIMATE.init(); {29905#true} is VALID [2022-04-28 11:28:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 591 proven. 52 refuted. 0 times theorem prover too weak. 2387 trivial. 5 not checked. [2022-04-28 11:28:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 11:28:06,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110081960] [2022-04-28 11:28:06,700 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 11:28:06,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754337921] [2022-04-28 11:28:06,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754337921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 11:28:06,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 11:28:06,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-28 11:28:06,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 11:28:06,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334136763] [2022-04-28 11:28:06,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334136763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 11:28:06,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 11:28:06,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 11:28:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815383232] [2022-04-28 11:28:06,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 11:28:06,701 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 220 [2022-04-28 11:28:06,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 11:28:06,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2022-04-28 11:28:07,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:28:07,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 11:28:07,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 11:28:07,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 11:28:07,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=401, Unknown=2, NotChecked=42, Total=552 [2022-04-28 11:28:07,187 INFO L87 Difference]: Start difference. First operand 197 states and 206 transitions. Second operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2022-04-28 11:28:14,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-04-28 11:28:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:36,298 INFO L93 Difference]: Finished difference Result 201 states and 209 transitions. [2022-04-28 11:28:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 11:28:36,298 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 220 [2022-04-28 11:28:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 11:28:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2022-04-28 11:28:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2022-04-28 11:28:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2022-04-28 11:28:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 80 transitions. [2022-04-28 11:28:36,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 80 transitions. [2022-04-28 11:28:36,437 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-28 11:28:36,437 INFO L225 Difference]: With dead ends: 201 [2022-04-28 11:28:36,437 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 11:28:36,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 418 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=249, Invalid=940, Unknown=5, NotChecked=66, Total=1260 [2022-04-28 11:28:36,438 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 100 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 11:28:36,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 132 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 285 Invalid, 1 Unknown, 52 Unchecked, 4.5s Time] [2022-04-28 11:28:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 11:28:36,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 11:28:36,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 11:28:36,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:28:36,439 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:28:36,439 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:28:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:36,439 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:28:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:28:36,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:36,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:36,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:28:36,440 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 11:28:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 11:28:36,440 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 11:28:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:28:36,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:36,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 11:28:36,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 11:28:36,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 11:28:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 11:28:36,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 11:28:36,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2022-04-28 11:28:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 11:28:36,440 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 11:28:36,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 10 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2022-04-28 11:28:36,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 11:28:36,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 11:28:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 11:28:36,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 11:28:36,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 11:28:36,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-28 11:28:36,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 11:28:36,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 11:28:50,090 WARN L232 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 179 DAG size of output: 43 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:28:58,330 WARN L232 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 195 DAG size of output: 43 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:29:12,861 WARN L232 SmtUtils]: Spent 11.10s on a formula simplification. DAG size of input: 195 DAG size of output: 37 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:29:24,311 WARN L232 SmtUtils]: Spent 10.77s on a formula simplification. DAG size of input: 179 DAG size of output: 64 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:29:31,086 WARN L232 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 82 DAG size of output: 13 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:29:41,982 WARN L232 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 193 DAG size of output: 65 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:29:47,020 WARN L232 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 82 DAG size of output: 13 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:29:59,999 WARN L232 SmtUtils]: Spent 12.96s on a formula simplification. DAG size of input: 89 DAG size of output: 13 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 11:30:00,480 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 11:30:00,480 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 11:30:00,480 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 11:30:00,480 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-28 11:30:00,480 INFO L895 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (or (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= (select (select |#memory_int| 1) 1) 0))) [2022-04-28 11:30:00,480 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (= (select (select |#memory_int| 1) 1) 0))) [2022-04-28 11:30:00,480 INFO L895 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (or (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) (not (= (select (select |#memory_int| 1) 1) 0))) [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 46) the Hoare annotation is: (or (not (= (select (select |#memory_int| 1) 1) 0)) (let ((.cse0 (* main_~z~0 main_~z~0))) (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) .cse0 18)) (<= main_~a~0 100) (<= (mod main_~a~0 65536) 32767) (= (+ .cse0 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~n~0) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 12)) (<= (+ v_main_~y~0_253 main_~z~0 v_main_~z~0_264) (+ main_~y~0 6)))) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= main_~z~0 (+ v_main_~z~0_264 6)) (<= (+ v_main_~y~0_253 v_main_~z~0_264) main_~y~0)))))) [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 46) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 100) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))) (not (= (select (select |#memory_int| 1) 1) 0)))) [2022-04-28 11:30:00,481 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 56) the Hoare annotation is: true [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6))) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 100) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))) (not (= (select (select |#memory_int| 1) 1) 0)) (and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) .cse0 (= main_~x~0 8)))) [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6))) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 100) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))) (not (= (select (select |#memory_int| 1) 1) 0)) (and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) .cse0 (= main_~x~0 8)))) [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 100) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))) (not (= (select (select |#memory_int| 1) 1) 0)))) [2022-04-28 11:30:00,481 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 56) the Hoare annotation is: true [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L38(lines 33 46) the Hoare annotation is: (or (not (= (select (select |#memory_int| 1) 1) 0)) (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (and (<= main_~a~0 100) (= main_~x~0 (* .cse0 .cse0 .cse0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= .cse0 (+ main_~a~0 1)) (<= 0 main_~n~0)))) [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (or (not (= (select (select |#memory_int| 1) 1) 0)) (let ((.cse0 (div (+ main_~z~0 (- 6)) 6))) (and (<= main_~a~0 100) (= main_~x~0 (* .cse0 .cse0 .cse0)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= .cse0 (+ main_~a~0 1)) (<= 0 main_~n~0)))) [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (or (let ((.cse0 (* main_~z~0 main_~z~0))) (and (<= main_~n~0 (+ main_~a~0 1)) (= (+ (* main_~z~0 main_~y~0) (* main_~z~0 8)) (+ (* main_~x~0 18) .cse0 18)) (<= main_~a~0 100) (<= (mod main_~a~0 65536) 32767) (= (+ .cse0 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~n~0))) (not (= (select (select |#memory_int| 1) 1) 0))) [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (or (and (= (+ (* main_~x~0 18) (* 36 (* main_~n~0 main_~n~0)) 6 (* main_~n~0 24)) (+ (* (* main_~n~0 main_~y~0) 6) (* main_~y~0 6))) (<= main_~a~0 100) (<= (mod main_~a~0 65536) 32767) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= 0 main_~n~0) (exists ((v_main_~y~0_253 Int) (v_main_~z~0_264 Int)) (let ((.cse0 (* main_~n~0 6))) (and (= (+ 12 (* v_main_~z~0_264 v_main_~z~0_264)) (+ (* v_main_~z~0_264 6) (* v_main_~y~0_253 12))) (<= (+ v_main_~y~0_253 v_main_~z~0_264 .cse0) main_~y~0) (<= .cse0 (+ v_main_~z~0_264 6)))))) (not (= (select (select |#memory_int| 1) 1) 0))) [2022-04-28 11:30:00,481 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 56) the Hoare annotation is: true [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (* (- 1) main_~a~0))) (or (not (= (select (select |#memory_int| 1) 1) 0)) (and (< main_~a~0 65536) (<= 0 main_~a~0) (<= (div main_~a~0 (- 65536)) (div (+ .cse0 32767) 65536))) (and (<= 0 (+ 65536 main_~a~0)) (< (div (+ main_~a~0 32768) (- 65536)) (+ (div (+ (- 1) .cse0) 65536) 1)) (< main_~a~0 0)))) [2022-04-28 11:30:00,481 INFO L895 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (or (not (= (select (select |#memory_int| 1) 1) 0)) (and (<= main_~a~0 100) (<= 0 main_~a~0))) [2022-04-28 11:30:00,482 INFO L902 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: true [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (and .cse0 (= main_~x~0 1) (= (+ main_~y~0 6) (+ main_~z~0 main_~x~0)) (= main_~y~0 (+ main_~x~0 6))) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 100) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))) (not (= (select (select |#memory_int| 1) 1) 0)) (and (= (+ (* main_~x~0 2) 3) main_~y~0) (= (+ main_~x~0 10) main_~z~0) .cse0 (= main_~x~0 8)))) [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~n~0 6) 6) main_~z~0))) (or (and (= main_~x~0 0) (= main_~y~0 1) .cse0 (= main_~z~0 6)) (let ((.cse1 (div (+ main_~z~0 (- 6)) 6))) (and (not (<= .cse1 main_~a~0)) (<= main_~a~0 100) (= main_~x~0 (* .cse1 .cse1 .cse1)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) .cse0 (<= 0 main_~a~0) (<= .cse1 (+ main_~a~0 1)))) (not (= (select (select |#memory_int| 1) 1) 0)))) [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (or (not (= (select (select |#memory_int| 1) 1) 0)) (let ((.cse0 (* main_~y~0 12))) (and (<= main_~a~0 100) (= (+ (* main_~z~0 main_~z~0) 12) (+ .cse0 (* main_~z~0 6))) (= (+ (* main_~x~0 18) .cse0 6) (+ (* main_~z~0 2) (* main_~z~0 main_~y~0))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= (div (+ main_~z~0 (- 6)) 6) (+ main_~a~0 1)) (<= 0 main_~n~0)))) [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (or (and (<= main_~n~0 (+ main_~a~0 1)) (<= main_~a~0 100) (= (* main_~x~0 18) (* (* main_~n~0 main_~n~0 main_~n~0) 18)) (= (+ (* main_~z~0 main_~z~0) 12) (+ (* main_~y~0 12) (* main_~z~0 6))) (= (+ (* main_~n~0 6) 6) main_~z~0) (<= 0 main_~a~0) (<= 0 main_~n~0)) (not (= (select (select |#memory_int| 1) 1) 0))) [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (= (select (select |#memory_int| 1) 1) 0) [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (= (select (select |#memory_int| 1) 1) 0) [2022-04-28 11:30:00,482 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= (select (select |#memory_int| 1) 1) 0) [2022-04-28 11:30:00,482 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 11:30:00,482 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:30:00,482 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (and (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-28 11:30:00,482 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 11:30:00,484 INFO L356 BasicCegarLoop]: Path program histogram: [24, 6, 6, 6, 2, 2, 2, 2, 2] [2022-04-28 11:30:00,485 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 11:30:00,488 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 11:30:00,491 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation